ppxscal/embedding_network huggingface dataset:
Fuzzy control of two-station queueing networks with two types of customers
Authors: Runtong Zhang, Yannis A. Phillis
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper considers tandem two-station queueing networks with two types of customers. Firstly, we examine a model where type 1 customers visit station 1 only while type 2 customers visit both stations in sequence. Each station has a single server and unlimited buffer capacity. The service rate in station 1 is variable. The cost depends on the queue length and selected rate. The objective is to dynamically route customers of both types to station 1 and choose the service rate, based on the state of the system, so as to minimize the average cost over an infinite horizon. Secondly, we examine a system in which station 1 has one server, station 2 two servers, and the buffers have infinite capacity. Two types of customers are first served at station 1 and subsequently proceed to the buffer of a given server according to type in station 2. A reward is earned whenever station 1 accepts a customer and a holding cost is incurred by a customer in buffer at station 2. The objective is to dynamically select the type of customer to be next served at station 1 so as to maximize the average benefit. Customer routing, service rate selection, and flow control are considered simultaneously. We use fuzzy control to solve these complex problems. Simulation shows that the approach is efficient.
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
Authors: To-Yat Cheung
Venue: IEEE Transactions on Software Engineering (1983)

This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depth-first search, and breadth-first search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depth-first search, the largest-augmentation search and breadth-first search. The complexities of these methods are found to be 0(f*|A|), 0((l + logM/(M-1)f*|V| |A|) and O(|V|6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, |V| is the number of vertices, and |A| is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation.
Vehicle Routing in a Refuse Collection System: a Case Study
Authors: Jae-Dong Kim, Hyun-Seon Choi, Dong-Ho Lee
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Refuse collection is an activity rendering used products or wastes and moving them to some points where further treatment is taken care of. This paper addresses the vehicle routing problem occurred in a refuse collection area, Seoul, South Korea. The vehicle routing problem considered in this case study is the problem of determining the vehicle routes that satisfy the demand at each collection point while satisfying the vehicle capacity for the objective of minimizing the total distance traveled. Unlike the ordinary deterministic version of the problem, we consider the problem with stochastic demand at each collection point. Therefore, the vehicle capacity may be violated at random. Two types of solution algorithms, deterministic and stochastic ones, are suggested. To show the performances of the algorithms, simulation experiments were done on the case data, and the results show that our algorithms significantly improve the conventional method.
Study on Method of Association Knowledge Discovery for Scheme Design Based on Constraint
Authors: Jingmin Li, Jin Yao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In order to solve the problem that scheme design parameters are various, the relationships among parameters are complicated and design knowledge acquisition is difficult, the process and mathematics expression of scheme design is analyzed. Then a method of association knowledge discovery is put forward, in which design attributes are taken as item sets, associated relationship among them are taken as analyzing target and domain knowledge is taken as constraint to control mining process. The expression and application of domain knowledge is investigated. A case study is given to illustrate that the method proposed is valid and practicable and the research has an important significance for the reuse design knowledge and design cases
The capacity factors of a network
Authors: Haibin Kan, Xin Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In the paper, we first investigate some properties of capacity factors of a point-to-point network, then give a new upper bound for the maximal cardinality of capacity factors, which is better than the bound in [3]. Finally, we give two definitions of the vertex capacity factors, and present a close relation between the vertex capacity factors and the edge capacity factors.
Multiniche crowding in genetic algorithms and its application to the assembly of dna restriction-fragments
Authors: Walter Cedeòo, V. Rao Vemuri, Tom Slezak
Venue: Evolutionary Computation (1994)

The determination of the sequence of all nucleotide base-pairs in a DNA molecule, from restriction-fragment data, is a complex task and can be posed as the problem of finding the optima of a multimodal function. A genetic algorithm that uses multiniche crowding permits us to do this. Performance of this algorithm is first tested using a standard suite of test functions. The algorithm is next tested using two data sets obtained from the Human Genome Project at the Lawrence Livermore National Laboratory. The new method holds promise in automating the sequencing computations.
Evaluating a Remote Batch Processing System
Authors: L. Amiot, N. K. Natarajan, R. A. Aschenbrenner
Venue: Computer (1972)

The high cost of modern remote communications systems dictates optimum utilization of such facilities. Design and performance evaluation of these systems must not be left to intuitive or heuristic reasoning; instead, formal procedures, both analytic and empirical, must be developed to provide well-utilized, high-performance systems. To this end a large number of techniques1,2 have been developed and emplopyed in the recent past. Among these are hardware and software monitoring, simulation, analytical modeling, and decision-theoretic approaches.
Developing Methods to Train Neural Networks for Time-Series Prediction in Environmental Systems
Authors: Jin Liu, Yongliang Shi, Ning Fang, Keqing He
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper proposes the local interaction method to train neural networks for predicting future variable values of environmental system. Time-series data including soil, stream water and climatic variables were measured hourly over half of a year at two observation spots in Qingpu district, 45 kilometers west to Shanghai city. Three different methods, including our biologically plausible method, have used the data sets to train neural networks. The temporal pattern recognition capabilities for these methods were compared. Our method was proved more competitive than the other two traditional methods in using large data sets to detect patterns and predict events for complex environmental systems.
EDIF: A Mechanism for the Exchange of Design Information
Authors: John Crawford
Venue: IEEE Design Test (1985)

The need for a standard format for the interchange of electronic design information has become critical. Past efforts to standardizehave failed or have only partially succeeded for a variety of reasons. The proponents of four such efforts formed a committeein late 1983 to cull the best from their previous work and propose a unified format as a standard. The Electronic Design InterchangeFormat, EDIF, initially targets information exchange between designer and foundry. Macro cells, net lists, schematics, layoutinformation, and stimulus/response information can be expressed in EDIF version 1.0. As the original committee continues itsdevelopment activity, several subcommittees of experts address behavioral description, testing, technology, procedural layout,and printed circuit boards.
The Constructive Methods and Numerical Results for Approximation of Neural Networks
Authors: Ruyue Yang, Xing Pan, Feilong Cao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Neural networks are widely used in many applications including astronomical physics, image processing, recognition, robotics, and automated target tracking, etc. Their ability to approximate arbitrary continuous functions is the main reason for this popularity. The authors of this paper show by constructive methods that for any continuous function f on [a, b], the function can be approximated by a feedforward network with one hidden layer of sigmoidal neurons, and the first order modulus of continuity is used to estimate the approximation error. In particular, when the activation functions of hidden layer are satlin function, we give the constructive proofs for the neural network to reach the second order modulus of continuity result. Using the univariate constructive technique of the neural network, we present a multivariate interpolation neural network. Some numerical results are given to demonstrate the theoretical results.
The science of breeding and its application to the breeder genetic algorithm (bga)
Authors: Heinz Mühlenbein, Dirk Schlierkamp-Voosen
Venue: Evolutionary Computation (1993)

The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. The science of breeding is based on advanced statistical methods. In this paper a connection between genetic algorithm theory and the science of breeding is made. We show how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA. Selection, recombination, and mutation are analyzed within this framework. It is shown that recombination and mutation are complementary search operators. The theoretical results are obtained under the assumption of additive gene effects. For general fitness landscapes, regression techniques for estimating the heritability are used to analyze and control the BGA. The method of decomposing the genetic variance into an additive and a nonadditive part connects the case of additive fitness functions with the general case.
Appearance Based Models in Document Script Identification
Authors: T. N. Vikram, D. S. Guru
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we employ appearance based models for document script identification. They are employed to identify scripts at both paragraph and word level. Elaborate experimentation has been conducted which has revealed that they are robust enough to handle highly confusing scripts and their performance does not degrade drastically even in the presence of noise. A generic script identification has been attempted, to identify both Asian and European scripts by considering a dataset of twenty different languages.
The material allocation problem in the steel industry
Authors: H. Yanagisawa
Venue: IBM Journal of Research and Development (2007)

A major challenge in the initial stage of production planning for the steel industry is the material allocation problem (MAP): finding the best match of orders and materials (steel slabs and coils) with respect to an objective function that takes into account order due dates, preferences for matches, allocated weights, surplus weights of materials, and other factors. The MAP is NP-hard and is difficult to solve optimally. We apply a local search algorithm for the MAP that includes rich moves, such as ejection chain methods. Our algorithm is yielding considerable cost reduction in a real steelworks. In particular, a two-variable integer programming (TVIP) neighborhood search technique contributed to the cost reductions. TVIP defines a neighborhood space for the local search as a two-variable integer programming problem and efficiently finds a solution in the neighborhood. By using TVIP, the number of small batches of surplus material can be successfully reduced.
Symbolic Testing and the DISSECT Symbolic Evaluation System
Authors: W. E. Howden
Venue: IEEE Transactions on Software Engineering (1977)

Symbolic testing and a symbolic evaluation system called DISSECT are described. The principle features of DISSECT are outlined. The results of two classes of experiments in the use of symbolic evaluadon are summarized. Several classes of program errors are defined and the reliability of symbolic testing in finding bugs is related to the classes of errors. The relationship of symbolic evaluation systems like DISSECT to classes of program errors and to other kinds of program testing and program analysis tools is also discussed. Desirable improvements in DISSECT, whose importance was revealed by the experiments, are mentioned.
A blended learning approach to teaching
Authors: Karen Fraser
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

With an increase in the availability of technology in teaching and learning and an increasingly sophisticated 'audience', Higher Education institutions need to rethink the traditional lecture as the sole means of delivering information. It is evident that today's students are used to huge amounts of stimulation from many sources including computer games, the internet, interactive television and even their mobile phones. The result is that they have high expectations of information and technology. Consequently, posting lecture related links onto an academic's home page or an institutional VLE together with some PowerPoint slides is not enough to capture their attention or interest. As the title suggests, this paper will focus on the development of a blended learning approach to a specific module (Introduction to Multimedia). There are a few concessions to the module and the associated cohort (1st year and 2nd year) but effectively the approach could be applied to most modules. The paper looks at the web site content from a pedagogical viewpoint, from the student experience and consequent feedback, and also from a re-useable standpoint. It also presents the findings of a pilot project where student involvement and satisfaction were measurable using feedback and engagement.
Cooperative Object Tracking with Multiple PTZ Cameras
Authors: I. Everts, N. Sebe, G. A. Jones
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Research in visual surveillance systems is shifting from using few stationary, passive cameras to employing large heterogeneous sensor networks. One promising type of sensor in particular is the Pan-Tilt-Zoom (PTZ) camera,which can cover a potentially much larger area than passive cameras, and can obtain much higher resolution imagery through zoom capacity. In this paper, a system that can track objects with multiple calibrated PTZ cameras ina cooperative fashion is presented. Tracking and calibration results are combined with several image processing techniques in a statistical segmentation framework, through which the cameras can hand over targets to each other. A prototype system is presented that operates in real time.
A Survey of the State of the Art of Design Automation
Authors: M. A. Breuer
Venue: Computer (1981)

Automated layout of PCBs and LSI chips is a successful operation; testing is an active area of development. DA tools, however, are seldom used in logic design.
Parallel Environment for DEVS and Cell-DEVS Models
Authors: Qi Liu, Gabriel Wainer
Venue: Simulation (2007)

Discrete Event System Specification (DEVS) is a sound formalism to describe generic dynamic systems in a hierarchical and modular way. Cell-DEVS is a DEVS-based formalism intended to model compleX physical systems as cell spaces. This work presents new techniques for eXecuting DEVS and Cell-DEVS models in parallel and distributed environments based on the WARPED kernel, an implementation of the Time Warp protocol. The optimistic simulator PCD++, built as a new simulation engine for CD++, is a toolkit that implements the DEVS and Cell-DEVS formalisms. We redesign algorithms in CD++ to carry out optimistic simulations using a non-hierarchical approach that reduces the communication overhead. The message-passing organization is analyzed using a high-level abstraction referred to as wall clock time slice. We propose a two-level user-controlled state-saving mechanism to achieve efficient and fleXible state saving at runtime. Various optimization strategies are applied to PCD++ and their effects are analyzed quantitatively, including a risk-free message type-based state-saving strategy to reduce the number of states saved during the simulation significantly, and a one log file per node strategy to break the bottleneck caused by file I/O operations. It is shown that PCD++ markedly outperforms other alternatives and considerable speedups can be achieved in parallel and distributed simulations.
Data Hiding for Binary Documents Robust to Print-Scan, Photocopy and Geometric Distortions
Authors: Hae Yong Kim, Joceli Mayer
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

This paper presents a data hiding technique for printed bicolor documents. It inserts tiny dots, hardly noticeable at normal reading distance, to embed the message. For message extraction, we employ autocorrelation and tiny registration dots to rectify geometric distortions. This technique is robust to distortions resulting from print-scan operations, good quality photocopies, affine transformations and scribblings/ stains on the paper. The technique can be applied to documents with large white (or black) areas and they may present characters, drawings, schematics, diagrams, cartoons, but not halftones. The technique is intended to be neither a robust watermark (because any filtering can remove the dots) nor a covert communication (because the dots are perceptible at short distance). Nevertheless, when combined with a perceptual hashing and a cryptography protocol, it can be applied as semi-fragile authentication watermarking for hardcopy two-tone documents. In some situations, the utilization of the proposed system can substitute the use of notarial authenticated photocopies.
Combining local belief from low-level primitives for perceptual grouping
Authors: Nicolas Zlatoff, Bruno Tellez, Atilla Baskurt
Venue: Pattern Recognition (2008)

Segmentation is usually unable to cope with artifacts due to slight change in lighting conditions or object occlusion for instance. That is why perceptual grouping is often used to overcome segmentation's lacks. This refers to the ability of human visual system to impose structure and regularity over signal-based data. Gestalt psychologists have exhibited some properties which are used during perceptual grouping, such as proximity, continuity, or symmetry. Then, some implementations of these have been proposed in computer vision. However, most of these works rely on contour-based primitives. Besides, they often use one single property to merge close regions, which may not be sufficiently robust. We propose a new framework for bottom-up perceptual grouping, which relies on a region-based segmentation. It allows us to use region or contour information, when it is the most suitable. Besides, we propose to trigger a grouping when several Gestalt properties support it. This could increase the robustness of perceptual grouping. We use Dempster-Shafer theory to combine the influence of several Gestalt properties over each grouping, as it is especially designed for this. We also present numerous promising results, which show the efficiency of our approach.
Restrictions imposed by the fuzzy extension of relations and functions
Authors: Babak N. Araabi, Nasser Kehtarnavaz, Caro Lucas
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

The fuzzy extension principle has been widely used to extend the domain of mathematical functions and relations from elements of a referential set to fuzzy subsets of that referential set. However, there are restrictions associated with the fuzzy extension principle. This paper addresses the question how restricted is the family of "fuzzy set to fuzzy set mappings" obtained by the fuzzy extension of non-fuzzy functions and relations, as compared to the general family of all possible fuzzy set to fuzzy set mappings. A theorem is presented, with the necessary and sufficient conditions, to determine this restriction for the fuzzy extension of non-fuzzy relations and point-valued functions. It is shown that the fuzzy extension principle would impose a restriction on extended fuzzy set to fuzzy set mappings, which is similar to the linear restriction for point-valued functions. Moreover, the extension of mappings from a set-valued domain to a fuzzy set-valued domain is discussed. It is shown that this extension is well-behaved only for those mappings which preserve subsethood order. Another theorem with the necessary and sufficient condition has been proved to determine the imposed restriction during the fuzzy extension of subsethood order preserving set to set mappings. The two extensions have been compared and several examples are provided.
A New Fuzzy Arithmetic for Discrete Fuzzy Numbers
Authors: Guixiang Wang, ChengLin Wen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, using the representations of discrete fuzzy numbers, we give a new kind of operations of addition and multiplication for discrete fuzzy numbers. Then, we show that the new addition and multiplication keep the closeness of the operation, so they get over the defect that the usual addition and multiplication does not keep the closeness of operation. And we also point out that when the usual addition of two discrete fuzzy numbers is still a discrete fuzzy number, the usual addition and the new addition are identical, and so are the usual multiplication and the new multiplication.