ppxscal/embedding_network huggingface dataset:
Fuzzy least-squares algorithms for interactive fuzzy linear regression models
Authors: Miin-Shen Yang, Hsien-Hsiung Liu
Venue: Fuzzy Sets and Systems (2003)

Fuzzy regression analysis can be thought of as a fuzzy variation of classical regression analysis. It has been widely studied and applied in diverse areas. In general, the analysis of fuzzy regression models can be roughly divided into two categories. The first is based on Tanaka's linear-programming approach. The second category is based on the fuzzy least-squares approach. In this paper, new types of fuzzy least-squares algorithms with a noise cluster for interactive fuzzy linear regression models are proposed. These algorithms are robust for the estimation of fuzzy linear regression models, especially when outliers are present. Numerical examples are given to detail the effectiveness of this approach.
A Virtual Clustering Approach for Routing Problems in Telecommunication Networks
Authors: Michael R. Bartolacci, S. David Wu
Venue: INFORMS Journal on Computing (1998)

We propose an adaptable routing scheme for telecommunication networks based on the notion of virtual clustering. Virtual clustering logically reconfigures the network topology in a periodic basis according to the traffic requirements in the network. This temporary topology configuration imposes restrictions on the potential paths between certain groups of source?destination node pairs, thus regulating and balancing the global network traffic while maintaining sufficient local flexibility for real-time routing. The proposed routing scheme can be implemented in an established telecommunication environment where the actual routing of network traffic is conducted by an existing dynamic routing algorithm, while the routing tables are preprocessed by the current virtual clustering configuration. We develop a virtual clustering algorithm using problem space search proposed by Storer, Wu and Vaccari (1992, New Search Spaces for Sequencing Problems with Applications to Job Shop Schedule, Management Science 38, 1495-1509; 1996. Local Search in Problem and Heuristic Space for Job Shop Scheduling, ORSA Journal on Computing 7, 453-465). The algorithm iteratively evaluates clustering solutions and its potential impact to routing performance by perturbation of the traffic requirement matrix. The proposed routing scheme is tested through intensive computational experiments on randomly generated geometric networks, and on PREPNET, a real-world subnetwork on the Internet. Using Monte Carlo simulation, we compare the proposed routing scheme to centralized routing and decentralized asynchronous routing. Computational results show that the proposed approach significantly outperforms these traditional schemes under dynamic traffic fluctuation.
Raw Material Management at Welchs, Inc.
Authors: Edmund W. Schuster, Stuart J. Allen
Venue: Interfaces (1998)

Welch's, a large grape-processing company owned by a grower cooperative, faced complex logistics in planning recipes for products sold in retail stores. The recently installed integrated MRP and cost-accounting systems did not include ways to calculate recipes at optimal cost based on plant-raw-material and capacity constraints. An imbalance of supply and demand further complicated this problem in raw-materials management. The cross-functional team in charge of managing raw materials spent increasing a mounts of time deciding what recipes to use at each plant. We formulated the problem as a linear program model and used spreadsheet optimization to incorporate the model in daily decision making. The company has run the model each month since 1994 to provide senior management with information on the optimal logistics plan. This simple application saved Welch's between $130,000 to $170,000 during the first year.
The control of the pressure for a micropolar fluid
Authors: R. Stavre
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

The subject of this paper is the study of an optimal control problem associated with the motion of a micropolar fluid, with applications in the control of the blood pressure. For a certain regularity of the data, the corresponding regularity of the unknowns is obtained. The existence of a solution for the proposed control problem is established and the necessary conditions of optimality are derived. For obtaining the existence and the regularity of a solution of the adjoint system, which has not a classical form, we proposed a method based on the construction of several functions, which allows us to replace the adjoint system by a divergence free one. The existence, the uniqueness and the regularity of the solution of the adjoint system are then obtained.
Managing Software Quality with Defects
Authors: David N. Card
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Many factors are contributing to an increased practical interest in managing software quality. By this we mean treating software quality as a key dimension of project performance, equal to cost (effort) and schedule. Corporate initiatives based on the CMM [1] and Six Sigma [2] provide two examples of forces promoting interest in quality as a management concern.This presentation describes two common approaches to measuring and modeling softwarequality across the project life cycle so that it can be made visible to management. It discussesexamples of their application in real industry settings. Both of the examples presented comefrom CMM Level 4 organizations.
Simulation bridge: a framework for multi-processor simulation
Authors: G. D. Nagendra, V. G. Prem Kumar, B. S. Sheshadri Chakravarthy
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

