ppxscal/embedding_network huggingface dataset:
DIAO: A Scheme of Cooperative Data Distribution for Grid-Enabled Data Analysis Applications
Authors: Tongcheng Guo, Stephen A. Jarvis
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

A three-tier data distribution framework is proposed for grid-enabled data analysis applications. This framework is based on existing resource reservation services: the analytical tasks which this framework serves, and their input data, are assigned by an existing performance-aware scheduling system to computational hosts termed 'calculators'. A so-called 'guider' organizes the data delivery from the source server to the 'coordinators', and every coordinator schedules the data propagation from itself to all its calculators. This scheme, which we call DIAO, is peer-to-peer (P2P), in that after downloading a data item, a host may behave as its server. Theoretical modeling reveals that the duration of data distribution depends on the effective utilization of the bottleneck resource in the overlay, and we develop three heuristics to minimize this duration, subject to the available resources. The ability of DIAO to exploit limited resources is demonstrated through simulation.
Some properties referring to the weight selection in the LQ optimal problem
Authors: Corneliu Botan, Florin Ostafi
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper establishes some properties referring the linear quadratic (LQ) optimal problem in continuous time-variant case. The established properties are useful especially for the weight selection in the adopted performance index. A connection between the problems with finite and infinite final time is indicated. Some illustrative examples are given.
Renewable Energy Sources: The Case of Wind Farms Analysis
Authors: Massimiliano Petri, Silvana Lombardo
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The state of art about the assessment of renewable energy sources productivity and sustainable use shows the lack of robust methods and techniques and the inadequacy of applied instruments. The present research implements a methodology that allows to evaluate both the opportunity to use wind energy and, in the affirmative, the producibility and location of a wind farm, introducing elements and quantitative techniques for a correct support decision aiding. An evaluation framework is developed, usable not only for wind but also for other renewable energy sources.
Defining Database Views as Data Abstractions
Authors: B. G. Claybrook
Venue: IEEE Transactions on Software Engineering (1985)

The concept of data abstraction is utilized in database systems to define user interfaces via database views in database application languages and to describe the architecture of database systems. Differences between the specification and use of database views and other data abstractions realized as abstract data types are discussed. Database views are formally specified using both the algebraic specification method and the abstract model specification method. The use of database views is demonstrated via the EXT_Pascal database application language.
Multiplicative Character Sums of Recurring Sequences with Rédei Functions
Authors: Domingo Gomez, Arne Winterhof
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

We prove a new bound for multiplicative character sums of nonlinear recurring sequences with Rédei functions over a finite field of prime order. This result is motivated by earlier results on nonlinear recurring sequences and their application to the distribution of powers and primitive elements. The new bound is much stronger than the bound known for general nonlinear recurring sequences.
A Hybrid Particle Swarm Algorithm for the Structure and Parameters Optimization of Feed-Forward Neural Network
Authors: Tang Xian-Lun, Li Yin-Guo, Zhuang Ling
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A novel and efficient method combining chaos particle swarm optimization (CPSO) and discrete particle swarm optimization (DPSO) is proposed to optimize the topology and connection weights of multilayer feed-forward artificial neural network (ANN) simultaneously. In the proposed algorithm, the topology of neural network is optimized by DPSO and connection weights are trained by CPSO to search the; global optimal ANN structure and connectivity. The proposed algorithm is successfully applied to fault diagnosis, able to eliminate some bad effects on the diagnosis capacity of network introduced by redundant structure of ANN. Compared with genetic algorithm (GA), the proposed method shows its superiority on convergence property and efficiency in training ANN. It is validated by the good diagnosis results of experiments.
Optimal prefix and suffix queries on texts
Authors: Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
Venue: Information Processing Letters (2008)

