ppxscal/embedding_network huggingface dataset:
On Paradox of Fuzzy Modeling: Supervised Learning for Rectifying Fuzzy Membership Function
Authors: Shaopei Lin
Venue: Artificial Intelligence Review (2005)

The paradox of fuzzy modeling is recognized due to the co-existence of its effectiveness of solving uncertain problems in the real world and the skepticism of its reasonability in membership function. In this paper, a revised membership function by means of supervised machine learning is introduced, in which the membership function curve is revised from the learning data of existing samples. It points that the information from supervised machine learning by samples is in the same argument to the statistic data from observation in the probability model. The formulations of supervised fuzzy machine learning by samples for revising the membership function are presented, and satisfactory results by the revised membership function compared with the experimental data are shown. It steps forward in promoting the pragmatic application of fuzzy methods in real world problems.
Location-Based-Service Roaming Based on Web Services
Authors: Chun-Te Wu, Hsing Mei
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Due to the rapid growth of personal mobile communication devices, more and more wireless mobile applications are developed. Location-based mobile application, one of the wireless mobile applications, will become the future trend. However, the application execution environment is not complete. How to integrate the services among multiple telecommunication service providers? How to support the original location-based services for the mobile roaming users? This project is aimed at solving these problems efficiently. This paper proposes to integrate the roaming services into web services infrastructure. In this case, the mobile users could get the location-based service during roaming. Integrating the location-based application into the web services will also solve the mobile roaming problem.
Bombardier Flexjet Significantly Improves Its Fractional Aircraft Ownership Operations
Authors: Richard Hicks, Richard Madrid, Chris Milligan, Robert Pruneau, Mike Kanaley, Yvan Dumas, Benoit Lacroix, Jacques Desrosiers, François Soumis
Venue: Interfaces (2005)

The fractional aircraft market is the fastest growing segment of the business aircraft industry. A fractional aircraft operation is complex--essentially an unscheduled airline in a constantly changing environment. Bombardier Flexjet implemented a comprehensive three-module optimization system to simultaneously maximize its use of aircraft, crews, and facilities. AD OPT Technologies designed the modules, using the GENCOL optimizer developed at GERAD, which employs a column-generation approach to decompose large-scale mixed-integer nonlinear programming problems. Since inception, the project has generated savings in excess of $54 million with projected additional savings of $27 million annually, primarily by lowering crew levels (20 percent), aircraft inventory (40 percent), and supplemental charter aircraft usage (five percent) while increasing aircraft utilization (10 percent). The quality of customer service has remained consistently high, with significant reduction in supply.
Evaluation results for the Talk'n'Travel system
Authors: David Stallard
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe and present evaluation results for Talk'n'Travel, a spoken dialogue language system for making air travel plans over the telephone. Talk'n'Travel is a fully conversational, mixed-initiative system that allows the user to specify the constraints on his travel plan in arbitrary order, ask questions, etc., in general spoken English. The system was independently evaluated as part of the DARPA Communicator program and achieved a high success rate.
Dynamic Key Generations for Secret Sharing in Access Structures
Authors: Chu-Hsing Lin, Wei Lee, Chien-Sheng Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In a secret sharing scheme based upon access structures, each group has an authorization and only the participants who stayed in an authorized access structure can recover the secret key. In this paper, we proposed an efficient scheme for secret sharing based upon access structures. We use one-way hash functions to reduce the cost of secret sharing scheme. The presented scheme is easy and efficient, so it is suitable for many real applications.
Proportional degradation services in wireless&#x002F;mobile adaptive multimedia networks: Research Articles
Authors: Yang Xiao, Haizhon Li, C. L. Philip Chen, Bin Wang, Yi Pan
Venue: Wireless Communications Mobile Computing (2005)

