ppxscal/embedding_network huggingface dataset:
A windows based web cache simulator tool
Authors: F. J. González-Cañete, E. Casilari, A. Triviño-Cabrera
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper, we describe a Windows based Web cache simulator tool. This tool is able to process the IRCache based traces files and reproduce the behavior of a Web Proxy Cache. It can be configured to simulate fifteen replacement policies and two admission control policies. The cache size, the percentage of warm-up and the cost function of some replacement policies can also be configured. The simulations can be performed in a batch process and the results are stored in text format files that can be automatically analyzed using other tools like Matlab to obtain performance graphs.
Case Study on the Recovery of a Virtual Large-Scale Disk
Authors: Erianto Chai, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

With the recent flood of data, one of the major issues is the storage thereof. Although commodity HDDs are now very cheap, appliance storage systems are still relatively expensive. As a result we developed the VLSD (Virtual Large-Scale Disk) toolkit in order to construct large-scale storage using only cheap commodity hardware and software. We also developed a prototype of the large-scale storage system by using the VLSD to collect free disk space on PCs. However, the reliability of this storage depends on the MTTR (Mean Time to Repair). In this paper, we evaluate the MTTR of our prototype and then discuss its efficiency.
Mobile Opportunities: Experiencing TV Outside Your Living Room
Authors: Tammi Titsworth
Venue: IEEE MultiMedia (2007)

Here we list some of the more interesting highlights and multimedia-related innovations of the National Association of Broadcasters (NAB) conference. The article focuses on mobile devices and novel listening and browsing experiences.
k-Petri Net Controlled Grammars
Authors: Jürgen Dassow, Sherzod Turaev
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.
The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications
Authors: Jasmine Foo, Xiaoliang Wan, George Em Karniadakis
Venue: Journal of Computational Physics (2008)

Stochastic spectral methods are numerical techniques for approximating solutions to partial differential equations with random parameters. In this work, we present and examine the multi-element probabilistic collocation method (ME-PCM), which is a generalized form of the probabilistic collocation method. In the ME-PCM, the parametric space is discretized and a collocation/cubature grid is prescribed on each element. Both full and sparse tensor product grids based on Gauss and Clenshaw-Curtis quadrature rules are considered. We prove analytically and observe in numerical tests that as the parameter space mesh is refined, the convergence rate of the solution depends on the quadrature rule of each element only through its degree of exactness. In addition, the L^2 error of the tensor product interpolant is examined and an adaptivity algorithm is provided. Numerical examples demonstrating adaptive ME-PCM are shown, including low-regularity problems and long-time integration. We test the ME-PCM on two-dimensional Navier-Stokes examples and a stochastic diffusion problem with various random input distributions and up to 50 dimensions. While the convergence rate of ME-PCM deteriorates in 50 dimensions, the error in the mean and variance is two orders of magnitude lower than the error obtained with the Monte Carlo method using only a small number of samples (e.g., 100). The computational cost of ME-PCM is found to be favorable when compared to the cost of other methods including stochastic Galerkin, Monte Carlo and quasi-random sequence methods.
Emulating Temporal Receptive Fields of Higher Level Auditory Neurons for ASR
Authors: Garimella S. Sivaram, Hynek Hermansky
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper proposes modifications to the Multi-resolution RASTA (MRASTA) feature extraction technique for the automatic speech recognition (ASR). By emulating asymmetries of the temporal receptive field (TRF) profiles of higher level auditory neurons, we obtain more than 11.4% relative improvement in word error rate on OGI-Digits database. Experiments on TIMIT database confirm that proposed modifications are indeed useful.
Fuzzy User Profiling in e-Learning Contexts
Authors: Corrado Mencar, Ciro Castiello, Anna Maria Fanelli
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The research activity described in this paper concerns the personalisation process in e-learning contexts. Particular emphasis is laid on the mechanisms of user profiling and association between user profiles and pedagogical resources. A particular profiling model is proposed where both the pedagogical resources and the user profiles are described in terms of a fuzzy valued metadata specification. The adoption of specific fuzzy operators enables the proposed model to perform associations with a high degree of flexibility, yielding a customised resource allocation for each user.
Type-Theoretical Bulgarian Grammar
Authors: Krasimir Angelov
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