In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Makinen and Navarro [V. Makinen, G. Navarro, Position-restricted substring searching, in: J.R. Correa, A. Hevia, M.A. Kiwi (Eds.), LATIN, in: Lecture Notes in Computer Science, vol. 3887, Springer, 2006, pp. 703-714]. In the problem handled in this paper, we are interested in those occurrences of the pattern that lies in a suffix or in a prefix of the given text. We achieve optimal query time for our problem against a data structure which is an extension of the classic suffix tree data structure. The time and space complexity of the data structure is dominated by that of the suffix tree. Notably, the (best) algorithm by Makinen and Navarro, if applied to our problem, gives sub-optimal query time and the corresponding data structure also requires more time and space.
Revisiting Pairing Based Group Key Exchange
Authors: Yvo Desmedt, Tanja Lange
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Secure communication within a large group of users such as participants in a phone or video conference relies on the availability of secure data and efficient data transmission. Group key exchange protocols allow a (large) group of n users to establish a joint secret key which can be used in symmetric systems to efficiently en- and decrypt messages to and from the group. To deal with varying constellations of the groups and to ensure key freshness it is essential that the group key exchange protocol is efficient.Most protocols are generalizations of two-party protocols like Diffie-Hellman key exchange. The Burmester and Desmedt I protocol establishes a key in a constant number of rounds independent of the size of the group of users and in O(n) complexity of computation per user.After Joux's proposal to use pairings to enable a one-round tripartite key exchange (KE) several extensions of existing group KE and authenticated key exchange (AKE) protocols were published. However, quite a few turned out to be flawed and the complexity is often worse than for the original scheme. In this paper we propose a new constant round pairing based group AKE protocol which requires a lower computational complexity per user compared to previous proposals. Furthermore, the scheme is particularly interesting for groups in which some members enjoy more computational power than others. The protocol is most efficient if these members constitute roughly half of the group.We also provide a pairing-based version of the Burmester-Desmedt II group key exchange which runs in 3 rounds and requires only O(logn) computation and communication.Both protocols are faster than any published pairing-based key exchange protocols. If the parameters are chosen appropriately so that the pairing computations are fast the protocols can outperform the respective DL-based Burmester-Desmedt key exchange protocols.
A Fundamental Characteristic and Image Analysis of Liquid Flow in an AW Type EHD Pump
Authors: R. Ohyama, M. Kumeta, A. Ueda, A. Watson, J. S. Chang
Venue: Journal of Visualization (2005)

Non-intrusive two-phase fluid pumping based on an electrohydrodynamically (EHD) induced flow phenomenon with free liquid surface exposed to gas-phase corona discharges is experimentally investigated. Dielectric liquid flow generated near a corona discharge electrode progresses toward an inclined plate electrode, and then climbs up the surface against the gravitational force for an air-wave (AW) type EHD pump. The AW type EHD pump is operated on ionic wind field along the inclined plate electrode. The pumping performance of time-averaged liquid flow rate and the liquid-phase flow motion are characterized. The liquid flow characteristics related to a dimensionless parameter of corona discharge fields are presented.
Understanding consumer preferences for local service providers: a study of european brokers
Authors: Michael Ewald
Venue:  (2008)

As noted by Unsal and Movassaghi (2001), Europe has lagged behind the U.S. in internet trading since 1994, when the first internet brokers made their services available. According to Oetzel (2002), the leading U.S. internet brokers that offered direct market access (DMA), unlimited free real-time quotes and continual customer service every day of the year had the largest market share. With the leading U.S. internet brokers entering the European market, there was a natural expectation that the U.S. internet brokers with their increased internet trading experience, higher level of service and technological advantage would dominate the European internet brokerage market. European internet brokerage market data for the period 1999 to 2005 shows the market leader in each European country of this study was a local company and not a US-based broker. This raises the question as to whether there are other factors than those identified by Oetzel (2002) that affect an internet broker's ability to obtain consumer accounts in the European internet brokerage industry. This quantitative study employed a questionnaire survey to research a specific market, the European market for internet brokerage. It dealt with the following primary question: To what extent, if any, do consumer preferences for local service providers affect a company's performance, i.e. the number of accounts it can acquire? A methodology and associated metrics were developed to determine the key factors affecting company performance of the top European internet brokers in The UK, France, Sweden, Germany, Spain, and Italy. The questionnaire survey adopted the technology-organization-environment (TOE) framework developed by Tornatzky and Fleischer (1990). The survey results were applied to a structural equation model (SEM) of the TOE framework to further develop the methodology and associated metrics. The research study contributes to the internet brokerage industry by providing empirical evidence in understanding the importance, or lack of consumer preferences for local service providers and the impact of that preference on company performance, such as number of accounts.
Artificial Ontologies and Real Thoughts: Populating the Semantic Web?
Authors: Khurshid Ahmad
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Corpus linguistic methods are discussed in the context of the automatic extraction of a candidate terminology of a specialist domain of knowledge. Collocation analysis of the candidate terms leads to some insight into the ontological commitment of the domain community or collective. The candidate terminology and ontology can be easily verified and validated and subsequently may be used in the construction of information extraction systems and of knowledge-based systems. The use of the methods is illustrated by an investigation of the ontological commitment of four major collectives: nuclear physics, cell biology, linguistics and anthropology. An analysis of a diachronic corpus allows an insight into changes in basic concepts within a specialism; an analysis of a corpus comprising texts published during a short and fixed time period ---a synchronic corpus- shows how different sub-specialisms within a collective commit themselves to an ontology.
Brief paper: Consensus protocols for discrete-time multi-agent systems with time-varying delays
Authors: Feng Xiao, Long Wang
Venue: Automatica (Journal of IFAC) (2008)

