ppxscal/embedding_network huggingface dataset:
Parallel functional programming on recursively defined data via data-parallel recursion
Authors: Susumu Nishimura, Atsushi Ohori
Venue: Journal of Functional Programming (1999)

This article proposes a new language mechanism for data-parallel processing of dynamically allocated recursively defined data. Different from the conventional array-based data- parallelism, it allows parallel processing of general recursively defined data such as lists or trees in a functional way. This is achieved by representing a recursively defined datum as a system of equations, and defining new language constructs for parallel transformation of a system of equations. By integrating them with a higher-order functional language, we obtain a functional programming language suitable for describing data-parallel algorithms on recursively defined data in a declarative way. The language has an ML style polymorphic type system and a type sound operational semantics that uniformly integrates the parallel evaluation mechanism with the semantics of a typed functional language. We also show the intended parallel execution model behind the formal semantics, assuming an idealized distributed memory multicomputer.
Exploring Efficient Operating Points for Voltage Scaled Embedded Processor Cores
Authors: Marcio Buss, Tony Givargis, Nikil Dutt
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Portable and battery operated devices pose a unique designchallenge in terms of performance requirements, low powerconstraints, and shrot design cycles.Embedded soft cores,on the other hand, provide functional flexibility and guaranteerapid design and thus are gaining popularity in designingsuch portable and battery operated devices.To addressthe low power needs, dynamic voltage scaled (DVS)processors provide a new tradeoff dimension to the designer.This work proposes an application-specific design space explorationframework for selecting energy-efficient operatingpoints in an embedded soft core.Specifically, we addressthe problem of selecting an appropriate number of operatingvoltage/frequency points and the distribution of these pointsalong the valid voltage span of a processor, given the applicationthat is to be executed on the processor.Furthermore,we provide a static intra-task scheduling techniquethat reduces energy consumption (4-20% in our experiments)even when the worst-case application execution time does notleave any slack for effective voltage scaling.We have experimentallyverified our techniques on a large set of embeddedbenchmarks selected from MiBench, PowerStone and MediaBench.
WINK: A Web-Based System for Collaborative Project Management in Virtual Enterprises
Authors: S. Bergamaschi, G. Gelati, F. Guerra, M. Vincini
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

The increasing of globalization and flexibility required to the companies has generated, in the last decade, new issues, related to the managing of large scale projects within geographically distributed networks and to the cooperation of enterprises. ICT support systems are required to allow enterprises to share information, guarantee data-consistency and establish synchronized and collaborative processes.In this paper we present a collaborative project management system that integrates data coming from aerospace industries with two main goals: avoiding inconsistencies generated byupdates at the sources' level and minimizing data replications. The proposed system is composed of a collaborative project management component supported by a web interface, a multiagent data integration component, which supports information sharing and querying, and SOAP enabled web-services which ensure the whole interoperability of the software components.The system was developed by the University of Modena and Reggio Emilia, Gruppo Formula S.p.A. and Alenia Spazio S.p.A. within the EU WINK Project (Web-linked Integration of Network based Knowledge - IST-2000-28221).
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
Authors: Wen-Guey Tzeng
Venue: IEEE Transactions on Computers (2004)

Abstract--In this paper, we propose efficient and secure (string) oblivious transfer (OT_n^1) schemes for any n\geq 2. We build our OT_n^1 scheme from fundamental cryptographic techniques directly. The receiver's choice is unconditionally secure and the secrecy of the unchosen secrets is based on the hardness of the decisional Diffie-Hellman problem. Some schemes achieve optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The distinct feature of our scheme is that the system-wide parameters are independent of n and universally usable, that is, all possible receivers and senders use the same parameters and need no trapdoors specific to each of them. We extend our OT_n^1 schemes to distributed oblivious transfer schemes. Our distributed OT_n^1 schemes take full advantage of the research results of secret sharing. For applications, we present a method of transforming any (single-database) PIR protocol into a symmetric PIR protocol by slightly increasing the communication cost only.
Package-silicon co-design - Experiment with an SOC design
Authors: P R. Suresh, P K. Sundararajan, Anshuli Goel, H Udayakumar, C Srinivasan, Vasudev Sinari, Raghavendrakumar Ravinutala
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, we describe a package-silicon co-designapproach attempted for an RF integrated SOCdesign. Extensive simulations were carried out todetermine the sensitivity of different package layoutparameters on signal integrity and noise relatedissues. These experiments helped in influencing thepackage layout design and the custom I/O cell design.The I/O and core bump locations, and the package vialocations were determined based on the reliability andnoise considerations. Both the floorplanning andpackage layout were fine tuned to optimize the areaand signal integrity issues. This was followed byextensive package simulations to determine the SSNand crosstalk numbers.
A process for post-implementation IT benchmarking
Authors: William J. Doll, Xiaodong Deng, Joseph A. Scazzero
Venue: Information and Management (2003)