Multi-processor solutions in the embedded world are being designed to meet the ever increasing computational demands of the emerging applications. Such architectures comprise two or more processors (often a mix of general purpose and digital signal processors) together with a rich peripheral mix to provide a high performance computational platform. While there are many simulation solutions in the industry available to address the system partitionaing issues and also the verification of HW-SW interactions in these complex systems, there are very few solutions targetted towards the SW application developers' needs.The primary concern of the SW application developers is to debug and optimize their code. Hence, cycle accuracy and performance of the simulation solution becomes the key enablers. Desired observability and controllability of the models are additional careabouts. Secondly, application devlopers are more comfortable at instruction level simulations than they are with RTL or gate level simulation. These specific requirements have a bearing on the choices in the simulation solutions.This paper describes the design of a generic, C based multi-processor instruction set simulator framework in the context of the above parameters. This framework, termed the "simulation bridge", facilitates highly accurate, yet efficient simulation. The SimBridge performs clock correct lock-step simulation of the models in the architecture using a global simulation engine that handles both intra-processor and inter-processor communication in a homogenous fashion. It addresses the multiple key issues of execution control, synchronization, connectivity and communication.The paper concludes with the performance analysis of the SimBridge in an experimental test setup as well as in the Texas Instruments (TI) TMS320C54x-based simulators.
Microstructural investigations on Nd-Fe-B-Cu sintered magnets
Authors: A. Kianvash, K. G. Knochi I. R. Harris
Venue: Iranian Journal of Science and Technology (2001)

To reveal microstructural details in sintered permanent magnets with a composition Nd17Fe765B5Cu15, optical microscopy and analytical transmission electron microscopy (TEM) were employed, supported by electron probe micro-analysis (EPMA), differential thermal analysis (DTA) and thermal magnetic analysis (TMA). To obtain good magnetic properties, a two-step heat treatment was applied to the sintered magnets produced by the hydrogen decrepitaion (HD) process. The microstructure consists of four phases: Nd2Fe14B1(Φ), a Nd-rich (n) phase, a Nd1Cu1-type phase and a phase Nd6Fe13Cu1 (Nd30Fe65Cu). The NdCu-type phase is, together with the Nd-rich phase, part of a binary eutectic and exhibits a homogeneity range in composition, whereas none was found for Nd6Fe13Cu1). Studies by electron and X-ray diffraction disclosed a complicated structure which to date has been impossible to determine.
Forecasting solar cycles with GP
Authors: M. A. Kaboudan
Venue: Second international workshop on Intelligent systems design and application (2002)

Genetic programming is used in this paper to predict cycles of annual sunspot numbers. The procedure described uses two-stage model evolution with turning points. The results indicate that the proposed procedure outperforms all prior identified attempts to forecast sunspot numbers.
Stereotype-based versus personal-based filtering rules in information filtering systems
Authors: Tsvi Kuflik, Bracha Shapira, Peretz Shoval
Venue: Journal of the American Society for Information Science and Technology (2003)

Rule-based information filtering systems maintain user profiles where the profile consists of a set of filtering rules expressing the user's information filtering policy. Filtering rules may refer to various attributes of the data items subject to the filtering process. In personal rule-based filtering systems, each user has his/her own personal filtering rules. In stereotype rule-based filtering systems, a user is assigned to a group of similar users (his/her stereotype) from which he/she inherits the stereotype's filtering profile. This study compares the effectiveness of the two alternative rule-based filtering methods: stereotype-based rules versus personal rules. We conducted a comparison between filtering effectiveness when using the personal rules or when using the stereotype-based rules. Although, intuitively, personal filtering rules seem to be more effective because each user has his own tailored rules, our comparative study reveals that stereotype filtering rules yield more effective results. We believe that this is because users find it difficult to evaluate their filtering preferences accurately. The results imply that by using a stereotype it is possible not only to overcome the problem of user effort required to generate a manual rule-based profile, but at the same time even provide a better initial user profile.
Using large tables on small display devices
Authors: Carolyn Watters, Jack Duffy, Kathryn Duffy
Venue: International Journal of Human-Computer Studies (2003)

