ppxscal/embedding_network huggingface dataset:
Characterizing DSS Workloads from the Processor Perspective
Authors: Dawei Liu, Shan Wang, Biao Qin, Weiwei Gong
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

In this paper, we characterized the TPC-H benchmark on an Itanium II processor. Our experiment results clearly demonstrate: (1) On Itanium II processor, the memory stall time is dominanted by first level (L1) instruction cache and third level (L3) data cache misses; (2) Index can reduces L3 data cache misses dramatically but increases a slightly more Condition Branch Instruction misprediction (BMP) rate. These revealed characteristics are expected to benefit database performance optimizations and database architecture design on next-generation processors.
Predictive Coding in Cortical Microcircuits
Authors: Andreea Lazar, Gordon Pipa, Jochen Triesch
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

We investigate the influence of spike timing dependent plasticity (STDP) on the prediction properties of recurrent microcircuits. We use sparsely connected networks in which the synaptic modifications introduced by STDP are complemented by two homeostatic plasticity mechanisms: synaptic normalization and intrinsic plasticity. In the presence of structured external input, STDP changes the connectivity matrix of the network such that the recurrent connections capture the particularities of the input stimuli, allowing the network to anticipate future inputs. Network activation patterns reflect different input expectations and can be separated by an unsupervised clustering technique.
Probabilistic Relation between In-Degree and PageRank
Authors: Nelly Litvak, Werner R. Scheinhardt, Yana Volkovich
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

This paper presents a novel stochastic model that explains the relation between power laws of In-Degree and PageRank. PageRank is a popularity measure designed by Google to rank Web pages. We model the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the original definition of PageRank. Using the theory of regular variation and Tauberian theorems, we prove that the tail distributions of PageRank and In-Degree differ only by a multiplicative constant, for which we derive a closed-form expression. Our analytical results are in good agreement with Web data.Categories and Subject DescriptorsH.3.3:[Information Storage and Retrieval]: Information Search and Retrieval--- Retrieval models; G.3:[Mathematics of Computing]: Probability and statistics --- Stochastic processes, Distribution functions
A New Method for Iris Recognition Systems Based on Fast Pupil Localization
Authors: Samira Kooshkestani, Mohammad Pooyan, Hamed Sadjedi
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

In recent years there has been a rapid increase in the need for accurate and reliable personal identification so biometrics has received more and more attention. Iris recognition as a biometrics has a satisfying performance due to its high reliability and non-invasion. The iris recognition system consists of four processes: image acquisition, preprocessing, feature extraction and matching. In an iris recognition system, preprocessing, especially iris localization plays a very important role. The speed and performance of an iris recognition system is crucial and it is limited by the results of iris localization to a great extent. In this paper, we propose new pupil localization for finding the iris inner boundary based on wavelet transform and analytic geometry relations. Extensive experimental results show that the proposed algorithm in addition to higher speed and lower calculation cost and simplicity, has got an acceptable accuracy for internal boundary localization.
Navigation and Discovery in 3D CAD Repositories
Authors: Jiantao Pu, Yagnanarayanan Kalyanaraman, Subramaniam Jayanti, Karthik Ramani, Zygmunt Pizlo
Venue: IEEE Computer Graphics and Applications (2007)

While traditional text-based searches are impractical for users seeking 3D content in large repositories, existing 3D search systems present search results in a 1D list, which is hard to search. A new interaction paradigm lets users navigate results in 2D and 3D spaces and easily find 3D models that are similar overall or in a single orientation.
Delphi programming of normality tests
Authors: Senay Asma
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

In this study, the source codes for the formulations of various normality tests are established on Delphi programming language. The main advantage of the programs given on this paper is that one can easily perform the statistical test of normality without using any statistical software. Besides, the programming language has an important role while the considered normality test doesn't exist on the software at a hand.
Self-Organised Criticality as a Function of Connections' Number in the Model of the Rat Somatosensory Cortex
Authors: Grzegorz M. Wojcik, Wieslaw A. Kaminski
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The model of the part of the rat somatosensory cortex was examined. Large network of Hodgkin-Huxley neurons was simulated and the modular architecture of this structure divided into layers and sub-regions was implemented. High degree of complexity required effective parallelisation of the simulation. In this article the results of the parallel neural computations are presented. An occurrence of the self-organised criticality was observed and its characteristics as a function of the connections number was investigated. It was proved that frequency of the so-called spike potential avalanches depends on the density of inter-neuron connections. In addition some benchmarking runs were conducted and parallelisation effectiveness is presented to some extent.
Thermal Diffusion-Based Access Load Balancing for P2P File Sharing Networks
Authors: Masanori Takaoka, Kei Ohnishi, Masato Uchida, Yuji Oie
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