Post-implementation learning involves continuing improvements in how effectively information technology (IT) is utilized. This kind of IT learning is a core competency that may determine the competitiveness of firms in information intensive industries. While many chief information officers (CIOs) may have some experience with infrastructure, user satisfaction, or business process benchmarking, few firms benchmark how effectively IT is utilized or its impact on the user's work.This paper proposes a web-enabled process for benchmarking IT outcomes (effective use and impacts) and diagnosing problems with the user's learning. This process is based on an explicit causal model of how induced and autonomous learning factors drive IT usage and impacts. The proposed process enables internal versus "best-in-class" causal analysis. We discuss the common considerations and key issues involved in implementing this IT benchmarking process.
The link prediction problem for social networks
Authors: David Liben-Nowell, Jon Kleinberg
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link prediction problem, and develop approaches to link prediction based on measures the "proximity" of nodes in a network. Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.
On the construction of effective vocabularies for information retrieval
Authors: G. Salton, Clement T. Yu
Venue: Proceedings of the 1973 meeting on Programming languages and information retrieval (1973)

Natural language query formulations exhibit advantages over artificial language statements since they permit the user to approach the retrieval environment without prior training and without using intermediaries. To obtain adequate retrieval output, it is however necessary to emphasize the good terms and to deemphasize the bad ones. The usefulness of the terms in a natural language vocabulary is first characterized in terms of their frequency distribution over the documents of a collection. The construction of "good" natural language vocabularies is then described, and methods are given for improving the vocabulary by transforming terms that operate poorly for retrieval purposes into better ones.
The Relevance of Non-Generic Events in Scale Space Models
Authors: Arjan Kuijper, Luc M. J. Florack
Venue: International Journal of Computer Vision (2004)

In order to investigate the deep structure of Gaussian scale space images, one needs to understand the behaviour of spatial critical points under the influence of blurring. We show how the mathematical framework of catastrophe theory can be used to describe and model the behaviour of critical point trajectories when various different types of generic events, viz. annihilations and creations of pairs of spatial critical points, (almost) coincide. Although such events are non-generic in mathematical sense, they are not unlikely to be encountered in practice due to numerical limitations. Furthermore, the behaviour of these trajectories leads to the observation that fine-to-coarse tracking of critical points doesn't suffice, since they can form closed loops in scale space. The modelling of the trajectories include these loops. We apply the theory to an artificial image and a simulated MR image and show the occurrence of the described behaviour.
Usability issues for E-commerce in South Africa: an empirical investigation
Authors: Lynette Barnard, Janet L. Wesson
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Many researchers have found that E-commerce and usability are inextricably linked, since unusable E-commerce sites are often also unsuccessful. The purpose of this paper is to discuss an empirical investigation that was conducted in South Africa to determine if there were any usability problems on three well-known South African E-commerce sites and one international site. This paper gives a brief introduction to E-commerce, trust and usability and then discusses the empirical evaluation. The results of the empirical evaluation are presented and plans for future research highlighted.
Graver complexity of monomial curves in p3
Authors: Dave Bayer
Venue:  (2003)

