ppxscal/embedding_network huggingface dataset:
Further extension of a class of periodizing variable transformations for numerical integration
Authors: Avram Sidi
Venue: Journal of Computational and Applied Mathematics (2008)

Class S"m variable transformations with integer m, for accurate numerical computation of finite-range integrals via the trapezoidal rule, were introduced and studied by the author. A representative of this class is the sin^m-transformation. In a recent work of the author, this class was extended to arbitrary noninteger values of m, and it was shown that exceptionally high accuracies are achieved by the trapezoidal rule in different circumstances with suitable values of m. In another recent work by Monegato and Scuderi, the sin^m-transformation was generalized by introducing two integers p and q, instead of the single integer m; we denote this generalization as the sin^p^,^q-transformation here. When p=q=m, the sin^p^,^q-transformation becomes the sin^m-transformation. Unlike the sin^m-transformation which is symmetric, the sin^p^,^q-transformation is not symmetric when p
Posynomial Fuzzy Relation Geometric Programming
Authors: Ji-Hui Yang, Bing-Yuan Cao
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this paper, the concept and type of posynomial fuzzy relation geometric programming is introduced, some basic theories of posynomial fuzzy relation geometric programming is presented, and then a solution procedure is expatiated to solving such a programming based on structure of feasible region. And finally, two practical examples are given for illustration purpose.
Pervasive Computing Helps Fans Get Into the Game
Authors: Maya Dollarhide
Venue: IEEE Pervasive Computing (2007)

Being a sports fan used to be simple: buy a ticket, order a hotdog and beer, and watch your favorite players do what they do best. Today, pervasive computing devices give fans more control over their experience and more information about the games they love, even when they're miles away.
Multi-scale Modeling with Cellular Automata: The Complex Automata Approach
Authors: Alfons G. Hoekstra, Jean-Luc Falcone, Alfonso Caiazzo, Bastien Chopard
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Cellular Automata are commonly used to describe complex natural phenomena. In many cases it is required to capture the multi-scale nature of these phenomena. A single Cellular Automata model may not be able to efficiently simulate a wide range of spatial and temporal scales. It is our goal to establish a Cellular Automata modeling paradigm for multi-scale processes. Here we will demonstrate that Complex Automata, a paradigm that we recently introduced, are capable to facilitate such modeling.
A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis
Authors: Liu Hongmei
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

A new algorithm for fault-tolerant routing based on detour and backtracking techniques is developed for m-ary n-cube multi-computer networks. We analyzed its performance under the condition that when an arbitrary number of components have been damaged and derived some exact expressions for the probability of routing messages via optimal paths from the source node to obstructed node. The probability of routing messages via an optimal path between any two nodes is a special case of our results, and can be obtained by replacing the obstructed node with the destination node. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fuzzy Controller for Robot Manipulators
Authors: Basil M. Al-Hadithi, Fernando Matía, Agustín Jiménez
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

This paper deals with the design of a fuzzy (FC) based on pole assignment method for the control of a robotic system. The main idea is to design a supervisory fuzzy controller capable to adjust the controller parameters in order to obtain the desired axes positions under variationes of the robot parameters and payload variations. The behaviour of the closed loop fuzzy system controlled by the fuzzy controller is identical to the linear system whose state transition matrix is the desired one.The main objective of this paper is the use of the affine Takagi-Sugeno (T-S) fuzzy model to represent both the controlled system and the fuzzy controller taking into consideration the effect of the constant term [1]. Most of the research works analyzed the T-S model assuming that the non-linear system is linearized with respect to the origin in each IF-THEN rule, which means that the consequent part of each rule is a linear function with zero constant term. This will in turn reduce the accuracy of approximating non-linear systems.
Enhancing hotel search with semantic web technologies
Authors: Magnus Niemann, Malgorzata Mochol, Robert Tolksdorf
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2008)