In the present paper, we propose a file replication method to dynamically balance loads of peers in unstructured peer-to-peer (P2P) file-sharing networks. Load balancing is considered to require uniform storage access by file replication. We then define the load index as the storage access ratio. In the proposed method, each peer autonomously regulates the file replication probability to uniform storage accesses as thermal diffusion phenomena. Simulation results reveal that the proposed method can control the file sharing network to balance loads while dynamically adapting to change of storage accesses that is caused by change of popularity trends, and therefore keep load balancing performance stable. In addition, the proposed method achieves greater adaptability to sudden changes in storage accesses than our previous method.
A Grid-Based Bioinformatics Wrapper for Biological Databases
Authors: Maria Mirto, Sandro Fiore, Massimo Cafaro, Marco Passante, Giovanni Aloisio
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

With a growing trend towards grid-based data repositories and data analysis services, scientific data analysis often involves accessing multiple datasources, and analyzing the data using a variety of analysis programs. A strictly related critical challenge is the fact that data sources often hold the same type of data in a number of different formats; moreover, the formats expected and generated by various data analysis services are often distinct. In Bioinformatics the data are often stored in flat files, therefore accessing them to retrieve a subset of records determined by constraints, is slower with respect to other approaches such as relational DBMS. We have developed a data Grid system, built on top of specific biological data sources in flat file format, which carries out the ingestion into a relational DBMS for data integration reducing the data redundancy present in the biological flat files. In this work, we describe the prototype for the ingestion in a relational DBMS of the Swiss-2D PAGE flat file.
Pseudo 1-homogeneous distance-regular graphs
Authors: Aleksandar Jurišić, Paul Terwilliger
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

Let Γ be a distance-regular graph of diameter d¿2 and a 1¿0. Let ¿ be a real number. A pseudo cosine sequence for ¿ is a sequence of real numbers ¿ 0,¿,¿ d such that ¿ 0=1 and c i ¿ i¿1+a i ¿ i +b i ¿ i+1=¿ ¿ i for all i¿{0,¿,d¿1}. Furthermore, a pseudo primitive idempotent for ¿ is E ¿ =s¿¿ i=0 d ¿ i A i , where s is any nonzero scalar. Let $\hat{v}$ be the characteristic vector of a vertex v¿VΓ. For an edge xy of Γ and the characteristic vector w of the set of common neighbours of x and y, we say that the edge xy is tight with respect to ¿ whenever ¿¿k and a nontrivial linear combination of vectors $E\hat{x}$ , $E\hat{y}$ and Ew is contained in $\mathrm{Span}\{\hat{z}\mid z\in V{\Gamma},\ \partial(z,x)=d=\partial(z,y)\}$ . When an edge of Γ is tight with respect to two distinct real numbers, a parameterization with d+1 parameters of the members of the intersection array of Γ is given (using the pseudo cosines ¿ 1,¿,¿ d , and an auxiliary parameter ¿). Let S be the set of all the vertices of Γ that are not at distance d from both vertices x and y that are adjacent. The graph Γ is pseudo 1-homogeneous with respect to xy whenever the distance partition of S corresponding to the distances from x and y is equitable in the subgraph induced on S. We show Γ is pseudo 1-homogeneous with respect to the edge xy if and only if the edge xy is tight with respect to two distinct real numbers. Finally, let us fix a vertex x of Γ. Then the graph Γ is pseudo 1-homogeneous with respect to any edge xy, and the local graph of x is connected if and only if there is the above parameterization with d+1 parameters ¿ 1,¿,¿ d ,¿ and the local graph of x is strongly regular with nontrivial eigenvalues a 1 ¿/(1+¿) and (¿ 2¿1)/(¿¿¿ 2).
The Module of Morphological and Syntactic Analysis SMART
Authors: Anastasia Leontyeva, Ildar Kagirov
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The present paper presents the program of morphological and syntactic analyses of the Russian language. The principles of morphological analysis are based on some ideas by A.A. Zaliznyak. The entire glossary is to be kept as sets of lexical stems and grammatical markers, such as flexions and suffixes. A great deal of stems is represented by a few variants, owing to in-stem phonological alternations. Such approach helps to reduce the glossary and retrench the time of searching a particular word-form. Syntactic analysis is based on the rules of Russian. During the processing of some texts, base syntactic groups were singled out. The module could be used as a morphology analyzer or as a syntactic analyzer. This module provides information about the initial wordform, its paradigm, its transcription and compose a vocabulary for Russian continuous speech recognizer. The module is also used for syntactic analysis of Russian sentence.
Designing a Taxonomy of Web Attacks
Authors: Jung-Ying Lai, Jain-Shing Wu, Shih-Jen Chen, Chia-Huan Wu, Chung-Huang Yang
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