The Graver complexity of a matrix A is defined in terms of higher Lawrence liftings [18]. We investigate the geometric properties of the Graver basis of matrices that define monomial curves in P3 and use it to determine an upper bound for the Graver complexity of the matrix. We apply the results of Barvinok [1] to define a rational generating function for the Graver basis of A . Bayer-Popescu-Sturmfels [2] showed that the diagonal embedding of a unimodular toric variety X has as its defining ideal a Lawrence ideal determined by elements in the Chow group CL (X). We extend this result to define the diagonal embedding in terms of higher Lawrence liftings.
Multispectral reconstruction of bioluminescence term in natural waters
Authors: Ezzat S. Chalhoub, Haroldo F. de Campos Velho
Venue: Applied Numerical Mathematics (2003)

An inverse analysis for the estimation of internal sources in natural waters using remote sensing data is presented. The analysis involves a forward model that utilizes an analytical discrete-ordinates method for solving the radiative transfer equation and an inverse model which contains an algorithm for least-squares estimation that is iteratively solved for retrieving the internal source profile by using the Levenberg-Marquardt optimizer. The experimental data are simulated with synthetic data (exit radiances), which are calculated at the surface of the water and corrupted with noise. The results show that the internal sources can be recovered with good accuracy, even for high noisy data.
Security Warrior
Authors: Cyrus Peikari, Anton Chuvakin
Venue:  (2004)

When it comes to network security, many users and administrators are running scared, and justifiably so. The sophistication of attacks against computer systems increases with each new Internet worm. What's the worst an attacker can do to you? You'd better find out, right? That's what Security Warrior teaches you. Based on the principle that the only way to defend yourself is to understand your attacker in depth, Security Warrior reveals how your systems can be attacked. Covering everything from reverse engineering to SQL attacks, and including topics like social engineering, antiforensics, and common attacks against UNIX and Windows systems, this book teaches you to know your enemy and how to be prepared to do battle. Security Warrior places particular emphasis on reverse engineering. RE is a fundamental skill for the administrator, who must be aware of all kinds of malware that can be installed on his machines -- trojaned binaries, "spyware" that looks innocuous but that sends private data back to its creator, and more. This is the only book to discuss reverse engineering for Linux or Windows CE. It's also the only book that shows you how SQL injection works, enabling you to inspect your database and web applications for vulnerability. Security Warrior is the most comprehensive and up-to-date book covering the art of computer war: attacks against computer systems and their defenses. It's often scary, and never comforting. If you're on the front lines, defending your site against attackers, you need this book. On your shelf--and in your hands.
Matroids Having Small Circumference
Authors: Bráulio Maia,  Jr., Manoel Lemos
Venue: Combinatorics, Probability and Computing (2001)

In this paper, we conclude the construction of all the matroids having circumference at most five. We use this result to prove a conjecture of Hochst&auml;ttler and Jackson, in a special case.
State of the art of graph-based data mining
Authors: Takashi Washio, Hiroshi Motoda
Venue: ACM SIGKDD Explorations Newsletter (2003)

The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. It can therefore be no surprise that graph based data mining has become quite popular in the last few years.This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining. Brief descriptions of some representative approaches are provided as well.
Design and Implementation of a Parallel Fish Model for South Florida
Authors: Dali Wang, Eric A. Carr, Louis J. Gross, Michael W. Berry
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

A parallel, spatially explicit landscape fish population model (ALFISH) is presented hereby tomodel the impacts of different water management strategies in the South Florida region on the fresh water fish population, which in turn provides the information on the food resource available to wading birds. Adopting a static domain partitioning scheme and using message-passing, the parallel ALFISH model mimics the basic behaviors of fresh water fish based on the interaction of four components -- landscape, hydrology, lower trophic biomass, and fish, over a time span up to several decades. The parallel ALFISH model delivers accurate results in simulations. Compared to the average simulation time of the sequential model, which is about 35 hours, the parallel model yields substantial speed improvement. On a symmetric multiprocessor (SMP), the execution time of the parallel ALFISH model on 13 processors is less than 4 hours -- a speedup factor of near 9.
The optimal placement of replicas in a network using a READ ANY - WRITE ALL policy
Authors: Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