The next evolutionary step in wireless Internet information management is to provide support for tasks, which may be collaborative and may include multiple target devices, from desktop to handheld. This means that the information architecture supports the processes of the task, recognizes group interaction, and lets users migrate seamlessly among internet-compatible devices without losing the thread of the session. If users are free to migrate amongst devices during the course of a session then intelligent transformation of data is required to exploit the screen size and input characteristics of the target appliance with minimal loss of task effectiveness.In this paper we first review general characteristics related to the performance of users on small screens and then examine the navigation of full tables on small screens for users in multidevice scenarios. We examine the methodologies available for access to full tables in environments where the full table cannot be viewed in its entirety. In particular, we examine the situation where users are collaborating across platform and referring to the same table of data. We ask three basic questions: Does screen size affect the performance of table lookup tasks? Does a search function improve performance of table lookup based tasks on reduced screen sizes? Does including context information improve the performance of table lookup based tasks on reduced screen sizes? The answers to these questions are important as individual and intuitive responses are used by the designers of small screen interfaces for use with large tables of data. We report on the results of a user study that examines factors that may affect the use of large tables on small display devices. The use of large tables on small devices in their native state becomes important in at least two circumstances. First, when collaboration involves two or more users sharing a view of data when the individual screen sizes are different. Second, when the exact table structure replication may be critical as a user moves quickly from a larger to a smaller screen or back again mid-task. Performance is measured by both effectiveness, correctness of result, and efficiency, effort to reach a result.
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
Authors: Jonathan Eckstein, Michael C. Ferris
Venue: INFORMS Journal on Computing (1998)

This article applies splitting techniques developed for set-valued maximal monotone operators to monotone affine variational inequalities, including, as a special case, the classical linear complementarity problem. We give a unified presentation of several splitting algorithms for monotone operators, and then apply these results to obtain two classes of algorithms for affine variational inequalities. The second class resembles classical matrix splitting, but has a novel "under-relaxation" step, and converges under more general conditions. In particular, the convergence proofs do not require the affine operator to be symmetric. We specialize our matrix-splitting-like method to discrete-time optimal control problems formulated as extended linear-quadratic programs in the manner advocated by Rockafellar and Wets. The result is a highly parallel algorithm, which we implement and test on the Connection Machine CM-5 computer family.
On the bifurcation of large amplitude solutions for a system of wave and beam equations
Authors: Juha Berkovits
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We consider the existence of solutions for linearly coupled system of wave and beam equation with a sublinear perturbation. The main concept is the matrix spectrum which is a natural extension of the usual spectrum. Using the standard 'change of degree' argument we shall find necessary and sufficient conditions for the existence of asymptotic bifurcation with respect to the matrix spectrum both in one parameter and four parameter cases. Obviously the results can be modified for more general systems of partial differential equations.
The independence fractal of a graph
Authors: J. I. Brown, C. A. Hickman, R. J. Nowakowski
Venue: Journal of Combinatorial Theory Series B (2003)

Independence polynomials of graphs enjoy the property of essentially being closed under graph composition (or 'lexicographic product'). We ask here: for higher products of a graph G with itself, where are the roots of their independence polynomials approaching? We prove that in fact they converge (in the Hausdorff topology) to the Julia set of the independence polynomial of G, thereby associating with G a fractal. The question arises as to when these fractals are connected, and for graphs with independence number 2 we exploit the Mandelbröt set to answer the question completely.
Blocking semiovals in PG(2, 7) and beyond
Authors: B. B. Ranson, J. M. Dover
Venue: European Journal of Combinatorics (2003)

Batten (Australas. J. Combin. 22 (2000) 167) stimulated interest in blocking semiovals, sets which are both blocking sets and semiovals. Dover (European J. Combin. 21 (2000) 571) gave a bound on the size of blocking semiovals and presented a family of blocking semiovals of size 3q - 4 valid in PG(2, q) for q ≥ 5.Dover posed the question: how many equivalence classes of blocking semiovals are there in PG(2, 7) and how many of them are members of infinite families? Comprehensive computer searches by the authors found eleven blocking semiovals, up to projective equivalence. We found that at least seven of these blocking semiovals are contained in infinite families. This paper presents those families.We also prove a robust extension theorem: any blocking semioval in a subplane π of a projective plane Π may be extended to a blocking semioval in Π by adding a suitable collection of points.
XML Semantics extension
Authors: Ferenc Havasi
Venue: Acta Cybernetica (2002)

Nowadays one of the best standards for storing structured data is XML. The key idea behind our paper is based on a relationship between XML documents and attribute grammars. This parallel makes it possible to apply techniques of attribute grammars (semantics rules) to the XML environment.We present a new method for extending XML. After a background discussion we formally introduce a way of defining real XML attributes using semantics rules. This allows us to incorporate semantics rules into XML files in such a way that it does not violate the original XML specification and is suitable for compressing using learning. After learning an associated semantics rule file preserves the relationship between attributes.
The influence of ATM on operating systems
Authors: Jonathan M. Smith
Venue: ACM SIGCOMM Computer Communication Review (2002)