We describe a type-theoretical resource grammar for Bulgarian in the Grammatical Framework (GF). The grammar allows parsing and generation of natural language text to and from abstract syntax representation. The representation is common for all languages in the resource library in GF which makes it possible to translate between any of the two supported languages and to have multilingual text authoring. We developed formalized grammar rules for Bulgarian and we show how the language specifics fit into this multilingual setting.
Using the analytic hierarchy process to rank foreign suppliers based on supply risks
Authors: Reuven R. Levary
Venue: Computers and Industrial Engineering (2008)

Essential characteristics of suppliers are identified that must be considered in the supplier selection process. Risk to the disruption of company operations as it relates to the reliability of suppliers is described as a reliability chain. The analytic hierarchy process (AHP) is shown to be the appropriate methodology for evaluating and ranking potential suppliers. A realistic case study is presented in which a manufacturer evaluates and ranks its current foreign supplier against two other potential foreign suppliers based on several criteria of supply reliability.
A cost-based join selection for XML twig content-based queries
Authors: Radim Bača, Michal Krátký
Venue: Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web (2008)

XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g., articles in a digital library, documents on the web, and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years. If we consider some classes of indexing methods, we distinguish two kinds of joins for processing twig queries. The first join merges two sets retrieved from an inverted list. The second join applies the first query result in building the second query. Although authors propose improvements of their joins, there has not yet been a discussion about the advantages of applying various join operations. In this article, we propose a join selection based on the cost of a join. By choosing a more appropriate join operation, twig query processing efficiency is significantly improved.
Oxygen chemiluminescence in He plasma as a method for plasma damage evaluation
Authors: A. M. Urbanowicz, D. Shamiryan, M. R. Baklanov, S. De Gendt
Venue: Microelectronic Engineering (2008)

We propose a method for evaluating the hydrophilisation degree of low-k films upon plasma damage. The evaluation is based on optical emission spectroscopy analysis of O^* emission during He plasma exposure of sample in question. The O^* is presumably desorbed from damaged low-k film by vacuum-ultraviolet radiation from He plasma. The new method correlates well with other methods for plasma damage characterization such as Fourier Transform Infrared Spectroscopy and Water-Vapor Ellipsometric Porosimetry. The presented method gives a unique opportunity to assess the degree of hydrophilisation of low-k films immediately after processing.
Internet traffic modeling by means of Hidden Markov Models
Authors: Alberto Dainotti, Antonio Pescapé, Pierluigi Salvo Rossi, Francesco Palmieri, Giorgio Ventre
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly analyzing Inter Packet Time and Packet Size. We give an analytical basis and the mathematical details regarding the model, and we test the flexibility of the proposed modeling approach with real traffic traces related to common Internet services with strong differences in terms of both applications/users and protocol behavior: SMTP, HTTP, a network game, and an instant messaging platform. The presented experimental analysis shows that, even maintaining a simple structure, the model is able to achieve good results in terms of estimation of statistical parameters and synthetic series generation, taking into account marginal distributions, mutual, and temporal dependencies. Moreover we show how, by exploiting such temporal dependencies, the model is able to perform short-term prediction by observing traffic from real sources.
Parallelization of Pricing Path-Dependent Financial Instruments on Bounded Trinomial Lattices
Authors: Hannes Schabauer, Ronald Hochreiter, Georg Ch. Pflug
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Complex financial instruments are a central concept for the survival of financial enterprises in liberalized markets. The need for fast pricing of more complex and exotic financial products led to the development of new algorithms, and to the parallelization of existing algorithms. In this paper, we present a parallelization scheme for pricing path-dependent interest rate products on bounded trinomial lattices. The basic building block presented in this paper can be used to build more complex pricing schemes. The paper is concluded by a set of numerical results concerning the speedup of the proposed parallelization scheme.
Completeness and Nondeterminism in Model Checking Transactional Memories
Authors: Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the first deterministic specification automata for strict serializability and opacity in STMs. Using an antichain-based tool, we show our deterministic specifications to be equivalent to more intuitive, nondeterministic specification automata (which are too large to be determinized automatically). Using deterministic specification automata, we obtain a complete verification tool for STMs. We also show how to model and verify contention management within STMs. We automatically check the opacity of popular STM algorithms, such as TL2 and DSTM, with a universal contention manager. The universal contention manager is nondeterministic and establishes correctness for all possible contention management schemes.
The operation and logic of the MARK III electronic calculator in view of operating experience
Authors: Glen E. Poorte
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

