ppxscal/embedding_network huggingface dataset:
Programming the Linpack benchmark for the IBM PowerXCell 8i processor
Authors: Michael Kistler John Gunnels Daniel Brokenshire Brad Benton
Venue: Scientific Programming (2009)

In this paper we present the design and implementation of the Linpack benchmark for the IBM BladeCenter QS22, which incorporates two IBM PowerXCell 8i 1 processors. The PowerXCell 8i is a new implementation of the Cell Broadband Engine&trade; 2 architecture and contains a set of special-purpose processing cores known as Synergistic Processing Elements (SPEs). The SPEs can be used as computational accelerators to augment the main PowerPC processor. The added computational capability of the SPEs results in a peak double precision floating point capability of 108.8 GFLOPS. We explain how we modified the standard open source implementation of Linpack to accelerate key computational kernels using the SPEs of the PowerXCell 8i processors. We describe in detail the implementation and performance of the computational kernels and also explain how we employed the SPEs for high-speed data movement and reformatting. The result of these modifications is a Linpack benchmark optimized for the IBM PowerXCell 8i processor that achieves 170.7 GFLOPS on a BladeCenter QS22 with 32 GB of DDR2 SDRAM memory. Our implementation of Linpack also supports clusters of QS22s, and was used to achieve a result of 11.1 TFLOPS on a cluster of 84 QS22 blades. We compare our results on a single BladeCenter QS22 with the base Linpack implementation without SPE acceleration to illustrate the benefits of our optimizations.
Corporate venture capital in the computer industry
Authors: Kenneth W. Rind, Gene I. Miller
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Venture capital as practiced by industrial firms differs from conventional venture investing in that motivations beyond strictly financial reward are usually present. Typically, a corporate venture capitalist will be seeking to gain exposure to new markets/technologies, generate new products, develop acquisition candidates, and/or assist a supplier/customer. Corporations also may utilize venture capital concepts in spinning off businesses which are not appropriately kept inside, or in initiating new ventures internally.
On the spanning fan-connectivity of graphs
Authors: Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu
Venue: Discrete Applied Mathematics (2009)

