ppxscal/embedding_network huggingface dataset:
Knowledge as a Service. An Online Scoring Engine Architecture
Authors: Diana Gorea
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

The paper presents a predictive models management system called DeVisa that offers online services such as: scoring,model composition, model comparison, search and statistics. For the purpose of interaction between the consumer applications and the DeVisa system a XML-based language called PMQL is defined. The paper focuses on the scoring service as an online knowledge provider, analyzes the challenges in achieving this objective and the solutions that were found. From a technological perspective DeVisa uses a native XML database system for storing the predictive models expressed in PMML and an XQuery library for processing the models. All the functionality is provided via Web Services.
Optimal Sizing and Siting of Distributed Energy Resources Considering Public and Private Incentive Policies
Authors: Angelo Campoccia, Eleonora Riva Sanseverino, Gaetano Zizzo
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

The present work presents the formulation and solution approach for the problem of optimal sizing and siting of distributed energy resources based on Photovoltaic, PV, technology. The considered system is an isolated grid (small island) and the parts involved are the utility and the customers. As it happens in islands, the same utility generates and delivers energy to customers, for this reason, the installation of dispersed generation units is beneficial for reducing power losses, regularizing the voltage profile, but also for increasing the profit. The problem is solved by means of the Non dominated sorting Genetic Algorithm II, NSGA-II, identifying the optimal size and location of PV systems under different incentive policies supported by both the utility and the national government. Since a multiobjective approach has been used, the sizing and siting of PV units as well as the amount of financial support from the local distributor utility allowing higher benefits both for the utility and for the customers have been determined. The application section also quantifies the external costs associated with the most interesting design solutions.
Page-Based Anomaly Detection in Large Scale Web Clusters Using Adaptive MapReduce (Extended Abstract)
Authors: Junsup Lee, Sungdeok Cha
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

While anomaly detection systems typically work on single server, most commercial web sites operate cluster environments, and user queries trigger transactions scattered through multiple servers. For this reason, anomaly detectors in a same server farm should communicate with each other to integrate their partial profile. In this paper, we describe a real-time distributed anomaly detection system that can deal with over one billion transactions per day. In our system, base on Google MapReduce algorithm, an anomaly detector in each node shares profiles of user behaviors and propagates intruder information to reduce false alarms. We evaluated our system using web log data from www.microsoft.com. The web log data, about 250GB in size, contains over one billion transactions recorded in a day.
Assessing the online tourism domain from an information search perspective
Authors: Daniel R. Fesenmaier
Venue:  (2008)

With the huge amount of information on the Internet, search has become increasingly important in travelers' use of the Internet for travel planning. However, developing useful search technologies to support travel planning requires substantial knowledge about the underlying world a technology represents, i.e., the online tourism domain. Arguably, online search engines provide the means for travelers to access to the tourism domain in a comprehensive way. As such, the goal of this dissertation is to assess the online tourism domain within the context of travelers' use of search engines for travel planning. This dissertation primarily consists of two parts: first, the online tourism domain is conceptualized based upon theoretical perspectives in tourism literature with the emphasis on: tourism industry as a conglomeration of business entities; the symbolic representation of the industry in the form of "language of tourism"; and, the hierarchical, multi-faceted nature of information search for trip planning in the online environment. These literature streams provide directions for understanding the composition, form, and structural properties of the online tourism domain. Second, guided by this conceptualization, a series of empirical studies were conducted to examine the online tourism domain, focusing on: (1) the extent to which the domain is represented through search engines; (2) the representational vocabulary of the domain, i.e., the ontology, represented on tourism related Web pages as well as user queries in search engines; and, (3) the language representation of the domain, i.e., words and their semantic relationships, in tourism related Web pages and user queries. Results of this research show that the online tourism domain is semantically rich and current search technologies can only provide a limited representation. The tourism domain manifests characteristics that reflect the complexity and idiosyncrasies of destinations as well as the promotional purposes of the industry. This research also shows that there is a substantial gap between the language representations in tourism related Web pages and user queries. Based on the empirical analysis, the concept of the online tourism domain is defined using a series of propositions. In addition, implications for designing semantically driven search technologies to support travel planning are discussed.
Multidimensional Linear Cryptanalysis of Reduced Round Serpent
Authors: Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Various authors have previously presented different approaches how to exploit multiple linear approximations to enhance linear cryptanalysis. In this paper we present a new truly multidimensional approach to generalise Matsui's Algorithm 1. We derive the statistical framework for it and show how to calculate multidimensional probability distributions based on correlations of one-dimensional linear approximations. The main advantage is that the assumption about statistical independence of linear approximations can be removed. Then we apply these new techniques to four rounds of the block cipher Serpent and show that the multidimensional approach is more effective in recovering key bits correctly than the previous methods that use a multiple of one-dimensional linear approximations.
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
Authors: Bin Fu, Zhixiang Chen
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Coset enumeration is for enumerating the cosets of a subgroup H of a finite index in a group G. We study coset enumeration algorithms by using two random sources to generate random elements in a finite group G and its subgroup H. For a finite set S and a real number c > 0, a random generator R S is a c-random source for S if c· min {Pr[a = R S ())|a ¿ S]} ¿ max {Pr[a = R S ())|a ¿ S]}. Let c be an arbitrary constant. We present an $O({|G|\over \sqrt{|H|}}(\log |G|)^3)$-time randomized algorithm that, given two respective c-random sources R G for a finite group G and R H for a subgroup H ¿ G, computes the index $t={|G|\over |H|}$ and a list of elements a 1,a 2, ¿ , a t ¿ G such that a i H ¿ a j H = ¿ for all $i\not=j$, and $\cup_{i=1}^t a_iH=G$. This algorithm is sublinear time when |H| = ¿((log|G|)6 + ¿ ) for some constant ¿> 0.
Collaborative Load-Balancing in Storage Networks Using Agent Negotiation
Authors: Shay Raz, Raz Lin, Onn Shehory
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