Tourism service providers are more and more under pressure to offer products of greater complexity and diversity to meet the ever-changing demands of travelers; the individualistic consumption patterns and lifestyles makes it increasingly difficult for tourist service providers to anticipate consumer behavior and configure their services accordingly, i.e. the tourist industry must focus more on a "hybrid consumer" whose travel choice will be more complex. Although current online travel systems aim to support the customer in finding a suitable hotel or even a whole trip, most of the work is still up to the customer, who has to consider several sources of information before deciding which hotel to book. Furthermore, since the quality of a hotel room w.r.t the requirements of the end-user are multi-dimensional and cannot be easily expressed on discrete scales, the main critical issue in such cases is a price/benefit ratio which is defined by what is known, as the "best" booking. To tackle these problems an advanced search technology that considers the ratio and ranks results accordingly to the user requirements is needed. In this paper we propose a framework which uses Semantic Web technologies for an improved exploration and rating of hotels for business customers in order to reduce the search time and costs, which, in turn, results in a huge benefit for the end-users. The framework provides methods for modeling domain specific expert knowledge and integration of diverse heterogeneous data sources. Semantic technologies enable business customer to formalize their requirements and to combine those requirements with aggregated hotel information like location or features, thus achieving a selection of the hotels ranked according to the customer's requirements.
Truthful Unification Framework for Packing Integer Programs with Choices
Authors: Yossi Azar, Iftah Gamzu
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

One of the most interesting research directions within the field of algorithmic mechanism design revolves the study of hard combinatorial optimization problems. In this setting, many common algorithmic techniques cannot be utilized as they violate certain monotonicity properties that are imperative for truthfulness. Consequently, it seems of the essence to develop alternative methods, which can underlie truthful mechanisms. In particular, since many problems can be formulated as instances of integer linear programs, it seems that devising techniques that apply to integer linear programs is significantly important.In this paper, we focus our attention on packing integer programs with choices. Our main findings can be briefly summarized as follows: 1 We develop a framework, which can be used as a building block to approximately solve packing integer programs with choices. The framework is built upon a novel unification technique that approximately solves an instance of a packing integer program with choices, given algorithms that approximately solve sub-instances of it. The framework is deterministic and monotone, and hence can underlie truthful deterministic mechanisms. 1 We demonstrate the applicability of the framework by applying it to several NP-hard problems. In particular, we focus on the bandwidth allocation problem in tree networks, and the multiple knapsack problem on bipartite graphs. Notably, using the mentioned framework, we attain the first non-trivial approximation guarantees for these problems in a game theoretic setting.
The Case for Context-Bounded Verification of Concurrent Programs
Authors: Shaz Qadeer
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

Concurrent programs are difficult to get right. Subtle interactions among communicating threads in the program can result in behaviors unexpected to the programmer. These behaviors typically result in bugs that occur late in the software development cycle or even after the software is released. Such bugs are difficult to reproduce and difficult to debug. As a result, they have a huge adverse impact on the productivity of programmers and the cost of software development. Therefore, tools that can help detect and debug concurrency errors will likely provide a significant boost to software productivity.
Lagrangian-Based Solution Approaches for a Resource-Constrained Parallel Machine Scheduling Problem with Machine Eligibility Restrictions
Authors: Emrah B. Edis, Ceyhun Araz, Irem Ozkarahan
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This study is motivated by a real world scheduling problem in an injection molding department of an electrical appliance company. In this paper, a resource-constrained parallel machine scheduling problem with machine eligibility restrictions is investigated. For the problem, an integer linear program is developed with the objective of minimizing total flow time. Based on this model, a Lagrangian-based solution approach with a subgradient optimization procedure has been proposed. Additionally, a problem-specific heuristic algorithm is developed to obtain near-optimal solutions. Through randomly generated instances of the problem, it is demonstrated that the proposed algorithms generate not only very tight lower bounds but also efficient results with a small optimality gap.
Dynamic analysis of a train-bridge system under wind action
Authors: H. Xia, W. W. Guo, N. Zhang, G. J. Sun
Venue: Computers and Structures (2008)

A dynamic model of wind-train-bridge system is established. The wind actions on the bridge and the trains, including both buffeting and self-excited forces, are generated in time domain using computer simulation techniques and the given aerodynamic coefficients and flutter derivatives. The proposed formulations are applied to a schemed long span suspension bridge. The whole histories of the train passing through the bridge under wind actions are simulated to obtain the dynamic response of the bridge, and the running safety and stability indices of the train vehicles. The results show that wind has great influences on the train-bridge system. When the wind velocity is higher than 25m/s, the running safety indices of the train vehicles exceed the allowances, to which great attention should be paid.
VLSI: an investigation into the effect of non-uniform distribution of current on crosstalk noise
Authors: H. J. Kadim
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