This paper studies the problem of the optimal placement of replicas in a network so that communications costs are minimized when a strict consistency policy is in effect. A READ ANYWRITE ALL policy is introduced, and the appropriate cost function is developed to measure the relative effectiveness of each choice of replica placement. The general problem is proven to be NP complete. An efficient polynomial-time dynamic programming algorithm is introduced for linear graphs. A zero-one linear programming solution is provided for the general problem, using the cost function introduced here. A parametric approach is taken to the problem in the situation in which all activities of each node are identical. This leads to the introduction of piecewise linear solutions to particular problems and the existence of an underlying enveloping curve for the problem.The approach taken to the problem here is to examine simple models to develop some understanding of the issues. This has led to a number of interesting and challenging mathematical questions.
On L &times; n boolean matrices with all L &times; k submatrices having 2k distinct row vectors
Authors: Hongzhong Wu
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a new method to construct an L &times; n boolean matrix for two given integers n and k (k < n), such that every L < k submatrix contains 2k distinct row vectors of {1, 0}k. The magnitude of L is O ((log n)2 log k). This method has considerable advantage for small k and practical n. It can be applied to test generation of VLSI circuits, design of threshold circuits and fault tolerant systems, and other fields.
Improving graph partitions using submodular functions
Authors: Sachin B. Patkar, H. Narayanan
Venue: Discrete Applied Mathematics (2003)

We investigate into the role of submodular functions in designing new heuristics and approximate algorithms to some NP-hard problems arising in the field of VLSI Design Automation. In particular, we design and implement efficient heuristic for improving a bipartition of a graph in the sense of ratioCut (Discrete Appl. Math. 90 (1999) 3; 29th Annual Symposium on Foundations of Computer Science, 1988, p. 422). We also design an approximate algorithm for another NP-hard problem which is a dual of the well-known NP-hard problem of finding a densest k-subgraph of a graph (see J. Algorithms 34 (2000) 203; Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, p. 692). Our algorithms are based on submodular function and are implementable in polynomial time using efficient network flow based subroutines. To the best of our knowledge our algorithms are the first ones to use submodular functions based approach for the problems considered here. We also describe the experimental results which provide the evidence of our heuristic for improving the ratioCut.
Software estimation using the SLIM tool
Authors: Nikki Panlilio-Yap
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Planning the development of a software product involves estimating the required effort, project duration, resource allocation, and latent defects when the product ships. Coming up with reasonable estimates seems to be a pervasive problem. In the absence of an internally developed tool based on historical data from the IBM Canada Ltd. Laboratory or similar IBM laboratories, the use of one or more commercially available estimation tools is useful. Some of these tools have underlying models based on thousands of software development projects from industry. This paper describes the SLIM product, a metrics-based estimation tool that has been piloted in a number of our projects. The basic concepts are explained and illustrated with an example from a Toronto project. The tool's rich set of what-if capabilities is used to explore possible alternative plans that satisfy project constraints. The impact of high staff buildup to achieve schedule compression is examined. Effects on resource requirements, project duration, and product quality are assessed. The usefulness of the tool for heading off potential disasters is discussed.
Interpretations of Association Rules by Granular Computing
Authors: Yuefeng Li, Ning Zhong
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

This paper presents interpretations for associationrules. It first introduces Pawlak's method, and thecorresponding algorithm of finding decision rules (a kindof association rules). It then uses extended random sets topresent a new algorithm of finding interesting rules. Itproves that the new algorithm is faster than Pawlak'salgorithm. The extended random sets are easily to includemore than one criterion for determining interesting rules.They also provide two measures for dealing withuncertainties in association rules.
A 3D incompressible thermal lattice Boltzmann model and its application to simulate natural convection in a cubic cavity
Authors: Y. Peng, C. Shu, Y. T. Chew
Venue: Journal of Computational Physics (2004)

A 3D incompressible thermal lattice Boltzmann model is proposed in this paper to solve 3D incompressible thermal flow problems. Two different particle velocity models of D3Q15 and D3Q19 are incorporated in our thermal model. It is indicated that the present thermal model is simple and easy for implementation. It is validated by its application to simulate the 3D natural convection of air in a cubical enclosure, which is heated differentially at two vertical side walls. Good agreement was obtained between the present results and those from a Navier-Stokes solver.