The rapid advances in the computer industry allow building larger systems that require mass storage volumes. As storage space increases, its management becomes increasingly difficult. In contemporary enterprise storage systems, performance has developed into a major bottleneck, which negatively affects the overall IT performance. Centralized solutions are often infeasible and thus a distributed solution should be sought. Our novel approach involves incorporating intelligent agents to the storage system, allowing the utilization of a distributed negotiation scheme between agents that act on behalf of the clients who require storage and on behalf of the storage servers within the system. Using a simulation environment which models real settings of a large storage network, we demonstrate the benefits of applying our distributed solution in the storage management domain in terms of client satisfaction, servers' revenue, and overall system performance. Our results show a significant improvement in storage performance when this solution is implemented.
Fuzzy multi-objective production/distribution planning decisions with multi-product and multi-time period in a supply chain
Authors: Tien-Fu Liang
Venue: Computers and Industrial Engineering (2008)

This work develops a fuzzy multi-objective linear programming (FMOLP) model with piecewise linear membership function to solve integrated multi-product and multi-time period production/distribution planning decisions (PDPD) problems with fuzzy objectives. The original multi-objective linear programming designed in this work model attempts to simultaneously minimize total costs and total delivery time in relation to inventory levels, available machine capacity and labor levels at each source, and forecast demand and available warehouse space at each destination and total budget. The proposed FMOLP model provides a systematic framework that facilitates fuzzy decision-making process, enabling the decision maker (DM) to interactively adjust the search direction during the solution procedure to obtain a DM's preferred satisfactory solution. Additionally, the DM computes the value in each cost category by considering the time value of money in the proposed model, which is appropriate for practical application to the PDPD problem in a supply chain. Finally, an industrial case demonstrates the feasibility of applying the proposed model to a real-world integrated PDPD problem in a supply chain under uncertain environments.
Flexible Spectrum Business Models for the Mobile Industry
Authors: Pieter Ballon, Simon Delaere
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The concept of Flexible Spectrum is a way to overcome some of the current inefficiencies and high entry barriers plaguing the mobile industry. Increasingly, a Cognitive Pilot Channel (CPC) is regarded as the central enabler for Flexible Spectrum. This paper outlines the CPC concept from a business point of view and clarifies its current status in the standardization and regulation fields. Based on several potential CPC implementations, it identifies a number of Flexible Spectrum business configurations and revenue sharing models. It also performs an initial evaluation of these models using a business model scorecard approach.
The efficient search method for high risk events of power systems caused by natural disasters
Authors: Tetsushi Miki
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

