ppxscal/embedding_network huggingface dataset:
A Comparative Study on Neural Network Based Soccer Result Prediction
Authors: Burak Galip Aslan, Mustafa Murat Inceoglu
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This study mainly remarks the efficiency of black- box modeling capacity of neural networks in the case of forecasting soccer match results, and opens up several debates on the nature of prediction and selection of input parameters. The selection of input parameters is a serious problem in soccer match prediction systems based on neural networks or statistical methods. Several input vector suggestions are implemented in literature which is mostly based on direct data from weekly charts. Here in this paper, two different input vector parameters have been tested via learning vector quantization networks in order to emphasize the importance of input parameter selection. The input vector parameters introduced in this study are plain and also meaningful when compared to other studies. The results of different approaches presented in this study are compared to each other, and also compared with the results of other neural network approaches and statistical methods in order to give an idea about the successful prediction performance. The paper is concluded with discussions about the nature of soccer match forecasting concept that may draw the interests of researchers willing to work in this area.
Link analysis using time series of web graphs
Authors: Lei Yang, Lei Qi, Yan-Ping Zhao, Bin Gao, Tie-Yan Liu
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Link analysis is a key technology in contemporary web search engines. Most of the previous work on link analysis only used information from one snapshot of web graph. Since commercial search engines crawl the Web periodically, they will naturally obtain time series data of web graphs. The historical information contained in the series of web graphs can be used to improve the performance of link analysis. In this paper, we argue that page importance should be a dynamic quantity, and propose defining page importance as a function of both PageRank of the current web graph and accumulated historical page importance from previous web graphs. Specifically, a novel algorithm named TemporalRank is designed to compute the proposed page importance. We try to use a kinetic model to interpret this page importance and show that it can be regarded as the solution to an ordinary differential equation. Experiments on link analysis using web graph data in five snapshots show that the proposed algorithm can outperform PageRank in many measures, and can effectively filter out newly appeared link spam websites.
Authors' Reply3
Authors: K. Fukunaga, D. R. Olsen
Venue: IEEE Transactions on Computers (1971)

In the statistical method proposed by Trunk [2], [3], he calculates the density function p(X|N) where X= [xl. .. xn,]Tis the observed random vector and N(= 1, 2,...) is the intrinsic number of parameters for the random vector. The most likely N for the observed vectors is determined by applying the multihypotheses test to these density functions. The number of rand
Direct metallization of gold patterns on polyimide substrate by microcontact printing and selective surface modification
Authors: S. S. Yoon, D. O. Kim, S. C. Park, Y. K. Lee, H. Y. Chae, S. B. Jung, J. -D. Nam
Venue: Microelectronic Engineering (2008)

Patterned gold microstructures were fabricated on a polymer substrate by a novel method involving selective electroless plating and microcontact printing. The micro-sized gold patterns were made by the site-selective chemical modification of polyimide substrate films using aqueous potassium hydroxide solution and microcontact printing with a pitch size in the range of 20-200@mm. The base-treated area of the polyimide film became hydrophilic in the regions where the ion-exchange reactions took place for the subsequent metallization. The hydrophilic patterns were sensitized by placing the film in a solution of PdCl"2 and, subsequently, the activated substrate was immersed in an electroless plating solution of Ni and Au to provide well-developed gold patterns on polyimide substrate films.
Enhanced sound perception by widespread-onset neuronal responses in auditory cortex
Authors: Osamu Hoshino
Venue: Neural Computation (2007)