It has been discovered in recent years that the Internet attacks started by improper authorization on Web servers and Web applications. The top 10 Web vulnerabilities issued by OWASP and the top 20 security risks issued by SANS demonstrated that Web attacks is one of the most important network security problems. Therefore, with the help from Web attack taxonomy, we can classify the attack type with vulnerability characteristic and efficiently response with actions and find the characteristic. The new taxonomy proposed by this research is based on the HTTP methond that include dangerous methond such as PUT, DELETE, TRACE, and CONNECT. When threat events occur in network systems, we could more effectively categorize the possible malicious attacks with the proposed taxonomy.
Normalization enables robust validation of disparity estimates from neural populations
Authors: Eric K. C. Tsang, Bertram E. Shi
Venue: Neural Computation (2008)

Binocular fusion takes place over a limited region smaller than one degree of visual angle (Panum's fusional area), which is on the order of the range of preferred disparities measured in populations of disparity-tuned neurons in the visual cortex. However, the actual range of binocular disparities encountered in natural scenes extends over tens of degrees. This discrepancy suggests that there must be a mechanism for detecting whether the stimulus disparity is inside or outside the range of the preferred disparities in the population. Here, we compare the efficacy of several features derived from the population responses of phase-tuned disparity energy neurons in differentiating between in-range and out-of-range disparities. Interestingly, some features that might be appealing at first glance, such as the average activation across the population and the difference between the peak and average responses, actually perform poorly. On the other hand, normalizing the difference between the peak and average responses results in a reliable indicator. Using a probabilistic model of the population responses, we improve classification accuracy by combining multiple features. A decision rule that combines the normalized peak to average difference and the peak location significantly improves performance over decision rules based on either measure in isolation. In addition, classifiers using normalized difference are also robust to mismatch between the image statistics assumed by the model and the actual image statistics.
Interactions between Spike-Timing-Dependent Plasticity and Phase Response Curve Lead to Wireless Clustering
Authors: Hideyuki Câteau, Katsunori Kitano, Tomoki Fukai
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

A phase response curve characterizes the signal transduction between neurons in a minimal manner,whereas spike-timing-dependent plasiticity (STDP) characterizes the way to rewire networks in an activity-dependent manner. The present paper demonstrates that these two key properties both related to spikes work synergetically to carve functionally useful circuits in the brain. STDP working on a population of neurons that prefer asynchrony turns out to convert the initial asynchronous firing to clustered firing with synchrony within a cluster. They get synchronized within a cluster despite their preference to asynchrony because STDP selectively disrupts intra-cluster connections, which we call wireless eclustering.
Refactoring in Multi Agent System Development
Authors: Ali Murat Tiryaki, Erdem Eser Ekinci, Oguz Dikenelli
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

The need for XP-like agile approaches that provide evolutionary development in a flexible way has been widely acknowledged in the AOSE area. Such approaches improve acceptability of agent-technology by industry. Evolutionary development of multi agent systems-MASs can only be applied successfully, if designs of the MASs being developed are improved throughout the development process. In this paper, we introduce a refactoring approach that can be used during evolutionary MAS development. The proposed refactoring approach makes it possible to develop MASs in an evolutionary way by managing the changes between the iterations of the evolutionary development process. Also, a case study that shows application of a refactoring technique during the evolutionary MAS development is introduced in the fifth section.
EcoRare: An Economic Incentive Scheme for Efficient Rare Data Accessibility in Mobile-P2P Networks
Authors: Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

We propose EcoRare, a novel economic incentive scheme for improving the availability of rare data in Mobile-P2P networks. EcoRare combats free-riding and effectively involves free-riders to improve the availability (and lifetimes) of rare data. EcoRare also facilitates the creation of multiple copies of rare items in the network since its novel selling mechanism allows a given data to have multiple owners. Our performance study demonstrates that EcoRare indeed improves query response times and availability of rare data items in Mobile-P2P networks.
The Game of Synchronized Domineering
Authors: Alessandro Cincotti, Hiroyuki Iida
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

In synchronized games players make their moves simultaneously rather than alternately. Synchronized Domineering is the synchronized version of Domineering, a classic two-player combinatorial game. We present the solutions for all the m ×n boards with m ≤ 6 and n ≤ 6. Also, we give results for the n ×3 boards, n ×5 boards, and some partial results for the n ×2 boards. Future research is indicated.
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems
Authors: Dietmar Schreiner, Karl M. Göschka
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The increasing complexity of today's embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to software engineers. These requirements are well met by the component based software engineering paradigm: complex software is decomposed into coherent, interacting units of execution, the so called components. Connectors are a commonly used abstraction to model the interaction between them. We consequently contribute with the application of explicit connectors for distributed embedded systems software. Explicit connectors encapsulate the logic of distributed interaction, hence they provide well defined contracts regarding properties of inter-component communication. Our approach allows model level validation of component composition and interaction incorporating communication related constraints beyond simple interface matching. In addition, by using explicit connectors, the complexity of application components is reduced without the need for any heavy weight middleware. In fact, the set of all deployed explicit connectors forms the smallest possible, custom tailored middleware.
Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling
Authors: Neil F. Stewart, Malika Zidani
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

An overall approach to the problem of error analysis in the context of solid modelling, analogous to the standard forward/backward error analysis of Numerical Analysis, was described in a recent paper by Hoffmann and Stewart. An important subproblem within this overall approach is the well-definition of the sets specified by inconsistent data. These inconsistencies may come from the use of finite-precision real-number arithmetic, from the use of low-degree curves to approximate boundaries, or from terminating an infinite convergent (subdivision) process after only a finite number of steps.An earlier paper, by Andersson and the present authors, showed how to resolve this problem of well-definition, in the context of standard trimmed-NURBS representations, by using the Whitney Extension Theorem. In this paper we will show how an analogous approach can be used in the context of trimmed surfaces based on combined-subdivision representations, such as those proposed by Litke, Levin and Schröder.A further component of the problem of well-definition is ensuring that adjacent patches in a representation do not have extraneous intersections. (Here, `extraneous intersections' refers to intersections, between two patches forming part of the boundary, other than prescribed intersections along a common edge or at a common vertex.) The paper also describes the derivation of a bound for normal vectors that can be used for this purpose. This bound is relevant both in the case of trimmed-NURBS representations, and in the case of combined subdivision with trimming.
A Declarative Approach for QoS-Aware Web Service Compositions
Authors: Fabien Baligand, Nicolas Rivierre, Thomas Ledoux
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

While BPEL language has emerged to allow the specification of Web Service compositions from a functional point of view, it is still left to the architects to find proper means to handle the Quality of Service (QoS) concerns of their compositions. Typically, they use ad-hoc technical solutions, at the message level, that significantly reduce flexibility and require costly developments. In this paper, we propose a policy-based language aiming to provide expressivity for QoS behavioural logic specification in Web Service orchestrations, as well as a non-intrusive platform in charge of its execution both at pre-deployment time and at runtime.
Generalized Thrackles and Geometric Graphs in $${\mathbb{R}}^3$$with No Pair of Strongly Avoiding Edges
Authors: Amitai Perlstein, Rom Pinchasi
Venue: Graphs and Combinatorics (2008)

We define the notion of a geometric graph in $${\mathbb{R}}^3$$. This is a graph drawn in $${\mathbb{R}}^3$$with its vertices drawn as points and its edges as straight line segments connecting corresponding points. We call two disjoint edges of G strongly avoiding if there exists an orthogonal projection of $$\mathbb{R}^3$$to a two dimensional plane H such that the projections of the two edges on H are contained in two different rays, respectively, with a common apex that create a non-acute angle. We show that a geometric graph on n vertices in $$\mathbb{R}^3$$with no pair of strongly avoiding edges has at most 2n&#x00a0;&#x2212;&#x00a0;2 edges. As a consequence we get a new proof to V&#x00e1;zsonyi&#x2019;s conjecture about the maximum number of diameters in a set of n points in $${\mathbb{R}}^3$$.
English Querying over Ontologies: E-QuOnto
Authors: Raffaella Bernardi, Francesca Bonin, Diego Calvanese, Domenico Carbotta, Camilo Thorne
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the DB must be know, and such a structure might be far from the conceptualization of a human being of the stored information. Ontologies help to bridge this gap, by providing a high level conceptual view of the information stored in a DB in a cognitively more natural way. Even in this setting, casual end users might not be familiar with the formal languages required to query ontologies. In this paper we address this issue and study the problem of ontology-based data access by means of natural language questions instead of queries expressed in some formal language. Specifically, we analyze how complex real life questions are and how far from the query languages accepted by ontology-based data access systems, how we can obtain the formal query representing a given natural language question, and how can we handle those questions which are too complex wrt the accepted query language.