Power systems become large and complex, so the occurrence rates of a great deal of energy loss caused by faults become high. In this situation, the development of the efficient search method for high risk events of power systems is strongly required. Risk is defined as the product of energy loss and its occurrence rate, considering that the goal of power systems is the stable supply of power. This paper presents the developed method which can search accurately and efficiently high risk events of power systems resulted from the loss of transient stability caused by natural disasters. It was applied to the model system composed of 3 generators and 9 buses. The results of application have clarified its effectiveness.
The Jrpm System for Dynamically Parallelizing Sequential Java Programs
Authors: Michael K. Chen, Kunle Olukotun
Venue: IEEE Micro (2003)

As instruction-level parallelism with a single thread of control approaches its performance limits, designers must find other architectural improvements to speed up program execution. The Jrpm system takes advantage of recent developments to enable a new approach to automatic parallelization. Jrpm can exploit thread-level parallelism with minimal programmer effort.
Transferring Whole Blood Time Activity Curve to Plasma in Rodents Using Blood-Cell-Two-Compartment Model
Authors: Jih-Shian Lee, Kuan-Hao Su, Jun-Cheng Lin, Ya-Ting Chuang, Ho-Shiang Chueh, Ren-Shyan Liu, Shyh-Jen Wang, Jyh-Cheng Chen
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

The term input function usually refers to the tracer plasma time activity curve (pTAC), which is necessary for quantitative positron emission tomography (PET) studies. The purpose of this study was to acquire the pTAC from the independent component analysis (ICA) estimated whole blood time activity curve (wTAC) using our proposed method: FDG blood-cell-two-compartment model (BCM). We also compared published models, which are linear haematocrit (HCT) correction, nonlinear HCT correction, and two-exponential correction. According to the results, the normalized root mean square error (NRMSE) and error of area under curve (EAUC) of BCM estimated pTAC were the smallest. Compartmental and graphic analyses were used to estimate metabolic rate of FDG (MRFDG). The percentage error of MRFDG(PEMRFDG) estimated from BCM corrected pTAC was also the smallest. The BCM is a better choice to transfer wTAC to pTAC for quantification.
Potential Benefits of Human-Like Dialogue Behaviour in the Call Routing Domain
Authors: Joakim Gustafson, Mattias Heldner, Jens Edlund
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)

This paper presents a Wizard-of-Oz (Woz) experiment in the call routing domain that took place during the development of a call routing system for the TeliaSonera residential customer care in Sweden. A corpus of 42,000 calls was used as a basis for identifying problematic dialogues and the strategies used by operators to overcome the problems. A new Woz recording was made, implementing some of these strategies. The collected data is described and discussed with a view to explore the possible benefits of more human-like dialogue behaviour in call routing applications.
MECRAD: Model and Tool for the Technical Quality Evaluation of Software Products in Visual Environment
Authors: Laura Silvia Vargas Pérez, Agustín Francisco Gutiérrez Tornés, Edgardo Manuel Felipe Riverón
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

In this document a model and tool named MECRAD, based among others, upon the following standards: ISO/IEC 9126 and 14598, SQUARE Project, IEEE1061 and SUMI is presented. It is a model for the technical evaluation of Rapid Applications Development (RAD) tools in visual environment. It is directed to organizations, companies and final users that need to select, in an effective and easily way, the most appropriate software to develop their applications. A guideline for the concrete instrumentation of the model, such as ranking, presentation and documentation procedures, is giving.. Cases of study were developed and the results are given (Visual Studio.Net, Net Beans, and Eclipse).
Machinery Fault Diagnosis Using Least Squares Support Vector Machine
Authors: Lingling Zhao, Kuihe Yang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In order to enhance fault diagnosis precision, an improved fault diagnosis model based on least squares support vector machine (LSSVM) is presented. In the model, the wavelet packet analysis and LSSVM are combined effectively. The power spectrum of fault signals are decomposed by wavelet packet analysis, which predigests choosing method of fault eigenvectors. And then the LSSVM is adopted to realize fault diagnosis. The non-sensitive loss function is replaced by quadratic loss function and the inequality constraints are replaced by equality constraints. Consequently, quadratic programming problem is simplified as the problem of solving linear equation groups, and the SVM algorithm is realized by least squares method. It is presented to choose parameter of kernel function in definite range by dynamic way, which enhances preciseness rate of recognition. The simulation results show the model has strong non-linear solution and anti-jamming ability, and it can effectively distinguish fault type.
A Conversation with Steve Bourne, Eric Allman, and Bryan Cantrill
Authors: John Stanik
Venue: Queue (2008)