Accumulating evidence suggests that auditory cortical neurons exhibit widespread-onset responses and restricted sustained responses to sound stimuli. When a sound stimulus is presented to a subject, the auditory cortex first responds with transient discharges across a relatively large population of neurons, showing widespread-onset responses. As time passes, the activation becomes restricted to a small population of neurons that are preferentially driven by the stimulus, showing restricted sustained responses. The sustained responses are considered to have a role in expressing information about the stimulus, but it remains to be seen what roles the widespread-onset responses have in auditory information processing. We carried out numerical simulations of a neural network model for a lateral belt area of auditory cortex. In the network, dynamic cell assemblies expressed information about auditory sounds. Lateral excitatory and inhibitory connections were made between cell assemblies, respectively, by direct and indirect projections via interneurons. Widespread-onset neuronal responses to sound stimuli (bandpassed noises) took place over the network if lateral excitation preceded lateral inhibition, making a time widow for the onset responses. The widespread-onset responses contributed to the accelerating reaction time of neurons to sensory stimulation. Lateral interaction among dynamic cell assemblies was essential for maintaining ongoing membrane potentials near thresholds for action potential generation, thereby accelerating reaction time to subsequent sensory input as well. We suggest that the widespread-onset neuronal responses and the ongoing subthreshold cortical state, for which the coordination of lateral synaptic interaction among dissimilar cell assemblies is essential, may work together in order for the auditory cortex to quickly detect the sudden occurrence of sounds from the external environment.
A Hybrid Memory Sub-system for Video Coding Applications
Authors: Su-Shin Ang, George Constantinides, Wayne Luk, Peter Cheung
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper introduces a parameterisable, application and platform-independent, hybrid memory sub-system for custom hardware. This memory sub-system consists of a scratchpad memory (SPM) and a custom parallel cache, which exploits data re-use effectively in spite of data dependence. The cache is capable of exploiting spatial locality of memory accesses in two dimensions, making it ideal for video applications. Further, we present a case study involving the Quad-tree Structured Pulse Code Modulation (QSDPCM) algorithm, commonly used in MPEG applications. Specifically, the data dependent nature of memory accesses is demonstrated. Using the memory sub-system, performance improvements of up to 1.7× and 1.4× are obtained when the application is implemented on an Altera Stratix 2 chip and a Xilinx Virtex 2 chip respectively, compared to a SPM implementation. In addition, memory savings of up to 3.2× are achieved. These results emphasize the importance of developing dynamic memory sub-systems for custom hardware applications.
Introduction to Programming High Performance Applications on the CELL Broadband Engine
Authors: Jakub Kurzak, Alfredo Buttari
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Programming the STI CELL processor is about successfully exploiting its potential for delivering very high performance. The purpose of this tutorial is to give the programmer practical guidelines for achieving this goal. We begin by a brief overview of the main CELL architectural features and its software development environment. Then we discuss three basic aspects of CELL programming: SPE SIMD kernel development (vectorization), SPE parallelization and intra-chip communication. We show how high performance SPE kernels are created by replacing scalar operations with vector ones, heavily unrolling loops, and exploiting dual-issue nature of the SPE architecture. We explain coding using SIMD C language extensions (intrinsics), as well as using assembly language and discuss aspects specific to code development in assembly. We present static performance analysis using the spu-timing tool. The presentation of intra-chip communication follows, with emphasis on DMA communication both for bulk data transfers as well as for synchronization. We discuss message size and alignment restrictions, enforcing of message ordering using barrier and fence mechanisms and creation of complex data transfers using DMA lists. We conclude the topic with guidelines on implementing pipelined processing with direct local store to local store communication. We discuss basic profiling techniques using the SPE decrementer.
Signatures of Incoherence in a Quantum Information Processor
Authors: Michael K. Henry, Alexey V. Gorshkov, Yaakov S. Weinstein, Paola Cappellaro, Joseph Emerson, Nicolas Boulant, Jonathan S. Hodges, Chandrasekhar Ramanathan, Timothy F. Havel, Rudy Martinez, David G. Cory
Venue: Quantum Information Processing (2007)

Incoherent noise is manifest in measurements of expectation values when the underlying ensemble evolves under a classical distribution of unitary processes. While many incoherent processes appear decoherent, there are important differences. The distribution functions underlying incoherent processes are either static or slowly varying with respect to control operations and so the errors introduced by these distributions are refocusable. The observation and control of incoherence in small Hilbert spaces is well known. Here we explore incoherence during an entangling operation, such as is relevant in quantum information processing. As expected, it is more difficult to separate incoherence and decoherence over such processes. However, by studying the fidelity decay under a cyclic entangling map we are able to identify distinctive experimental signatures of incoherence. This is demonstrated both through numerical simulations and experimentally in a three qubit nuclear magnetic resonance implementation.
An Index Structure To Retrieve Documents With Geographic Information
Authors: Miguel R. Luaces, Jose R. Parama, Oscar Pedreira, Diego Seco, Jose R. R. Viqueira
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Both Geographic Information Systems and Informa- tion Retrieval have been very active research fields in the last decades. Lately, a new research field called Ge- ographic Information Retrieval has appeared from the intersection of these two fields. The main goal of this field is to define index structures and techniques to effi ciently store and retrieve documents using both the text and the geographic references contained within the text. We present in this paper the architecture of a sys- tem for geographic information retrieval. It defines a workflow for the extraction of the geographic references in the document. In addition, a new index structure is defined that combines an inverted index, a spatial index, and an ontology. This structure improves the query capabilities of other proposals.
Kinetic approach to granular matter in a medium
Authors: M. Bisi, G. Spiga
Venue: Computers Mathematics with Applications (2008)

