ppxscal/embedding_network huggingface dataset:
Web Accessible A-Team Middleware
Authors: Dariusz Barbucha, Ireneusz Czarnowski, Piotr Jędrzejowicz, Ewa Ratajczak-Ropel, Izabela Wierzbowska
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The paper proposes a middleware called JABAT (Jade-based A-Team). JABAT allows to design and implement A-Team architectures for solving combinatorial optimization problem. JABAT is intended to become the first step towards next generation A-Teams which are fully Internet accessible, portable, scalable and in conformity with the FIPA standards.
Changes of Lactate Concentration in Ischemic Rat Brain after Sacrifice
Authors: Y. P. Zhang, H. Y. Wang, Y. Lin, M. X. Fan, Y. W. Chen, R. H. Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The purpose of this study was to explore the time course of cerebral lactate concentration in ischemic rat brain after sacrifice, in which area the morphology signal was still normal in the early phase. Ischemic rat model was used in this study. Eighty rats were fasted overnight before sacrifice and divided into 16 groups randomly. Lactate concentration was measured by using LD kit. Results showed that lactate reached the highest level rapidly during 20sec to 40 seconds and the mean peak value was 4.06 mmol/100g wet weight at the 20sec point. After 40 seconds, lactate declined gradually and then kept in high level after 3 minutes. The experiment indicated that lactate was observed as the main substrate and indicator of ischemia in early phase of the ischemic rat brain. Twenty-second may be the time threshold of the ischemia neurons to start using lactate as energy resource.
A Multi-objective Learning Algorithm for RBF Neural Network
Authors: Illya Kokshenev, Antonio Padua Braga
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