Adaptive multimedia services are very attractive since resources in wireless&#x002F;mobile networks are relatively scarce and widely variable, and more importantly the resource fluctuation caused by mobility and channel fading can be mitigated using adaptive services. Therefore, there are extensive research activities on Quality of Service (QoS), call admission control, as well as bandwidth degradation and adaptation for adaptive multimedia services in wireless&#x002F;mobile networks in recent years. However, fairness of bandwidth degradation has largely been ignored in previous work and remains an important issue in adaptive multimedia service provisioning. In this paper, we propose and study proportional degradation service provisioning in wireless&#x002F;mobile networks that offer multiple classes of adaptive multimedia services. The proposed proportional degradation fairness model guarantees the proportional bandwidth degradation among different classes of services. Two proportional degradation scenarios are studied in this paper. In the first scenario, we study the proportional degradation provisioning with two QoS parameters for adaptive multimedia: the degradation ratio (DR) and the degradation degree (DD). In the second scenario, we study the proportional degradation provisioning with a new QoS parameter for adaptive multimedia: the degradation area (DA). For each scenario, based on the QoS parameters, proportional degradation adaptation algorithms are proposed to approximate the proportional degradation model, to fairly adapt calls' degradations, to utilize the system resource efficiently, as well as to optimize QoS parameters. Performance studies show that in the first scenario, proportional DR has been achieved very well, whereas proportional DD has not been well achieved. In other words, DR outperforms DD in terms of proportional degradation. In the second scenario, proportional DA has been well achieved. Furthermore, bandwidth resources have been efficiently utilized and DA has been minimized. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Cornucopia of Perl Techniques
Authors: Haoyang Che
Venue: IEEE Distributed Systems Online (2005)

A review of Web, Graphics and Perl/Tk, by Jon Orwant.
Online Learning of Probabilistic Appearance Manifolds for Video-Based Recognition and Tracking
Authors: Kuang-Chih Lee, David Kriegman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents an online learning algorithm to construct from video sequences an image-based representation that is useful for recognition and tracking. For a class of objects (e.g., human faces), a generic representation of the appearances of the class is learned off-line. From video of an instance of this class (e.g., a particular person), an appearance model is incrementally learned on-line using the prior generic model and successive frames from the video. More specifically, both the generic and individual appearances are represented as an appearance manifold that is approximated by a collection of sub-manifolds (named pose manifolds) and the connectivity between them. In turn, each sub-manifold is approximated by a low-dimensional linear sub-space while the connectivity is modeled by transition probabilities between pairs of sub-manifolds. We demonstrate that our online learning algorithm constructs an effective representation for face tracking, and its use in video-based face recognition compares favorably to the representation constructed with a batch technique.
Asynchronous Peer-to-PeerWeb Services and Firewalls
Authors: Denis Caromel, Alexandre di Costanzo, Dennis Gannon, Aleksander Slominski
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

In this paper we test the suitability of Java to implement a scalable Web Service that solves a set of problems related to peer-to-peer interactions between Web Services that are behind firewalls or not generally accessible. In particular we describe how to enable reliable and long running conversations through firewalls betweenWeb Service peers that have no accessible network endpoints. Our solution is to implement in Java a Web Services Dispatcher (WSD) that is an intermediary service that forwards messages and can facilitate message exchanges by supporting SOAP RPC over HTTP and WS-Addressing for asynchronous messaging. We describe how Web Service clients that have no network endpoints, such as applets, can become Web Service peers by using an additional message store-and-forward service ("mailbox"). Then we conduct a set of experiments to evaluate performance of Java implementation in realistic Web Service scenarios, involving intercontinental tests between France and the US.
Efficient Key Management Based on the Subset Difference Method for Secure Group Communication
Authors: Yuichi Nakamura, Hiroaki Kikuchi
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

A new algorithm for efficient key management for secure group communication in wireless ad hoc network with mobile nodes is presented. In order to address the dynamic receiver update operations such as leave or join, the sub-set difference (SD) method proposed by Naor et al. is introduced. The SD method allows senders to reduce drastically the size of ciphertext to be sent to 2r - 1 using a pseudo random number generator, where r is the number of revoked users (who leave the group). In the SD method, the subsets of authorized users are represented by some differences of two subsets such that i covers valid users and j excludes the revoked users in i. To have all subsets (i, j) necessary to cover all valid users in a tree, a sender has to test all possible combinations of revoked users. A naive exhaustive search for the purpose takes O(r³) time. This is a drawback of the SD method. Hence, to address the issue for finding the cover, we propose a new efficient algorithm to reduce the cost up to O(r log r log n) by introducing the technique for indexing nodes to be dealt with in the necessary subsets. In addition, we implement the proposed algorithm and demonstrate the performance in terms of processing time in this paper.
The "power" of communication
Authors: Pradip Bose
Venue: IEEE Micro (2005)

Welcome to IEEE Micro's first issue of 2005. Like last year, we begin with a theme issue on Hot Interconnects. In addition to this main theme, the issue also contains two other important articles dealing with mainstream microprocessor architectures.
BatchFlow: a method and notation to visualize RDBMS batch jobs
Authors: Ananth Kendapadi, Matt Gandolfo, Amitosh Shukla
Venue: ACM SIGSOFT Software Engineering Notes (2005)