In part one of a two-part series, three Queue editorial board members discuss the practice of software engineering. In their quest to solve the next big computing problem or develop the next disruptive technology, software engineers rarely take the time to look back at the history of their profession. What's changed? What hasn't changed? In an effort to shed light on these questions, we invited three members of ACM Queue's editorial advisory board to sit down and offer their perspectives on the continuously evolving practice of software engineering.
Video Scene Annotation Based on Web Social Activities
Authors: Daisuke Yamamoto, Tomoki Masuda, Shigeki Ohira, Katashi Nagao
Venue: IEEE MultiMedia (2008)

This article describes a mechanism to acquire the semantics of video content from the activities of Web communities that use a bulletin-board system and weblog tools to discuss video scenes.
Tree Automata with Global Constraints
Authors: Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so that whenever two subtrees t and t¿ evaluate (in an accepting run) to two states which are in the (dis)equality relation, they must be (dis)equal. We study several properties of TAGEDs, and prove decidability of emptiness of several classes. We give two applications of TAGEDs: decidability of an extension of Monadic Second Order Logic with tree isomorphism tests and of unification with membership constraints. These results significantly improve the results of [10].
Code evaluation using fuzzy logic
Authors: Zikrija Avdagic, Dusanka Boskovic, Aida Delic
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

This paper presents application of a fuzzy logic based system to automatically evaluate the maintainability of code. Code evaluation is accomplished by rating its quality provided with bad smells in code as inputs. Straightforward bad smells with existing software metrics tools are selected as inputs: duplicated code, long methods, large classes having a high cyclomatic complexity, or a large number of parameters and temporary fields. Removing these bad smells can result in significant code improvements concerning readability and maintainability. However, the precise definition of attributes like small, long, large or high is not clear, and their identification is rather subjective. Fuzzy logic values are suitable for capturing partial correspondence to attributes and fuzzy rules model have been used to describe the relation between bad smells and code quality. Model supporting the experimental evaluation of the fuzzy based code evaluation is implemented in Java.
Binary Image Registration Using Covariant Gaussian Densities
Authors: Csaba Domokos, Zoltan Kato
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

We consider the estimation of 2D affine transformations aligning a known binary shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the two images and then compute the transformation parameters from these landmarks. In this paper, we propose a novel approach where the exact transformation is obtained as a least-squares solution of a linear system. The basic idea is to fit a Gaussian density to the shapes which preserves the effect of the unknown transformation. It can also be regarded as a consistent coloring of the shapes yielding two rich functions defined over the two shapes to be matched. The advantage of the proposed solution is that it is fast, easy to implement, works without established correspondences and provides a unique and exact solution regardless of the magnitude of transformation.
Modeling and Reasoning about Semantic Web Services Contract Using Description Logic
Authors: Hai Liu, Qing Li, Naijie Gu, An Liu
Venue: Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management (2008)

Currently, the natural expectation of contracting a set of Web services by virtue of their semantics is becoming more and more feasible and popular. Meanwhile, it is generally accepted that a formalism with a well-defined model-theoretic semantics (i.e. some sort of logics) should be considered as the underpinning of Semantic Web Services [1]. In this paper, concrete domain and action theory are incorporated into a very expressive DL, called ALCQO. Notably, this extension can significantly augment the expressive power for modeling and reasoning about dynamic aspects of services contracting. At the same time, the original nature and advantages of classical DLs, particularly the ability to describe ”static” aspects of Webservices, are also preserved to the extent possible.
Mining Frequent Similar Patterns on Mixed Data
Authors: Ansel Y. Rodríguez-González, José Francisco Martínez-Trinidad, Jesús Ariel Carrasco-Ochoa, José Ruiz-Shulcloper
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Frequent Pattern Mining is an important task due to the relevance of repetitions on data, also it is a fundamental step in the Association Rule Mining. Most of the current algorithms for mining frequent patterns assume that two object subdescriptions are similar if and only if they are equal, but in soft sciences some other similarity functions are used. In this work, we focus on the search of frequent patterns on Mixed Data, incorporating similarity between objects. We propose a novel and efficient algorithm to mine frequent similar patterns for a family of similarity functions that fulfill Downward Closure property and we also propose another algorithm for the remaining families of similarity functions. Some experiments over mixed datasets are done, and the results are compared against the ObjectMiner algorithm.