On-chip interconnect has become a critical dominant factor affecting the performance and reliability of high performance integrated circuits (IC) such as system-on-a-chip (SoC). As the chip dimensions increase with chip complexity, interconnects tend to get longer. The longer on-chip interconnects coupled with a decrease in wire width and wire separation, inductive effects, and more specifically, mutual inductance coupling between neighbouring wires become non-negligible. An analytical model to examine the effect of non-uniform distribution of current on the mutual inductance and capacitance between on-chip interconnects, and the subsequent effect on the noise peak voltage of the victim line, is presented.
The Web Versus Digital Libraries: Time to Revisit This Once Hot Topic
Authors: Vittore Casarosa, Jill Cousins, Anna Maria Tammaro, Yannis Ioannidis
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

At the end of last century (Internet time elapses much quicker than normal time, and it already looks like a long time ago), the "information explosion" on the Web on one side, and the flourishing of research activities on digital library technologies on the other, spurred heated discussions about the future of traditional libraries. The view of one camp was that since "all" the information was available on-line, the use of smart search engines and clever software tools would allow Digital Libraries to provide all the information (and the services) needed by an information seeker. The view of the other camp was that the value of information was not just in its sheer quantity, but was rather in the organization and the quality of the information made available, and that could never be done by "programs".
Speech watermarking through parametric modeling
Authors: John R. Deller
Venue:  (2007)

Parameter-embedded watermarking of speech is effected through slight perturbations of parametric models of deeply-integrated dynamics of the signal. This research focusses on speech watermarking techniques based on linear-in-parameters speech models. Information is embedded by modifying the linear predictor coefficients of the original speech, subject to fidelity constraints. The modified parameters are used to reconstruct the watermarked speech. Experiments with real speech data are used to assess robustness and other performance properties. A particular example of watermark detector design is discussed and performance tested. In set-membership filtering (SMF) based parametric watermarking, linear predictor (LP) coefficients of the original speech are modified subject to an objective fidelity constraint. SMF is used to obtain a hyperellipsoidal set of allowable parameter perturbations (i.e., watermarks) subject to a constraint on the error between the watermarked and original material. This research discusses the robustness of SMF based watermarking to filtering, quantization and combination attacks. An important consideration in watermark robustness is the energy of the watermark signal (difference between watermarked and original signals). Watermarks of higher energy are obtained from perturbed LP coefficients at the boundary of the hyperellipsoidal set. A constrained optimization problem is solved to obtain the best watermarks for filtering and quantization attacks. Finally, a generalized framework for parametric speech watermarking is presented. In addition to the LP model, other parametric representations such as log area ratio, inverse sine, line spectrum pair, and reflection coefficients are used for speech watermarking. An application of perturbed parameter theory for autoregressive models is presented. The perturbed parameter theory is used to obtain bounds on the perturbation of the stegosignal caused by watermarking.
Differential subordination and argumental property
Authors: Mamoru Nunokawa, Shigeyoshi Owa, Junichi Nishiwaki, Kazuo Kuroki, Toshio Hayami
Venue: Computers Mathematics with Applications (2008)

For analytic functions f(z) in the open unit disk E and convex functions g(z) in E, Ch. Pommerenke [Ch. Pommerenke, On close-to-convex analytic functions, Trans. Amer. Math. Soc. 114 (1) (1965) 176-186] has proved one theorem which is a generalization of the result by K. Sakaguchi [K. Sakaguchi, On a certain univalent mapping, J. Math. Soc. Japan 11 (1959) 72-75]. The object of the present paper is to generalize the theorem due to Pommerenke.
The Use of Interval-Valued Probability Measures in Optimization Under Uncertainty for Problems Containing a Mixture of Fuzzy, Possibilisitic, and Interval Uncertainty
Authors: Weldon A. Lodwick, K. David Jamison
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

A simple definition of interval-valued probability measure is given and its implications examined. Properties are discussed which allow for the analysis of mixtures of fuzzy, possibilistic, probabilistic, cloud, and interval uncertainty utilizing interval-valued probability theory. It is shown how these properties allow for optimization under uncertainty where the uncertainty is mixed (fuzzy, possibilitic, probabilistic, clouds, and interval ). An example of this type of optimization is given illustrating the usefulness and power of the concepts.
A CBR-Based Approach for Ship Collision Avoidance
Authors: Yuhong Liu, Chunsheng Yang, Xuanmin Du
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, we propose a novel CBR-based approach for ship collision avoidance. After the introduction of the CBR-based decision-making support, we present two abstraction principles, selecting view points and describing granularity, to create collision avoidance cases from real-time navigation data. Several issues related case creation and CBR-based decision-making support are discussed in details, including case presentation, case retrieval and case learning. Some experimental results show the usefulness and applicability of CBR-based approach for ship collision avoidance.
A framework for web service discovery: service's reuse, quality, evolution and user's data handling
Authors: Uddam Chukmol
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