A kinetic model for a granular gas of particles inelastically scattering between themselves, and interacting simultaneously with a given background medium by conservative binary encounters is analysed in the collision dominated regime (small elastic mean free path). For the hard sphere collision model, the problem of a consistent derivation of macroscopic equations for the fundamental observables (density, mass velocity, and granular temperature) is addressed, for varying mass ratio and inelasticity parameter. Closure is achieved by approximating the distribution function in the appropriate weak forms of the kinetic equation by two suitable expansions around the equilibrium of the dominant operator, one of Grad's type, the other of local Maxwellian type. In the hydrodynamic limit when the mean free path tends to zero, the same drift-diffusion equation at the Navier-Stokes level is recovered in the two cases for the only hydrodynamic variable of the physical problem.
Meta-Modelling, Visual Languages, Graph Transformation, Operational Semantics.
Authors: Sajid Sadi, Pattie Maes
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

In this paper we present the linguistic design aspects subTextile, a hardware platform and visual programming language created with the goal of distilling the domain of programming to a set of primitives that would allow novice users to create dynamic and interesting behaviors for interactive art, architecture, and industrial design artifacts. Design exists in every aspect of human society, but the knowledge structure we have moved towards makes it difficult to acquire expertise in a wide set of skills. This discrepancy suggests the need for tools which encapsulate expert knowledge while allowing endusers to design using these "packaged skills," and this is what the subTextile language attempts to explore. We show an approach for distilling out a minimal set of linguistic primitives that can succinctly encapsulate the full expressive capability of a lower-level language by focusing not on the end effects, but the activity we expect the user to perform with the tool.
The University of Bristol grid, a production campus grid
Authors: D. Wallom, I. Stewart, J. Wakelin
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

With the increasing cost of providing computing and storage facilities for research capability, it has become important that universities make increasingly efficient use of their existing resources. The strategy developed at the University of Bristol has involved the design and construction of a campus grid. This has enabled better utilization of spare capacity on available systems connected to the grid and also the separation, for the first time, of those applications that require parallel compute resources (i.e. closely coupled systems) and those that require serial resources. The overall implementation of this strategy was driven by two prime considerations. Firstly, the contributing cluster systems are, in the main, very heavily used and connecting them onto the grid must be done in a non-invasive way to ensure currently executing applications don't have to be interrupted or any other cluster operations compromised. Secondly, the grid has been considered by many scientific users to be over hyped. This implied that we needed to get a system up and running quickly however 'simple' it was to prove the concept was viable. It was hoped that involving real users at an early stage of the grid's construction would lead to them evangelising about the system and thus, encourage more users to use the system.
Motivating developer performance to improve project outcomes in a high maturity organization
Authors: Tracy Hall, Dorota Jagielska, Nathan Baddoo
Venue: Software Quality Control (2007)