In a typical IT division of a large enterprise, there are a significant number of batch jobs that process data in relational database systems and flat files. These jobs may range from those that are run once in a year to those that are run every hour or every few minutes. While there are many notations available to represent a relational database schema including the ER model [1], it appears that there is no good visual notation to represent the jobs themselves. To some extent, this problem can be addressed by using flowcharts, UML sequence diagrams, and operations summary matrix. However, these notations and representations do not leverage the fact that most of the operations in a batch job are usually a relational select/insert/update/delete operation on a relational table, or a read/write operation on a file. In this paper, we introduce a method and notation that we call BatchFlow. This notation can help organizations in visualizing and communicating the batch job designs at a high level.
Toward View-Invariant Representations of Object Structure Learned Using Object Constancy Cues in Natural Movies
Authors: Jeffrey B. Colombe
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

An approach to learning view-invariant object representations was explored based on the learning of 'legal' or naturalistic view transformations in time, learned from the statistical properties of natural movies. A simple cell layer responded to localized oriented image structure, and a complex cell layer learned to respond to those subsets of simple cells with the strongest tendencies to trade off activity with each other in response to movement of thevisual stimulus. Tradeoffs between simple cells were strongest in response to same-orientation translation, and fell off rapidly with changes in orientation. The local complex cell responses thus became insensitive to typical object motion, evidenced by broadening of response to stimulus phase, while remaining sensitive to local object form. The model makes predictions about synaptic learning rules in complex cells, and mechanisms of successive view-invariance in the primate ventral stream.
High Performance Derivative-Free Optimization Applied to Biomedical Image Registration
Authors: Mark P. Wachowiak, Terry M. Peters
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, deterministic, derivative-free optimization algorithms are parallelized and adapted for image registration. DIRECT (dividing rectangles) is a global technique for linearly bounded problems, and the multidirectional search (MDS) is a local method. Unlike many other deterministic optimization techniques, DIRECT and MDS allow coarse-grained parallelism. The performance of DIRECT, MDS, and hybrid methods using a fine-grained parallelization of Powellýs method for local refinement, are compared. Experimental results show that DIRECT and MDS are robust, and can greatly reduce computation time in parallel implementations.
Essentially optimal computation of the inverse of generic polynomial matrices
Authors: Claude-Pierre Jeannerod, Gilles Villard
Venue: Journal of Complexity (2005)

We present an inversion algorithm for nonsingular n × n matrices whose entries are degree d polynomials over a field. The algorithm is deterministic and, when n is a power of two, requires O ∼ (n3d) field operations for a generic input; the soft-O notation O∼ indicates some missing log(nd) factors. Up to such logarithmic factors, this asymptotic complexity is of the same order as the number of distinct field elements necessary to represent the inverse matrix.
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Authors: Frances Y. Kuo, Ian H. Sloan
Venue: Journal of Complexity (2005)

We study the worst-case error of quasi-Monte Carlo (QMC) rules for multivariate integration in some weighted Sobolev spaces of functions defined on the product of d copies of the unit sphere Ss ⊆ Rs+1. The space is a tensor product of d reproducing kernel Hilbert spaces defined in terms of uniformly bounded 'weight' parameters λd,j for j = 1, 2, ....., d. We prove that strong QMC tractability holds (i.e. the number of function evaluations needed to reduce the initial error by a factor of ε is bounded independently of d) if and only if lim supd →∞Σj=1dγd,j < ∞; and tractability holds (i.e. the number of function evaluations grows at most polynomially in d) if and only if lim supd→∞Σj=1d=γd,j/log(d + 1) < ∞. The arguments are not constructive.
A Constructive Approach to Creating A Method for Generating Images
Authors: Kei Ohnishi, Kaori Yoshida
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper proposes a constructive approach to creating a method for generating images, which acquires mechanisms to draw images that users provide. The constructive approach relies on a combination of production rules and an optimization technique. The method realized based on the concept of the constructive approach combines simple production rules for cellular automata with a genetic algorithm. The realized method is applied to creating methods for generating simple binary images, and the results show that the proposed approach is capable of acquiring mechanisms to draw given images.
From function to context to form: precedents and focus shifts in the form creation process
Authors: John Restrepo, Henri Christiaans
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In design, the form creation process involves imagining, seeing and drawing. Translating the vague and imprecise initial ideas into sketches requires significant ability, and in this process, images of existing products (precedents) are a welcomed aid. Searching for them, however, is difficult, because it requires either exhaustive browsing or verbalization of the ideas to be able to use search engines.This paper presents an approach that uses images as query seeds instead of keywords called Query by Example (QBE). This approach is tested through an empirical study. It shows that the approach is a significant step into helping designers satisfy their visual information needs. It also shows that, as designers change their focus from function to context to form, their way of expressing their information needs changes. It concludes suggesting ways of improving both current systems and the QBE software tested.
TRW: description of the DEFT system as used for MUC-5
Authors: William W. Noah, Rollin V. Weeks
Venue: Proceedings of the 5th conference on Message understanding (1993)