With proliferation of published Web services, the task of finding relevant ones for the developers of service oriented application becomes more and more difficult. Several existing tools or mechanisms allow this discovery; however, those approaches often skip different elements such as service's quality, reuse, evolution and users' comment making the discovery result feebly relevant to requesters' need and prevent the requesters from using up-to-date and available web services efficiently. In this research work, we present a framework for web service discovery taking into account the reuse of web service search result through caching technique, the quality of service through qualitative test result, the web service's evolution through version track technique and we provide a novel scheme of discovery using user's annotating information.
Clustering XML Documents Using Closed Frequent Subtrees: A Structural Similarity Approach
Authors: Sangeetha Kutty, Tien Tran, Richi Nayak, Yuefeng Li
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper presents the experimental study conducted over the INEX 2007 Document Mining Challenge corpus employing a frequent subtree-based incremental clustering approach. Using the structural information of the XML documents, the closed frequent subtrees are generated. A matrix is then developed representing the closed frequent subtree distribution in documents. This matrix is used to progressively cluster the XML documents. In spite of the large number of documents in INEX 2007 Wikipedia dataset, the proposed frequent subtree-based incremental clustering approach was successful in clustering the documents.
Utilizing phrase-similarity measures for detecting and clustering informative RSS news articles
Authors: Maria Soledad Pera, Yiu-Kai Ng
Venue: Integrated Computer-Aided Engineering (2008)

As the number of RSS news feeds continue to increase over the Internet, it becomes necessary to minimize the workload of the user who is otherwise required to scan through huge number of news articles to find related articles of interest, which is a tedious and often an impossible task. In order to solve this problem, we present a novel approach, called InFRSS, which consists of a correlation-based phrase matching (CPM) model and a fuzzy compatibility clustering (FCC) model. CPM can detect RSS news articles containing phrases that are the same as well as semantically alike, and dictate the degrees of similarity of any two articles. FCC identifies and clusters non-redundant, closely related RSS news articles based on their degrees of similarity and a fuzzy compatibility relation. Experimental results show that (i) our CPM model on matching bigrams and trigrams in RSS news articles outperforms other phrase/keyword-matching approaches and (ii) our FCC model generates high quality clusters and outperforms other well-known clustering techniques.
Query-driven indexing for scalable peer-to-peer text retrieval
Authors: Gleb Skobeltsyn, Toan Luu, Ivana Podnar arko, Martin Rajman, Karl Aberer
Venue: Future Generation Computer Systems (2009)

In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network. Our indexing strategy is based on two important properties: (1) the generated distributed index stores posting lists for carefully chosen indexing term combinations that are frequently present in user queries, and (2) the posting lists containing too many document references are truncated to a bounded number of their top-ranked elements. These two properties guarantee acceptable latency and bandwidth requirements, essentially because the number of indexing term combinations remains scalable and the posting lists transmitted during retrieval never exceed a constant size. A novel index update mechanism efficiently handles adding of new documents to the document collection. Thus, the generated distributed index corresponds to a constantly evolving query-driven indexing structure that efficiently follows current information needs of the users and changes in the document collection. We show that the size of the index and the generated indexing/retrieval traffic remains manageable even for Web-size document collections at the price of a marginal loss in precision for rare queries. Our theoretical analysis and experimental results provide convincing evidence about the feasibility of the query-driven indexing strategy for large scale P2P text retrieval.
Parallax Effect of Rendering on the Surface with Small Detail
Authors: Ronghua Gao, Baocai Yin, Dehui Kong, Huilin Si, Yong Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Although texture mapping is a common technique for adding apparent surface detail to 3-D objects, it lacks the capability to represent the bumpy detail and the motion parallax effect. In this paper, we propose normal vector shift, a simple rendering method to motion parallax effects on a surface with small detail. This method can be enhanced the quality of the rendering result with graphics hardware.