Mark III is a large scale electronic digital computer of the serial number storage type. It contains over 5,000 vacuum tubes and over 2,000 relays. All components are of the plug-in type and are plugged into removable chassis. Each chassis is plugged into the machine by movable connectors.
Off- Line Chinese Writer Identification Based on Character-Level Decision Combination
Authors: Wei Deng, Qinghu Chen, Yucheng Yan, Chunxiao Wan
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In this paper, a novel method to accelerate off-line Chinese writer identification by combining multi text-sensitive features and combining multi character level decisions is practiced. The used text-sensitive writer identification algorithm extracts Directional histogram feature, Moment feature and Wigner feature, reduces the dimensions using PCA and LDA, and adopts the simple Euclidean classifier. However the writer identification algorithms are text-sensitive, thus there are different mutual character combinations between writers. A method for retrieving in an amount of writers who has different handwriting script content is proposed in this paper, by combining and sorting the posterior probability measures of writing identification. An experiment, which is carried out in a handwriting script database, demonstrates the effectiveness of the proposed method.
Total Public Announcements
Authors: David Steiner, Thomas Studer
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We present a dynamic epistemic logic for knowledge change of rational agents. Existing approaches only deal with partial public announcements, that means an announcement may lead to an inconsistent state. We introduce an extension of the multi-modal logic S5 n featuring total public announcements where an update cannot result in an inconsistency. We also study total public announcements in the context of common knowledge and relativized common knowledge.
Optimizing bandwidth usage and supporting block level synchronization in MultiSync: a multiagent system for ubiquitous file synchronization
Authors: Umar Manzoor, Kiran Ijaz
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Agent technology offers a large number of unique features which makes it potential choice for implementing real world applications. MultiSync is an Multi-Agent application for File Synchronization across distributed network and it synchronizes user files seamlessly without the need of user intervention. This system uses MD5 hash for reliability, integrity checking, and content verification. The existing MultiSync inherits some problems like it sends entire file if MD5 differs and it does not support synchronization of audio / video as well images. In this paper, we have modified the architecture of Multisync to provide optimize bandwidth consumption using block level file synchronization and compression. Our Compression module has the intelligence to decide which type of compression technique is better in a specific situation, using this knowledge bandwidth and time can be saved. Our modified architecture also supports synchronization of multimedia and image files with less bandwidth usage.
Discovering Plausible Explanations of Carcinogenecity in Chemical Compounds
Authors: Eva Armengol
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

The goal of predictive toxicology is the automatic construction of carcinogenecity models. Most common artificial intelligence techniques used to construct these models are inductive learning methods. In a previous work we presented an approach that uses lazy learning methods for solving the problem of predicting carcinogenecity. Lazy learning methods solve new problems based on their similarity to already solved problems. Nevertheless, a weakness of these kind of methods is that sometimes the result is not completely understandable by the user. In this paper we propose an explanation scheme for a concrete lazy learning method. This scheme is particularly interesting to justify the predictions about the carcinogenesis of chemical compounds.
Person-following using fuzzy inference
Authors: Samir Shaker, Jean J. Saade, Daniel Asmar
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

For a service robot, being able to follow a person to do a required task is a must have skill. Such an ability, however simple in concept, has some requirements to be met which makes a simplistic direct implementation unsatisfactory. Most notably, the robot following the human has to keep at a certain safe distance from the person and at the same time move in a smooth manner which does not appear threatening to the person. Also, such a smooth movement would potentially prolong the lifetime of the robot's locomotive system. In this paper, we propose using fuzzy inference as the decision system achieving smoothness and person-following behavior while keeping a safe distance from that person. The system was tested using a laser range finder to detect a person's legs giving the inference system a distance and a direction to go to. The experimental results showed that even though the detection of legs was subject to noise and false negatives, the robot still achieved the goals of smoothness of motion, keeping of a safe distance, and of course, following its target.
Randomized Competitive Analysis for Two-Server Problems
Authors: Wolfgang Bein, Kazuo Iwama, Jun Kawahara
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).
Two Theorems on the Robust Designs for Pattern Matching CNNs
Authors: Bing Zhao, Weidong Li, Shu Jian, Lequan Min
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The cellular neural/nonlinear network (CNN) has become a useful tool for image and signal processing, robotic and biological visions, and higher brain functions. Based on our previous research, this paper set up two new theorems of robust designs for Pattern Matching CNN in processing binary images, which provide parameter inequalities to determine parameter intervals for implementing the prescribed image processing function. Three numerical simulation examples are given.
Combined speech enhancement and auditory modelling for robust distributed speech recognition
Authors: Ronan Flynn, Edward Jones
Venue: Speech Communication (2008)