For the past three years, TRW has been developing a text analysis tool called DEFT--Data Extraction from Text. Based on the Fast Data Finder (FDF), DEFT processes large volumes of text at very high speeds, identifying patterns which serve as indicators for the presence of relevant objects, relationships, or concepts in the data. These indicators are processed by a series of system-supplied utilities or custom-written functions which refine the data and re-formulate it into frames which can be presented to a user for review, editing, and submission to a downstream application or database.
Simulation of Real-Time Systems: An Object-Oriented Approach Supported by a Virtual Reality- Based Tool
Authors: Tereza Goncalves Kirner, Claudio Kirner
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

This article intends to demonstrate the applicability and usefulness of Virtual Reality (VR) technology to support Real-Time Systems (RTS) simulations, as a form to evaluate the correctness of such systems. The Virtual Reality SIMulation (VR-SIM), a tool which incorporates VR modeling resources, is presented. This tool offers support to simulate the behavior of RTS, checking the scheduling of processes and timing constraints. The main conceps of RTS, simulation and VR are presented, the VR-SIM architecture and functionality are described and a RTS example from the industrial area is specified and simulated. Aspects of design and implementation of the tool, following an object-oriented approach, are discussed.
AC-XML documents: improving the performance of a web access control module
Authors: Barbara Carminati, Elena Ferrari
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

Protecting information over the Web is today becoming a primary need. Although many access control models have been so far proposed to address the specific protection requirements of the web environment, no comparable amount of work has been done for finding efficient techniques for performing access control. We believe that the availability of techniques for speeding-up access control is a key issue to make an access control model widely acceptable. This is particularly crucial in an environment such as the web, characterized by thousands of users and thousands of documents. For these reasons, in this paper we propose a technique for speeding-up access control, which can be applied to credential-based access control models. We propose a data structure that keeps track of the policies that apply to the various portions of a data source, and which does not require the scanning of the policy base for performing access control. In the paper, besides giving the algorithms for building such data structure and for performing access control, we present a complexity analysis of the proposed approach, which demonstrates the benefits with traditional methods.
A new algorithm for meromorphic Nevanlinna-Pick interpolation
Authors: Christer Glader, Mikael Lindstr&#x00f6;m
Venue: Numerische Mathematik (2005)

Let D be be the open unit disc, H&#x221e;0 the space of all bounded analytic functions in D and H&#x221e;k the set of all functions of the form f(z)/(z&#x2212;z1)...(z&#x2212;zk) where z1,...,zk &#x2208; D and f &#x2208; H&#x221e;0. Given {z1,...,zn},{w1,...,wn}, where zi &#x2208;D,wi &#x2208; ** and zi&#x2260;zj if i&#x2260;j, we show for 0&#x2264;k&#x2264;n&#x2212;1, under certain assumptions, how to construct the unique interpolating function Bk&#x2208;H&#x221e;k, Bk(zj)=wj, of minimal essential supremum norm on &#x2202;D by solving an eigenvalue problem defined by the interpolation data. The function Bk is a scaled quotient of two finite Blaschke products.
Review of "TEX and METAFONT, New Directions in Typesetting by Donald Knuth", Digital Press and the American Mathematical Society.
Authors: Keith Price
Venue: Issue 71 (April 1980) (1980)

TEX and METAFONT, New Directions in Typesetting consists of three parts each of which is self-contained. First is "Mathematical Typography," a Gibbs Lecture that Dr. Knuth presented to the annual meeting of the American Mathematical Society. This gives an overview of both TEX and METAFONT and puts them in perspective. Part 2 is a oomplete description of the TEX typesetting system. The last part is a similar description of METAFONT.
Our 2004 Reviewers
Authors: Warren Harrison
Venue: IEEE Software (2005)

This article expresses the magazine's deep appreciation for the efforts of all those reviewers who participated in peer review last year (from 1 January to 16 November 2004). Reviewers' names and affiliations are listed.