This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.
Robust Stability Analysis for Delayed BAM Neural Networks
Authors: Yijing Wang, Zhiqiang Zuo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

The problem of robust stability for a class of uncertain bidirectional associative memory neural networks with time delays is investigated in this paper. A more general Lyapunov-Krasovskii functional is proposed to derive a less conservative robust stability condition within the framework of linear matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed method.
Auction Protocols for Resource Allocations in Ad-Hoc Grids
Authors: Behnaz Pourebrahimi, Koen Bertels
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Different auction-based approaches have been used to allocate resources in Grids, but none of them provide the design choice for a specific economic model while considering the interest of all participants in the market. In this paper, we implement an auction-based framework for producer and consumer matchmaking in an ad-hoc Grid. In ad-hoc Grids, where the availability of resources and tasks is highly dynamic, the producers and consumers have to compete for providing and employing the resources. The framework is used to assess the usefulness of a particular mechanism using a set of criteria in different network conditions. We present the performance analysis of different auction mechanisms namely First-Price, Vickrey and Double Auctions in a many-to-many manner. The evaluation is performed in terms of throughput, consumer and producer surplus, and uncertainty measure for obtaining required resources in different network conditions.
Membrane systems with proteins embedded in membranes
Authors: Robert Brijder, Matteo Cavaliere, Agustín Riscos-Núñez, Grzegorz Rozenberg, Drago Sburlan
Venue: Theoretical Computer Science (2008)

Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes can evolve depending on the attached molecules. The evolution of membranes is performed by using rules that are motivated by the operation of pinocytosis (the pino rule) and the operation of cellular dripping (the drip rule) that take place in living cells. We show that such membrane systems are computationally universal. We also show that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking (which contains non-semilinear sets of vectors). If, moreover, the use of pino/drip rules is non-cooperative (i.e., not dependent on the proteins attached to membranes), then one generates a family of sets of vectors that is strictly included in the family of semilinear sets of vectors. We also consider a number of decision problems concerning reachability of configurations and boundness.
Role of surface passivation and doping in silicon nanocrystals
Authors: R. Magri, E. Degoli, F. Iori, E. Luppi, O. Pulci, S. Ossicini, G. Cantele, F. Trani, D. Ninno
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The absorption and the emission spectra of undoped and doped silicon nanocrystals of different size and surface terminations have been calculated within a first-principles framework. The effects induced by the creation of an electron-hole pair on the atomic structure and on the optical spectra of hydrogenated silicon nanoclusters as a function of dimension are discussed showing the strong interplay between the structural and optical properties of the system. Starting from the hydrogenated clusters, (i) different Si/O bonding at the cluster surface and (ii) different doping configurations have been considered. We have found that the presence of a Si-O-Si bridge bond at the nanocrystal surface gives rise to significant excitonic luminescence features in the near-visible range that are in fair agreement with photoluminescence (PL) measurements on oxidized and SiO$_{2}$ embedded nanocrystals. The study of the structural, electronic and optical properties of simultaneously n- and p-type doped hydrogenated silicon nanocrystals with boron and phosphorous impurities have shown that B-P co-doping is energetically favorable with respect to single B- or P-doping and that the two impurities tend to occupy nearest neighbors sites. The co-doped nanocrystals present band edge states localized on the impurities that are responsible of a red-shifted absorption threshold with respect to that of pure un-doped nanocrystals in agreement with the experiment.
Toward Image-Based Localization for AIBO Using Wavelet Transform
Authors: Alberto Pretto, Emanuele Menegatti, Enrico Pagello, Yoshiaki Jitsukawa, Ryuichi Ueda, Tamio Arai
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