Let G be a graph. The connectivity of G, @k(G), is the maximum integer k such that there exists a k-container between any two different vertices. A k-container of G between u and v, C"k(u,v), is a set of k-internally-disjoint paths between u and v. A spanning container is a container that spans V(G). A graph G is k^*-connected if there exists a spanning k-container between any two different vertices. The spanning connectivity of G, @k^*(G), is the maximum integer k such that G is w^*-connected for 1@?w@?k if G is 1^*-connected. Let x be a vertex in G and let U={y"1,y"2,...,y"k} be a subset of V(G) where x is not in U. A spanningk-(x,U)-fan, F"k(x,U), is a set of internally-disjoint paths {P"1,P"2,...,P"k} such that P"i is a path connecting x to y"i for 1@?i@?k and @?"i"="1^kV(P"i)=V(G). A graph G is k^*-fan-connected (or k"f^*-connected) if there exists a spanning F"k(x,U)-fan for every choice of x and U with |U|=k and x@?U. The spanning fan-connectivity of a graph G, @k"f^*(G), is defined as the largest integer k such that G is w"f^*-connected for 1@?w@?k if G is 1"f^*-connected. In this paper, some relationship between @k(G), @k^*(G), and @k"f^*(G) are discussed. Moreover, some sufficient conditions for a graph to be k"f^*-connected are presented. Furthermore, we introduce the concept of a spanning pipeline-connectivity and discuss some sufficient conditions for a graph to be k^*-pipeline-connected.
Fields of Experts
Authors: Stefan Roth, Michael J. Black
Venue: International Journal of Computer Vision (2009)

We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach provides a practical method for learning high-order Markov random field (MRF) models with potential functions that extend over large pixel neighborhoods. These clique potentials are modeled using the Product-of-Experts framework that uses non-linear functions of many linear filter responses. In contrast to previous MRF approaches all parameters, including the linear filters themselves, are learned from training data. We demonstrate the capabilities of this Field-of-Experts model with two example applications, image denoising and image inpainting, which are implemented using a simple, approximate inference scheme. While the model is trained on a generic image database and is not tuned toward a specific application, we obtain results that compete with specialized techniques.
Model checking communicative agent-based systems
Authors: Jamal Bentahar, John-Jules Meyer, Wei Wan
Venue: Knowledge-Based Systems (2009)

Model checking is a formal technique used to verify communication protocols against given properties. In this paper, we propose a new model checking algorithm aims at verifying systems designed as a set of autonomous interacting agents. These software agents are equipped with knowledge and beliefs and interact with each other according to protocols governed by a set of logical rules. We present a tableauased version of this algorithm and provide the soundness, completeness, termination and complexity results. A case study about an agent-based negotiation protocol and its implementation are also described.
Time-space trellis coding for multi-antennas transmission systems
Authors: Anou Abderrahmane, Mehdi Merouane, Bensebti Messaoud
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

This work deals with the performance analysis of improved space-time trellis coding used for ultra high data rates radio systems. A comparison of classic STBC and STTC and the proposed super orthogonal STTC is achieved in order to evaluate the performances. The new technique seems to behave better in the same channel conditions with a slightly higher complexity in the trellis design.
A Concept Planning Algorithm for Pragmatics Web Service Discovery
Authors: Zhai Sheping, Li Zengzhi, Wei Juanli
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In order to better make an agreement on both the discovery results of Semantic Web services and the intentions of the service requester, advance the accurate rate of service discovery, and improve the automation performance in service discovery and selection. We add the context knowledge of service provider and requester to service representation, and employ the planning method to achieve the understanding for the private ontology concepts between service participants. Experiments using the standard services test sets show that the performance of service discovery is improved significantly, though the time of discovery is delayed. Especially, when domain ontologies which are used to describe concerning services have many semantics difference, the result of discovering services is more precise. The innovations of this paper are to propose a semantics concept model for the Pragmatics Web service and a service discovery algorithm based concept planning understanding.
Analysis of Linear Hybrid Systems in CLP
Authors: Gourinath Banda, John P. Gallagher
Venue: Logic-Based Program Synthesis and Transformation: 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers (2009)

In this paper we present a procedure for representing the semantics of linear hybrid automata (LHAs) as constraint logic programs (CLP); flexible and accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive notation for specifying real-time systems. The main contributions are (i) a technique for capturing the reachable states of the continuously changing state variables of the LHA as CLP constraints; (ii) a way of representing events in the LHA as constraints in CLP, along with a product construction on the CLP representation including synchronisation on shared events; (iii) a framework in which various kinds of reasoning about an LHA can be flexibly performed by combining standard CLP transformation and analysis techniques. We give experimental results to support the usefulness of the approach and argue that we contribute to the general field of using static analysis tools for verification.
Finite element approximation of the elasticity spectral problem on curved domains
Authors: Erwin Hernández
Venue: Journal of Computational and Applied Mathematics (2009)

We analyze the finite element approximation of the spectral problem for the linear elasticity equation with mixed boundary conditions on a curved non-convex domain. In the framework of the abstract spectral approximation theory, we obtain optimal order error estimates for the approximation of eigenvalues and eigenvectors. Two kinds of problems are considered: the discrete domain does not coincide with the real one and mixed boundary conditions are imposed. Some numerical results are presented.
Me and you and everyone we know: An empirical analysis of local network effects in mobile communications
Authors: Nicoletta Corrocher, Lorenzo Zirulia
Venue: Telecommunications Policy (2009)

This paper investigates the importance that consumers assign to local network effects, i.e. the extent to which they take account of their contacts' mobile operators when choosing a provider for themselves. The authors identify individual characteristics that affect the importance consumers attach to local network effects. The study relies on a survey of 193 Italian students. The results show that consumers are highly heterogeneous with respect to the importance they give to the operators chosen by their friends/family members in choosing which provider to use. This heterogeneity is associated with individual innovativeness and patterns of mobile phone usage. For instance, consumers who are more interested in local network effects are typically more-aware users, who use voice services quite intensively. These consumers, who pay attention to local network effects, spend comparatively little proportional to the intensity of their mobile usage.
Testing the number of components of the mixture of two inverse Weibull distributions
Authors: K. S. Sultan, M. A. Ismail, A. S. Al-Moisheer
Venue: International Journal of Computer Mathematics (2009)

In this paper, we use the likelihood ratio test (LRT) for testing the number of components in a mixture of two inverse Weibull distributions (MTIWD). First, we formulate the null distribution of the likelihood ratio statistic. Next, we calculate the percentage points of the test statistic under two different stopping criteria. In addition, we compute the power of the proposed test under these two stopping criteria and show that global maximization of the likelihood is not necessary to obtain a good power of the LRT. Finally, we discuss two applications to illustrate whether a set of data arises from a single or a MTIWD.
The research of PSK modulated signal using the improved IJF pulse
Authors: Haiqiang Chen, Tuanfa Qin, Zhenrong Zhang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The Inter-symbol interference time Jitter Free (IJF) coding and Constant Phase Modulation (CPM) technologies are very important in nonlinear communication channels. In this paper, we have discussed the principle and the properties of the IJF baseband pulses. By using pulse-shaping and phase path-controlled technologies, a new IJF pulse is presented which has better performance. Simulation results show that when the improved IJF pulse is applied to the PSK technology, the IJF modulated signals can provide more continuous phase path and get 3 dB envelope fluctuation reduction with small additional complexity.
Acoustic Sensor Network-Based Parking Lot Surveillance System
Authors: Keewook Na, Yungeun Kim, Hojung Cha
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Camera-based surveillance systems are commonly installed in many parking lots as a countermeasure for parking lot accidents. Unfortunately these systems cannot effectively prevent accidents in advance but provide evidence of the accidents or crimes. This paper describes the design, implementation, and evaluation of an acoustic-sensor-network-based parking lot surveillance system. The system uses sensor nodes equipped with low-cost microphones to localize acoustic events such as car alarms or car crash sounds. Once the acoustic event is localized, the cameras are adjusted to the estimated location to monitor and record the current situation. We conducted extensive experiments in a parking lot to validate the performance of the system. The experimental results show that the system achieves reasonable accuracy and performance to localize the events in parking lots. The main contribution of our work is to have applied low-cost acoustic sensor network technologies to a real-life situation and solved many of the practical issues found in the design, development, and evaluation of the system.
The Importance of Being (A Little Bit) Discrete
Authors: Luca Bortolussi, Alberto Policriti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We compare the hybrid, stochastic, and differential semantics for stochastic Concurrent Constraint Programming, focussing on the exhibited behavior of models and their robustness. By investigating in detail two case studies, a circadian clock model and the Repressilator, we comment on the effect of the introduction of a limited amount of discreteness in the description of biological systems with hybrid automata. Experimental evidence suggests that discreteness increases robustness of the models.
Flag-transitive symmetric 2-(96,20,4)-designs
Authors: Maska Law, Cheryl E. Praeger, Sven Reichard
Venue: Journal of Combinatorial Theory Series A (2009)

We construct four flag-transitive symmetric designs having 96 points, blocks of size 20, and 4 blocks on each point-pair. Moreover we prove that these are the only such designs. Our classification completes the classification of flag-transitive, point-imprimitive, symmetric designs with the (constant) number of blocks on a point-pair at most four.
A noise-driven mechanism for adaptive growth rate regulation
Authors: Chikara Furusawa, Kunihiko Kaneko, Hiroshi Shimizu
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

How can a microorganism adapt to a variety of environmental conditions despite there exists a limited number of signal transduction mechanisms? We show that for any growing cells whose gene expression fluctuate stochastically, adaptive cellular state is inevitably selected by noise, even without specific signal transduction network for it. In general, changes in protein concentration in a cell are given by its synthesis minus dilution and degradation, both of which are proportional to the rate of cell growth. In an adaptive state with a higher growth speed, both terms are large and balanced. Under the presence of noise in gene expression, the adaptive state is less affected by stochasticity since both the synthesis and dilution terms are large, while for a non-adaptive state both the terms are smaller so that cells are easily kicked out of the original state by noise. Hence, escape time from a cellular state and the cellular growth rate are negatively correlated. This leads to a selection of adaptive states with higher growth rates, and model simulations confirm this selection to take place in general. The results suggest a general form of adaptation that has never been brought to light - a process that requires no specific mechanisms for sensory adaptation. The result here provides a clue to understand flexible adaptation process in a cell, and also may provide a novel control mechanism useful in the field of engineering.
Rural encounters: cultural translations through video
Authors: David Browning, Nicola J Bidwell, Dianna Hardy, P-M Standley
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Requirements gathering for design in rural and remote areas needs to be considered within the prevailing cultural context. We explain our use of video as a technological site for cultural encounters during the preparatory elicitation of cultural influences and determinants. We outline the factors leading to the development of a co-generative approach arising from our understanding of the role played by indexicality during such encounters with different cultural systems of knowledge.
How to be a responsible slave: managing the use of expert information systems
Authors: Emma Rooksby
Venue: Ethics and Information Technology (2009)

Computer ethicists have for some years been troubled by the issue of how to assign moral responsibility for disastrous events involving erroneous information generated by expert information systems. Recently, Jeroen van den Hoven has argued that agents working with expert information systems satisfy the conditions for what he calls epistemic enslavement. Epistemically enslaved agents do not, he argues, have moral responsibility for accidents for which they bear causal responsibility. In this article, I develop two objections to van den Hoven's argument for epistemic enslavement of agents working with expert information systems.
Revisiting bitwidth optimizations
Authors: Jason Cong, Karthik Gururaj, Bin Liu, Chunyue Liu, Yi Zou, Zhiru Zhang, Sheng Zhou
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This paper revisits the classical bitwidth optimization problem for fixed-point designs. Our approach also starts from static analysis (range analysis and precision analysis) techniques. We first point out that AA-based precision analysis, which is widely used in many previous works, are not correctly applied for some corner cases. We propose to use interval coefficients to model the sensitivity (the mathematic form is similar to classical generalized interval arithmetic) to correct those issues. Based on the analysis, we use a convex optimization problem to optimize the area costs. In the formulation, we also allow different bitwidths for the multiple uses of the same signal. We get an additional 2% to 3% area reduction compared with previous AA-based analysis and optimizations. We also conduct some optimality study to see how much the gap between the current methods and the possible optimal point is.
A Novel Particle Swarm Optimization for Constrained Engineering Optimization Problems
Authors: Minghai Jiao, Jiafu Tang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A novel particle swarm optimization algorithm CEOPSO (Constrained Engineering Optimization via Particle Swarm Optimization) is proposed for solving the constrained engineering design optimization problems in this paper. In CEOPSO, a new constraint handling mechanism with three rules of ¿ comparison technique is introduced to keep a certain proportion of infeasible individuals in the population during the iterations of PSO since some infeasible individuals that have better fitness values maybe promising. In addition, we present an improved doubly-link ring neighbourhood structure and a BLX-¿ combination method to prevent the search from being trapped into local minima. Computational results based on several well-known constrained engineering design problems show that the proposed CEOPSO algorithm performs better than the other recent approaches reported in the literature and demonstrate the robustness and competitiveness of CEOPSO.
The well-posedness of an M/G/1 queue with second optional service and server breakdown
Authors: Wen-Long Wang, Gen-Qi Xu
Venue: Computers Mathematics with Applications (2009)

In this paper, the solution of an M/G/1 queue with second optional service and server breakdown is investigated. By using the method of functional analysis, especially, the linear operator theory and the C"0 semigroup theory on Banach space, we prove the well-posedness of the system, and show the existence of a positive solution.
The Problem With the Linpack Benchmark 1.0 Matrix Generator
Authors: Jack J. Dongarra, Julien Langou
Venue: International Journal of High Performance Computing Applications (2009)

We characterize the matrix sizes for which the Linpack Benchmark 1.0 matrix generator constructs a matrix with identical columns.
Convergence of lattice Boltzmann methods for Navier&#x2013;Stokes flows in periodic and bounded domains
Authors: Michael Junk, Zhaoxia Yang
Venue: Numerische Mathematik (2009)

Combining an asymptotic analysis of the lattice Boltzmann method with a stability estimate, we are able to prove some convergence results which establish a strict relation to the incompressible Navier&#x2013;Stokes equation. The proof applies to the lattice Boltzmann method in the case of periodic domains and for specific bounded domains if the Dirichlet boundary condition is realized with the bounce back rule.
Unbounded-Error Quantum Query Complexity
Authors: Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We first show that, just as in the communication complexity model, the unbounded-error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Next, connecting the query and communication complexity results, we show that the "black-box" approach to convert quantum query algorithms into communication protocols by Buhrman-Cleve-Wigderson [STOC'98] is optimal even in the unbounded-error setting. We also study a related setting, called the weakly unbounded-error setting. In contrast to the case of communication complexity, we show a tight multiplicative &theta;(logn) separation between quantum and classical query complexity in this setting for a partial Boolean function.
Knocking on elders' door: investigating the functional and emotional geography of their domestic space
Authors: Chiara Leonardi, Claudio Mennecozzi, Elena Not, Fabio Pianesi, Massimo Zancanaro, Francesca Gennai, Antonio Cristoforetti
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The domestic environment is more than a place where to live. It is a territory of meaning, a place where pleasure, affect and aesthetics are deeply interwoven with the functional and utilitarian dimensions. With the aging process, the home is progressively invested with new meanings and functions, and becomes the emotional center of older people's life. This paper presents a user study based on cultural probes on how domestic spaces are managed and perceived by older adults, uncovering some of the complex interrelations among the daily activities, objects and meanings revolving around the home. The findings provide suggestions on how the dimensions of remembrance, perception of safety and environmental stability may affect the design of domestic technology for elderly people.