The performance of automatic speech recognition (ASR) systems in the presence of noise is an area that has attracted a lot of research interest. Additive noise from interfering noise sources, and convolutional noise arising from transmission channel characteristics both contribute to a degradation of performance in ASR systems. This paper addresses the problem of robustness of speech recognition systems in the first of these conditions, namely additive noise. In particular, the paper examines the use of the auditory model of Li et al. [Li, Q., Soong, F.K., Siohan, O., 2000. A high-performance auditory feature for robust speech recognition. In: Proc. 6th Internat. Conf. on Spoken Language Processing (ICSLP), Vol. III. pp. 51-54] as a front-end for a HMM-based speech recognition system. The choice of this particular auditory model is motivated by the results of a previous study by Flynn and Jones [Flynn, R., Jones, E., 2006. A comparative study of auditory-based front-ends for robust speech recognition using the Aurora 2 database. In: Proc. IET Irish Signals and Systems Conf., Dublin, Ireland. pp. 111-116] in which this auditory model was found to exhibit superior performance for the task of robust speech recognition using the Aurora 2 database [Hirsch, H.G., Pearce, D., 2000. The Aurora experimental framework for the performance evaluation of speech recognition systems under noisy conditions. In: Proc. ISCA ITRW ASR2000, Paris, France. pp. 181-188]. In the speech recognition system described here, the input speech is pre-processed using an algorithm for speech enhancement. A number of different methods for the enhancement of speech, combined with the auditory front-end of Li et al., are evaluated for the purpose of robust connected digit recognition. The ETSI basic [ETSI ES 201 108 Ver. 1.1.3, 2003. Speech processing, transmission and quality aspects (STQ); distributed speech recognition; front-end feature extraction algorithm; compression algorithms] and advanced [ETSI ES 202 050 Ver. 1.1.5, 2007. Speech processing, transmission and quality aspects (STQ); distributed speech recognition; advanced front-end feature extraction algorithm; compression algorithms] front-ends proposed for DSR are used as a baseline for comparison. In addition to their effects on speech recognition performance, the speech enhancement algorithms are also assessed using perceptual speech quality tests, in order to examine if a correlation exists between perceived speech quality and recognition performance. Results indicate that the combination of speech enhancement pre-processing and the auditory model front-end provides an improvement in recognition performance in noisy conditions over the ETSI front-ends.
A solution method to the problem proposed by Wang in voting systems
Authors: NingShen Wang, RongHua Yi, Dian Liu
Venue: Journal of Computational and Applied Mathematics (2008)

This paper proposes a method to rank multiple efficient candidates, which often happens in DEA method, by comparing the least relative total scores for each efficient candidate with the best and the least relative total scores measured in the same range. By a numerical example, our model is used to identify efficient candidate and the model can get less efficient candidates too than that can be identified by the model given by Wang and Chin [Y.M. Wang, K.S. Chin, Discriminating DEA efficient candidates by considering their least relative total scores, J. Comput. Appl. Math. 206 (2007) 209-215]. This paper also points out that there is a drawback in the theorem about @e given by Wang and Chin [Y.M. Wang, K.S. Chin, Discriminating DEA efficient candidates by considering their least relative total scores, J. Comput. Appl. Math. 206 (2007) 209-215].
An impossibility about failure detectors in the iterated immediate snapshot model
Authors: Sergio Rajsbaum, Michel Raynal, Corentin Travers
Venue: Information Processing Letters (2008)

The Iterated Immediate Snapshot model (IIS) is an asynchronous computation model where processes communicate through a sequence of one-shot Immediate Snapshot (IS) objects. It is known that this model is equivalent to the usual asynchronous read/write shared memory model, for wait-free task solvability. Its interest lies in the fact that its runs are more structured and easier to analyze than the runs in the shared memory model. As the IIS model and the shared memory model are equivalent for wait-free task solvability, a natural question is the following: Are they still equivalent for wait-free task solvability, when they are enriched with the same failure detector? The paper shows that the answer to this question is ''no''.