In this paper, the problem of multi-objective supervised learning is discussed within the non-evolutionary optimization framework. The proposed MOBJ learning algorithm performs the search of Pareto-optimal models determining weights,width, prototype vectors, and the quantity of basis functions of the RBF network. In combination with the Akaike information criterion, the algorithm provides high quality solutions.
Query Learning and Certificates in Lattices
Authors: M. Arias, J. L. Balcázar
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We provide an abstract version, in terms of lattices, of the Horn query learning algorithm of Angluin, Frazier, and Pitt. To validate it, we develop a proof that is independent of the propositional Horn logic structure. We also construct a certificate set for the class of lattices that generalizes and improves an earlier certificate construction and that relates very clearly with the new proof.
Report working conference on requirements engineering: foundation for software quality (REFSQ'08)
Authors: Barbara Paech, Patrick Heymans, Anne Persson
Venue: ACM SIGSOFT Software Engineering Notes (2008)

REFSQ'08 took place over the 16 th and 17 th June 2008 in the lively French city of Montpellier. 40 participants spent two days very intensively discussing the contributions of 17 papers, their implications and combinations. In these discussions some recurrent topics and new trends were emphasized: the importance of understanding the context and effectiveness of RE techniques, the multiplicity of requirements representations and their integration, the support for creativity, the necessity to make the body of knowledge better accessible e.g. through an open source RE tool community, and the challenges of RE for innovative or large-scale systems as well as of RE decision making in an uncertain environment.
Introductory steps for the design of an algorithm for finding the higher order fluctuation terms via symbolic simplifications
Authors: Coşar Gözükirmizi, Metin Demiralp
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

Fluctuation expansion is a method used for finding the matrix representation of functions. The approach is to truncate the infinite dimensional representation of a function at some dimension n, and then gradually add the contributions of the residual terms that are formed because of the truncation. The Fluctuationlessness Theorem states that the truncated matrix representation of a function may be approximated by the image of the matrix representation of the operator multiplying its operand with its independent variable, under the function. This approximation may be improved by adding residual terms. The residual terms are operator-argumented contour integrals and are also called fluctuation terms. The simplification of the terms rely heavily on operator algebra. The geometric series expansions of the inverse of the operators and factorization schemes enable us to perform the contour integral and acquire simpler formulae. These symbolic simplifications motivate us to create a new algebra for the simplifications and design an algorithm to find the compact form of the residual terms via symbolic programming.
Neural Network Modeling for Retrieval of Water Quality of Lake Taihu from Field Spectral Measurement
Authors: Qian Shen, Bing Zhang, Junsheng Li, Hao Zhang, Mo Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

How to effectively monitor water quality of Coastal and inland waters by optical remote sensing has always been a difficulty. This study develops a neural network model to improve the accuracy in monitoring water quality of Lake Taihu, China, a large shallow subtropical lake. A three-layer back-propagation neural network is built up to estimate concentrations of chlorophyll-a, total suspended matter and dissolved organic carbon at the same time from in-situ measured water surface spectra. The neural network is trained by the simultaneously in-situ measured water surface spectra and water quality parameters (including concentrations of chlorophyll-a, total suspended matter and dissolved organic carbon) in 39 sampling stations of Lake Taihu in the campaign in winter of 2007. Then, the neural network model is tested by the data measured in both the left 9 sampling stations in the campaign in winter of 2007 and the 9 sampling stations in the campaign in winter of 2006. The estimated errors of the three kinds of water quality parameters are less than 30% in both campaigns in winters of 2006 and 2007. The results show that this neural network model has high seasonal applicability, and is very useful in monitoring of water quality of Lake Taihu from water surface spectra measured in future winters.
Dominant Points Detection Using Phase Congruence
Authors: Francisco José Madrid-Cuevas, Rafel Medina-Carnicer, Ángel Carmona-Poyato, Nicolás Luis Fernández-García
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper proposes a new method for simplifying a 2d shape boundary based on its phase congruence and the optimisation of a function criterion. The phase congruence is a dimensionless feature that stands out boundary salient structures over different scales allowing a hierarchical fast optimisation process over the detected structures. The proposed method has been compared with other two well-known methods using an objective measure of the quality of the generated approximation. The experimental results have shown that the the proposed method is superior in performance to those reviewed in our study.
What Hides in Dimension X? A Quest for Visualizing Particle Swarms
Authors: Namrata Khemka, Christian Jacob
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

The way we perform evolutionary experiments is all influenced by visualizing multi-dimensional solutions, analyzing the extent to which the search space is explored, displaying the gross population statistics, determining clustering and building blocks, and finding successful combinations of parameter values. Through visualization we can gain valuable insights to enhance our knowledge about particle swarm optimizers, in particular, and the search space that is being explored. In this paper, we focus on different visualization techniques for particle swarm systems. We investigate the advantages of a range of graphical data representation methods by example of the two- and four-dimensional sphere function, the two-dimensional simplified foxholes function, and a 56-dimensional real-world example in the context of muscle stimulus patterns.
Anomaly and Specification Based Cognitive Approach for Mission-Level Detection and Response
Authors: Paul Rubel, Partha Pal, Michael Atighetchi, D. Paul Benjamin, Franklin Webber
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

In 2005 a survivable system we built was subjected to red-team evaluation. Analyzing, interpreting, and responding to the defense mechanism reports took a room of developers. In May 2008 we took part in another red-team exercise. During this exercise an autonomous reasoning engine took the place of the room of developers. Our reasoning engine uses anomaly and specification-based approaches to autonomously decide if system and mission availability is in jeopardy, and take necessary corrective actions. This extended abstract presents a brief summary of the reasoning capability we developed: how it categorizes the data into an internal representation and how it uses deductive and coherence based reasoning to decide whether a response is warranted.
"Hey World, Take a Look at Me!": Appreciating the Human Body on Social Network Sites
Authors: Bernd Ploderer, Steve Howard, Peter Thomas, Wolfgang Reitberger
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

Social network sites (SNSs) such as Facebook have the potential to persuade people to adopt a lifestyle based on exercise and healthy nutrition. We report the findings of a qualitative study of an SNS for bodybuilders, looking at how bodybuilders present themselves online and how they orchestrate the SNS with their offline activities. Discussing the persuasive element of appreciation, we aim to extend previous work on persuasion in web 2.0 technologies.
A New Multi-level Algorithm Based on Particle Swarm Optimization for Bisecting Graph
Authors: Lingyu Sun, Ming Leng, Songnian Yu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

An important application of graph partitioning is data clustering using a graph model -- the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. The min-cut bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present a new multi-level algorithm based on particle swarm optimization (PSO) for bisecting graph. The success of our algorithm relies on exploiting both the PSO method and the concept of the graph core. Our experimental evaluations on 18 different graphs show that our algorithm produces encouraging solutions compared with those produced by MeTiS that is a state-of-the-art partitioner in the literature.
Evolving Regular Expressions for GeneChip Probe Performance Prediction
Authors: William B. Langdon, Andrew P. Harrison
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Affymetrix High Density Oligonuclotide Arrays (HDONA) simultaneously measure expression of thousands of genes using millions of probes. We use correlations between measurements for the same gene across 6685 human tissue samples from NCBI's GEO database to indicated the quality of individual HG-U133A probes. Low concordance indicates a poor probe. Regular expressions can be data mined by a Backus-Naur form (BNF) context-free grammar using strongly typed genetic programming written in gawk and using egrep. The automatically produced motif is better at predicting poor DNA sequences than an existing human generated RE, suggesting runs of Cytosine and Guanine and mixtures should all be avoided.
Comparing Several Textual Information Retrieval Systems for the Geographical Information Retrieval Task
Authors: José M. Perea-Ortega, Miguel A. García-Cumbreras, Manuel García-Vega, L. A. Ureña-López
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

This paper presents a comparison between three different Information Retrieval (IR) systems employed in a particular Geographical Information Retrieval (GIR) system, the GeoUJA IR, a GIR architecture developed by the SINAI research group. It could be interesting and useful for determining which of the most used IR systems works better in GIR task. In the experiments, we have used the Lemur, Terrier and Lucene search engines using mono and bilingual queries. We present baseline cases, without applying any external processes, such as query expansion or filtering. In addition, we have used the default settings of each IR system. Results show that Lemur works better using monolingual queries and Terrier works better using the bilingual ones.
Spoken Word Recognition from Side of Face Using Infrared Lip Movement Sensor
Authors: Takahiro Yoshida, Erika Yamazaki, Seiichiro Hangai
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

In order to realize multimodal speech recognition on a mobile phone, it is necessary to develop a small sensor which enables to measure lip movement with small calculation cost. In the previous study, we have developed a simple infrared lip movement sensor located on the front of mouth and cleared that the possibility of HMM based word recognition with 87.1% recognition rate. However, in practical use, it is difficult to set the sensor in front of mouth. In this paper, we developed a new lip movement sensor which can extract the lip movement from either side of a speaker's face and examine the performance. From experimental results, we have achieved 85.3% speaker independent word recognition rate only with the lip movement from the side sensor.
Policy-Based Web Service Selection in Context Sensitive Environment
Authors: Tao Zhou, Xiaolin Zheng, William Wei Song, Xiaofeng Du, Deren Chen
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Web service selection is a key issue in the Service-Oriented Computing. Generally, web services are provided with different QoS values, so they can be selected dynamically in service composition process. However, the conventional context free QoS selection model does not consider the context sensitive constraints and the changeability of QoS values. This paper proposes a policy-based context sensitive QoS model to effectively calculate QoS values and select web services. By introducing context to the QoS model, web service composition can be used widely and flexibly in the real world business.
Axiom Pinpointing in General Tableaux
Authors: Franz Baader, Rafael Peñaloza
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL.The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of "tableaux algorithms," which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.
Toward a Reference Process for Developing Wireless Internet Services
Authors: Alexis Ocampo Daniela Boggio Jurgen Munch
Venue: IEEE Transactions on Software Engineering (2003)

Wireless Internet services such as mobile Web applications promise an enormous market potential. The field is characterized by extreme time-to-market pressure and insufficient knowledge about development procedures and technical constraints. This results in insufficient guidance for project managers and software developers on selecting appropriate development processes, techniques, methods, and tools. In addition, there is an enormous lack of knowledge about the effects (such as effort consumption, defect injection) of such technologies that hinders the transfer of innovative technologies into practice. This article describes an initial reference process by summarizing essential technologies for the development of wireless Internet services and experience with these technologies on the levels of life cycle processes, engineering processes, and managerial processes. The reference process is based on a comprehensive literature survey and the execution of development projects for wireless Internet services. The goal of the article is to provide domain-specific guidance for project managers and software developers with accompanying lessons learned from the past.
Mechanisms for information elicitation
Authors: Aviv Zohar, Jeffrey S. Rosenschein
Venue: Artificial Intelligence (2008)

We study the computational aspects of information elicitation mechanisms in which a principal attempts to elicit the private information of other agents using a carefully selected payment scheme based on proper scoring rules. Scoring rules, like many other mechanisms set in a probabilistic environment, assume that all participating agents share some common belief about the underlying probability of events. In real-life situations however, the underlying distributions are not known precisely, and small differences in beliefs of agents about these distributions may alter their behavior under the prescribed mechanism. We examine two related models for the problem. The first model assumes that agents have a similar notion of the probabilities of events, and we show that this approach leads to efficient design algorithms that produce mechanisms which are robust to small changes in the beliefs of agents. In the second model we provide the designer with a more precise and discrete set of alternative beliefs that the seller of information may hold. We show that construction of an optimal mechanism in that case is a computationally hard problem, which is even hard to approximate up to any constant. For this model, we provide two very different exponential-time algorithms for the design problem that have different asymptotic running times. Each algorithm has a different set of cases for which it is most suitable. Finally, we examine elicitation mechanisms that elicit the confidence rating of the seller regarding its information.
Hand-painted animation with intelligent brushes
Authors: Tom Van Laerhoven
Venue: Computer Animation and Virtual Worlds (2008)

In this paper we argue for the concept of brushes and pigments enhanced with behavioural intelligence as a complement to established 2D computer animation techniques. Our approach allows the user to enrich and animate interactively created images by semi-autonomously embedding procedural animation into them. This way, artistic skills of trained animators become within reach of everyone in the digital world, even to completely novice users. To exemplify this concept, we elaborate on several special-purpose brushes and animated pigment for painting with animation. These include a programmable semi-autonomous brush used to paint variations of strokes in successive frames (e.g. flames of fire), the moving-dab brush which enables dabs of paint to follow a user-defined path (e.g. smoke puffs) and animated pigment to produce secondary motion such as vibrant or waving paint textures. We believe our system offers a new fresh perspective on 2D computer aided animation production and associated tools. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
Authors: Vincent Lefèvre, Damien Stehlé, Paul Zimmermann
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

We searched for the worst cases for correct rounding of the exponential function in the IEEE 754r decimal64 format, and computed all the bad cases whose distance from a breakpoint (for all rounding modes) is less than 10¿ 15 ulp, and we give the worst ones. In particular, the worst case for |x| ¿ 3 ×10¿ 11 is $\exp(9.407822313572878 \times 10^{-2}) = 1.098645682066338\,5\,0000000000000000\,278\ldots$. This work can be extended to other elementary functions in the decimal64 format and allows the design of reasonably fast routines that will evaluate these functions with correct rounding, at least in some domains.
A general buffer scheme for the windows scheduling problem
Authors: Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir
Venue: Journal of Experimental Algorithmics (JEA) (2009)

Broadcasting is an efficient alternative to unicast for delivering popular on-demand media requests. Broadcasting schemes that are based on windows scheduling algorithms provide a way to satisfy all requests with both low bandwidth and low latency. Consider a system of n pages that need to be scheduled (transmitted) on identical channels an infinite number of times. Time is slotted, and it takes one time slot to transmit each page. In the windows scheduling problem (WS) each page i, 1 &le; i &le; n, is associated with a request window wi. In a feasible schedule for WS, page i must be scheduled at least once in any window of wi time slots. The objective function is to minimize the number of channels required to schedule all the pages. The main contribution of this paper is the design of a general buffer scheme for the windows scheduling problem such that any algorithm for WS follows this scheme. As a result, this scheme can serve as a tool to analyze and/or exhaust all possible WS-algorithms. The buffer scheme is based on modelling the system as a nondeterministic finite state machine in which any directed cycle corresponds to a legal schedule and vice-versa. Since WS is NP-hard, we present some heuristics and pruning-rules for cycle detection that ensure reasonable cycle-search time. By introducing various rules, the buffer scheme can be transformed into deterministic scheduling algorithms. We show that a simple page-selection rule for the buffer scheme provides an optimal schedule to WS for the case where all the wi's have divisible sizes, and other good schedules for some other general cases. By using an exhaustive-search, we prove impossibility results for other important instances. We also show how to extend the buffer scheme to more generalized environments in which (i) pages are arriving and departing on-line, (ii) the window constraint has some jitter, and (iii) different pages might have different lengths.