In this paper we discuss the impact software developer performance has on project outcomes. Project performance remains unreliable in the software industry with many compromised software systems reported in the press. We investigate the impact that developer performance has on aspects of project success and explore how developer performance is motivated. We present interview, focus group and questionnaire data collected from a team of developers working in a software organization that has been assessed at CMM level 5. Our main findings are that developers value technical skills in their colleagues, but appreciate these especially when supplemented with good human skills. Software developers with a proactive, flexible, adaptable approach who are prepared to share knowledge and follow good practice are said to be the best developers. Motivators for these developers are pay and benefits, recognition and opportunities for achievement in their work. Overall, we found that technical competence, interpersonal skills and adherence to good practices are thought to have the biggest impact on software project success.
Minimizing latency in wireless sensor networks: a survey
Authors: S. Srivathsan, S. S. Iyengar
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Energy conservation in wireless sensor networks has been a primary design objective. However, this constraint has not overshadowed other key objectives like scalability, architecture, latency, routing etc. Several applications of wireless sensor networks are envisioned to handle critical scenarios where data retrieval time is crucial. There are some hard-real-time applications where there is little tolerance for delayed data. We present a survey of some key mechanisms to minimize latency in single-hop and multi-hop wireless sensor networks. This includes sampling time, processing time, propagation time, scheduling, MAC protocols, use of directional antennas, predictions, sleep/wakeup cycles, use of dual-frequency radios and more.
Learning by Reading by Learning to Read
Authors: Sergei Nirenburg, Tim Oates, Jesse English
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Knowledge-based natural language processing systems learn by reading, i.e., they process texts to extract knowledge. The performance of these systems crucially depends on knowledge about the domain of language itself, such as lexicons and ontologies to ground the semantics of the texts. In this paper we describe the architecture of the GIBRALTAR system, which is based on the OntoSem semantic analyzer, which learns by reading by learning to read. That is, while processing texts GIBRALTAR extracts both knowledge about the topics of the texts and knowledge about language (e.g., new ontological concepts and semantic mappings from previously unknown words to ontological concepts) that enables improved text processing. We present the results of initial experiments with GIBRALTAR and directions for future research.
Proof for Multi-agent Communication of Semantic Web Information
Authors: Vuong Xuan Tran, Hidekazu Tsuji
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In Semantic Web, an application should not just giving a correct answer but also providing a proof or some kinds of explanations for that answer. A proof contains information related to the process that creates an answer like knowledge sources, reasoning systems, etc. Provided a proof or explanations, a user can trust and use a result with confidence. Such a means of answer provenance is even more important for distributed systems where an answer may be derived from many knowledge sources and by several systems. In this paper, basing on our existing logical framework for multi-agent communication of Semantic Web information, we extend the framework so that the agents are capable of tracing and providing proofs of their answers. A proof contains information about sources of knowledge, agents participated in the reasoning process as well as facts, rules, and axioms that are employed for inferring an answer. Such proofs are essential for various tasks like checking and validating answers, computing trust information, or generating explanations of answers.
Numerical methods for shape-from-shading: A new survey with benchmarks
Authors: Jean-Denis Durou, Maurizio Falcone, Manuela Sagona
Venue: Computer Vision and Image Understanding (2008)

Many algorithms have been suggested for the shape-from-shading problem, and some years have passed since the publication of the survey paper by Zhang et al. [R. Zhang, P.-S. Tsai, J.E. Cryer, M. Shah, Shape from shading: a survey, IEEE Transactions on Pattern Analysis and Machine Intelligence 21 (8) (1999) 690-706]. In this new survey paper, we try to update their presentation including some recent methods which seem to be particularly representative of three classes of methods: methods based on partial differential equations, methods using optimization and methods approximating the image irradiance equation. One of the goals of this paper is to set the comparison of these methods on a firm basis. To this end, we provide a brief description of each method, highlighting its basic assumptions and mathematical properties. Moreover, we propose some numerical benchmarks in order to compare the methods in terms of their efficiency and accuracy in the reconstruction of surfaces corresponding to synthetic, as well as to real images.
Can you infect me now?: malware propagation in mobile phone networks
Authors: Chris Fleizach, Michael Liljenstam, Per Johansson, Geoffrey M. Voelker, Andras Mehes
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

In this paper we evaluate the effects of malware propagating usingcommunication services in mobile phone networks. Although self-propagating malware is well understood in the Internet, mobile phone networks have very different characteristics in terms of topologies, services, provisioning and capacity, devices, and communication patterns. To investigate malware in this new environment, we have developed an event-driver simulator that captures the characteristics and constraints of mobile phone networks. In particular, the simulator models realistic topologies and provisioned capacities of the network infrastructure, as well as the contactgraphs determined by cell phone address books. We evaluate the speedand severity of random contact worms in mobile phone networks, characterize the denial-of-service effects such worms could have on the network, investigate approaches to accelerate malware propagation, and discuss the implications of defending networks against such attacks.
Memory-limited execution of windowed stream joins
Authors: Utkarsh Srivastava, Jennifer Widom
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. We show formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency-based model of stream arrival. We address the sampling problem for this model. More importantly, we point out a broad class of applications for which an age-based model of stream arrival is more appropriate, and we address both approximation scenarios under this new model. Finally, for the case of multiple joins being executed with an overall memory constraint, we provide an algorithm for memory allocation across the joins that optimizes a combined measure of approximation in all scenarios considered. All of our algorithms are implemented and experimental results demonstrate their effectiveness.