The features of ATM offered many attractions to the application community, such as fine-grained multiplexing and high-throughput links. These created considerable challenges for the O.S. designer, since a small protocol data unit size (the 48 byte "cell") and link bandwidths within a (binary) order of magnitude of memory bandwidths demanded considerable rethinking of operating system structure.Using an historical and personal perspective, this paper describes two aspects of that rethinking which I participated in directly, namely, those of new event signalling and memory buffering schemes. Ideas and techniques stemming from ATM network research influenced first research operating systems and then commercial operating systems. The positive results of ATM networking, although indirect, have benefitted applications and systems far beyond the original design goals.
Does "Bait and Switch" Really Benefit Consumers?
Authors: William L. Wilkie, Carl F. Mela, Gregory T. Gundlach
Venue: Marketing Science (1998)

While the field of marketing science has long been interested in the effects of promotional efforts, public policy issues involving illegal marketer fraud and deception have generally not been addressed in this body of work. One key exception to this generalization is a Marketing Science article suggesting that the practice of"bait and switch" may be beneficial to consumers and, furthermore, that the Federal Trade Commission should investigate revising its standards to legitimize this practice (Gerstner and Hess 1990). This finding and recommendation seemed so significant that it is surprising that the recommendation has not, to date, been explored in greater detail. In this paper we further explore the impact of the two components of bait and switch: out of stock and upselling. We do this by using Moorthy's (1993) theoretical modeling framework to systematically extend and assess the Gerstner and Hess model. We find that the previously reported increase in consumer welfare that arises from allowing out-of-stock conditions at retailers is actually due to the utility created by salespersons' explaining product features and benefits, not by the out of stock. Thus, the ramifications of both our legal and modeling analyses are that deceptive bait-and-switch practices result in harm to consumers and should not be legalized. Our paper concludes by proposing worthwhile modeling issues for further exploration. In addition, we suggest that our procedure for analyzing public policy issues (by exploring the confluence of law, consumer behavior, and marketing models) can serve as a useful exemplar for further contributions to public policy by marketing scientists.
A linguistic decision model for promotion mix management solved with genetic algorithms
Authors: F. Herrera, E. López, M. A. Rodríguez
Venue: Fuzzy Sets and Systems (2002)

Promotion activities are those marketing tools that have a fast and direct impact in the target market. Due to this fact, the selection of such activities is an important decision. This contribution attempts to devise a decision process for this problem in conditions of uncertainty, supplying a linguistic decision model for evaluating the satisfaction of the objectives by the potential solutions. The process uses a genetic algorithm to find a good solution in promotion selection, such that it will both accomplish the communication objectives of the company and minimise the invested amount.
Computer simulations of aggregate formation and colloid/polymer mixtures
Authors: S. Stoll
Venue: Systems Analysis Modelling Simulation (2002)

Understanding colloidal aggregate structures and formation is one of the central issues of colloid science and an important topic in many industrial, biological and environmental processes. Owing to the complexity of these mechanisms, aggregate formation is still difficult to investigate experimentally. Computer simulations provide a qualitative and quantitative means of understanding the factors that influence particle-particle interactions by (i) viewing the graphical output throughout the course of the simulation, which is invaluable for revealing the complex series of events that occur in the solution (ii) allowing the calculations of quantitative features that characterize the solution (iii) permitting a systematic alteration of various factors, and consequently the examination of how such factors affect both the kinetics of aggregation and aggregate structures.The object of this paper is to review the basic computational aggregation models of colloidal particles and polymers and their developments. Scaling and fractal concepts allowing the quantitative description of the aggregate structure are introduced and the influence of aggregation mechanisms on the structure of the resulting aggregates is discussed.
Advances in Solving the Multicommodity-Flow Problem
Authors: Richard D. McBride, E. Carrizosa, E. Conde, M. Munoz-Marquez
Venue: Interfaces (1998)

The multicommodity-flow problem arises in a wide variety of important applications. Many communications, logistics, manufacturing, and transportation problems can be formulated as large multicommodity-flow problems. During the last few years researchers have made steady advances in solving extremely large multicommodity-flow problems. This improvement has been due both to algorithmic and to hardware advances. At present the primal simplex method using the basis-partitioning approach gives excellent solution times even on modest hardware. These results imply that we can now efficiently solve the extremely large multicommodity-flow models found in industry. The extreme-point solution can also be quickly reoptimized to meet the additional requirements often imposed upon the continuous solution. Currently practitioners are using EMNET, a primal basis-partitioning algorithm, to solve extremely large logistics problems with more than 600,000 constraints and 7,000,000 variables in the food industry.
Lifted Cover Inequalities for 0-1 Integer Programs: Computation
Authors: Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
Venue: INFORMS Journal on Computing (1998)

We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0Â 1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.