This paper describes a similarity measure for images to be used in image-based localization for autonomous robots with low computational resources. We propose a novel signature to be extracted from the image and to be stored in memory. The proposed signature allows, at the same time, memory saving and fast similarity calculation. The signature is based on the calculation of the 2D Haar Wavelet Transform of the gray-level image. We present experiments showing the effectiveness of the proposed image similarity measure. The used images were collected using the AIBOs ERS-7 of the RoboCup Team Araibo of the University of Tokyo on a RoboCup field, however, the proposed image similarity measure does not use any information on the structure of the environment and do not exploit the peculiar features of the RoboCup environment.
A note on cut-worthiness of recognizable tree series
Authors: Branimir Šešelja, Andreja Tepavčević, Heiko Vogler
Venue: Fuzzy Sets and Systems (2008)

The topic of this short note is tree series over semirings with partially ordered carrier set. Thus, tree series become poset-valued fuzzy sets. Starting with a collection of recognizable tree languages we construct a tree series recognizable over any semiring, such that the carrier set is a poset generated by the collection. In the framework of fuzzy structures, the starting collection becomes a subset of the collection of the corresponding cut sets. Under some stricter conditions, it is even equal to this collection. We also partially solve an open problem which was posed in Borchardt et al. [Cut sets as recognizable tree languages, Fuzzy Sets and Systems 157 (2006) 1560-1571]. Namely, we show that if @f is a given tree series over a partially ordered, locally finite semiring A, then @f is recognizable if and only if there are finitely many cut sets of @f and every cut set is a recognizable tree language.
Collusion-Free Protocols in the Mediated Model
Authors: Joël Alwen, Abhi Shelat, Ivan Visconti
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

Prior approaches [14, 15] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communication channel to construct protocols that achieve a stronger collusion-free property.We consider a communication channel which can filter and rerandomize message traffic. We then provide a new security definition that captures collusion-freeness in this new setting; our new setting even allows for the mediator to be corrupted in which case the security gracefully fails to providing standard privacy and correctness. This stronger notion makes the property useful in more settings.To illustrate feasibility, we construct a commitment scheme and a zero-knowledge proof of knowledge that meet our definition in its two variations.
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases
Authors: Colin Cooper, Michele Zito
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

We investigate the statistical properties of the databases generated by the IBM QUEST program. Motivated by the claim (also supported empirical evidence) that item occurrences in real life market basket databases follow a rather different pattern, we propose an alternative model for generating artificial data.
Reconfigurable MAC-Based Architecture for Parallel Hardware Implementation on FPGAs of Artificial Neural Networks
Authors: Nadia Nedjah, Rodrigo Martins Silva, Luiza Macedo Mourelle, Marcus Vinicius Silva
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Artificial Neural Networks (ANNs) is a well known bio- inspired model that simulates human brain capabilities such as learning and generalization. ANNs consist of a number of interconnected processing units, wherein each unit performs a weighted sum followed by the evaluation of a given activation function. The involved computation has a tremendous impact on the implementation efficiency. Existing hardware implementations of ANNs attempt to speed up the computational process. However these implementations require a huge silicon area that makes it almost impossible to fit within the resources available on a state-of-the-art FPGAs. In this paper, we devise a hardware architecture for ANNs that takes advantage of the dedicated adder blocks, commonly called MACs to compute both the weighted sum and the activation function. The proposed architecture requires a reduced silicon area considering the fact that the MACs come for free as these are FPGA's built-in cores. The hardware is as fast as existing ones as it is massively parallel. Besides, the proposed hardware can adjust itself on-the-fly to the user-defined topology of the neural network, with no extra configuration, which is a very nice characteristic in robot-like systems considering the possibility of the same hardware may be exploited in different tasks.
Guest Editors' Introduction: Advances in Multimedia Computing
Authors: Yong Rui, Ketan Mayer-Patel, Wolfgang Klas
Venue: IEEE MultiMedia (2007)

The guest editors discuss their selection of the best papers from the ACM Multimedia 2007 Conference.