ppxscal/embedding_network huggingface dataset:
On nonlinear equations for fuzzy mappings in probabilistic normed spaces
Authors: Jin-xuan Fang
Venue: Fuzzy Sets and Systems (2002)

In this paper, we introduce the concept of probabilistic Ψ-contractor couple, which simplifies and weakens that of probabilistic Φ-g-contractor given by Cho et al. (Fuzzy Sets and Systems 110 (2000) 115-122). By using this concept, we study the existence and iteration convergence of solutions for set-valued nonlinear operator equations and nonlinear equations of fuzzy mappings in Menger PN-spaces. The results presented in this paper improve and extend the corresponding results of Cho et al. in a sense.
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution
Authors: Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban
Venue: Information and Computation (2002)

We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle PHPncn and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bounds are known. As a consequence to the result about the weak pigeonhole principle, Res(log) is exponentially more powerful than Res(2). Also we prove that Resolution cannot polynomially simulate Res(2) and that Res(2) does not have feasible monotone interpolation solving an open problem posed by Krajícek.
Evolutionary partial differential equations for biomedical image processing
Authors: Alessandro Sarti, Karol Mikula, Fiorella Sgallari, Claudio Lamberti
Venue: Computers and Biomedical Research (2002)

We are presenting here a model for processing space-time image sequences and applying them to 3D echo-cardiography. The non-linear evolutionary equations filter the sequence with keeping space-time coherent structures. They have been developed using ideas of regularized Perona-Malik an-isotropic diffusion and geometrical diffusion of mean curvature flow type (Malladi-Sethian), combined with Galilean invariant movie multi-scale analysis of Alvarez et al. A discretization of space-time filtering equations by means of finite volume method is discussed in detail. Computational results in processing of 3D echo-cardiographic sequences obtained by rotational acquisition technique and by real-time 3D echo volumetrics acquisition technique are presented. Quantitative error estimation is also provided.
The new computing
Authors: Ubiquity staff
Venue: Ubiquity (2002)

Ben Shneiderman on how designers can help people succeed.
A Survey of Mathematical Programming Applications in Integrated Steel Plants
Authors: Goutam Dutta, Robert Fourer
Venue: Manufacturing Service Operations Management (2001)

Mathematical programming techniques were used in the steel industry as early as 1958, and many applications of optimization in steel production have been reported since then. In this survey, we summarize published applications in the largest steel plants by type, including national steel planning, product-mix optimization, blending, scheduling, set covering, and cutting stock.
A Kleene/Büchi-like theorem for clock languages
Authors: Patricia Bouyer, Antoine Petit
Venue: Journal of Automata, Languages and Combinatorics (2001)

We propose in this paper a generalization of the famous Kleene/Büchi's theorem on formal languages, one of the cornerstones of theoretical computer science, to the timed model of clock languages. These languages extend the now classical timed languages introduced by Alur and Dill as a suitable model for real-time systems. As a corollary of our main result, we get a simple algebraic characterization of timed languages recognized by (updatable) timed automata.
Feeling Stressed and Burned Out: a Feminist Reading and Re-Visioning of Stress-Based Emotions Within Medicine and Organization Science
Authors: P. S. Bradley, O. L. Mangasarian, W. N. Street, Debra E. Meyerson
Venue: Organization Science (1998)

This article is written in the spirit of resistance, as a challenge and alternative to what are accepted as neutral, unbiased conceptualizations of stress and burnout within traditional and popular discourse. Findings reported in a previous study suggest that the ways we conceptualize and experience stress and burnout are not inherently neutral, but are shaped by culture and a particular set of dominant themes prevalent in organizational and professional discourse. This article exposes the processes by which some forms of organizational experience and knowledge related to stress and burnout have become dominant, whereas "other" forms have become marginal and suppressed. Through a postmodern feminist reading of stress and burnout as expressed within the medical and organizational discourses, the author reveals how gender acts as an axis of power and meaning that helps sustain dominant and seemingly neutral conceptualizations within the discourses. Building from the feminist reading, she develops a radical reconstruction of the ways organizational participants and theorists could interpret and experience stress related emotions, and discusses the cultural conditions that could produce and sustain such a revision. The reading and revision reveal ways in which experiences of stress and burnout have been shaped and constrained by the dominant discourse and suggest ways social scientists might rewrite those experiences toward more humane ends. Insofar as stress and burnout are among the most common and well-researched topics (and emotions) within the field of organizational behavior, this paper has far-reaching theoretical, epistemological, and practical implications. More generally, the feminist reading and revision open new spaces for other ways of theorizing and argues against the limitations of knowledge and experience imposed by traditional organizational theory and medical discourse.
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Authors: Laura Grigori, Xiaoye S. Li
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of LT and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU_DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.
Inventory of differential items selling at two shops under single management
Authors: S. Kar, A. K. Bhunia, M. Maiti
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Inventory of differential (both good and defective) items purchased in a lot for two shops under a single management is considered here. In the primary shop, the lot is received and separated, only good units are sold and shortages are allowed which are backlogged from the good units specially purchased at the beginning of the next cycle. The separated defective units are continuously trasnsferred and sold at a reduced price from the secondary shop. This inventory model is formulated and illustrated numerically for three scenarios depending upon the time periods of the shops.
The Multiple Connections Multi-Airport Ground Holding Problem: Models and Algorithms
Authors: Lisa Navazio, Giorgio Romanin-Jacur
Venue: Transportation Science (1998)

In recent years air traffic has dramatically increased without a corresponding development of airports. Therefore, airports? limited capacity causes air traffic congestion and consequent expensive delays. The only strategy that can be applied in the short term with low investments aims at the optimal management of present resources; its principal device is Ground Holding, which consists of delaying an aircraft take off whenever it is foreseen it will not land in time because of congestion. We consider a traffic situation with "multiple connections" or "banking," i.e., the situation where some flights are assigned a set of "preceding" flights; no "successive" flight can start until all its preceding flights have landed. The problem consists of distributing delays to flights, so as to minimize the total delay cost, by respecting airport capacity, connections, and time constraints imposed by airlines. We construct an integer linear programming model and we solve it to optimality with CPLEX. Because the computation time is too high (hours) for real-world instances, we propose an alternative heuristic algorithm, which shows a very low computation time (seconds) and acceptable errors when tested on 30 realistic instances with strongly diversified data.
Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms
Authors: R. Bryan Kethley, Bahram Alidaee
Venue: Computers and Industrial Engineering (2002)

In this research the problem of scheduling n jobs to minimize the Total Weighted Late Work (TWLW) is evaluated within the single machine context. As the problem complexity increases, so does the solution complexity, and often the objective is to identify a heuristic or algorithm that may return a near optimal solution. Various scheduling rules, heuristics and algorithms, including the weighted shortest processing rule, a variation of the modified due date rule, a genetic algorithm, neighborhood job search, and space smoothing with neighborhood job search; are empirically evaluated using different parameters to determine the utility of each approach.
Methods for developing flexible strategic information systems: is the answer already out there?
Authors: Alan Eardley, Hanifa Shah, June Lazander-Reed
Venue: Adaptive evolutionary information systems (2003)

This chapter begins by looking at the changing nature of business strategy as flexible strategies become more important in a changing business environment. It then reviews the phenomenon of strategic information systems that support such flexible strategies, and discusses the problems of developing such systems using existing systems development techniques. Some methods and techniques are described that have recently been put forward as possible solutions to these problems, but the main contention of the chapter is that long-standing frameworks, methods and techniques may offer a solution when used in combination. A range of candidate techniques from the business and IT domains is evaluated using a panel of domain experts, and a three-stage method is suggested that uses the chosen techniques in combination. These techniques are well established and in most cases have been used and proven in other contexts for more than a decade, but their application to the development of flexible strategic information systems is new.
Smarandache loops
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache notions (2002)

In this paper we study the notion of Smarandache loops. We obtain some interesting results about them. The notion of Smarandache semigroups homomorphism is studied as well in this paper. Using the definition of homomorphism of Smarandache semigroups we give the classical theorem of Cayley for Smarandache semigroups. We also analyze the Smarandache loop homomorphism. We pose the problem of finding a Cayley theorem for Smarandache loops. Finally we show that all Smarandache loops Ln(m) for n > 3, n odd, varying n and appropriate m have isomorphic subgroups.
Where do helpers look?: gaze targets during collaborative physical tasks
Authors: Susan R. Fussell, Leslie D. Setlock, Elizabeth M. Parker
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This study used eye-tracking technology to assess where helpers look as they are providing assistance to a worker during collaborative physical tasks. Gaze direction was coded into one of six categories: partner's head, partner's hands, task parts and tools, the completed task, and instruction manual. Results indicated that helpers rarely gazed at their partners' faces, but distributed gaze fairly evenly across the other targets. The results have implications for the design of video systems to support collaborative physical tasks.
Landscape Design: Designing for Local Action in Complex Worlds
Authors: Daniel A. Levinthal, Massimo Warglien
Venue: Organization Science (1999)

In recent years, the management literature has increasingly emphasized the importance of self-organization and "local action" in contrast to prior traditions of engineering control and design. While processes of self-organization are quite powerful, they do not negate the possibility of design influences. They do, however, suggest that a new set of design tools or concepts may be useful. We address this issue by considering the problem of landscape design-the tuning of fitness landscapes on which actors adapt. We examine how alternative organizational designs influence actors' fitness landscapes and, in turn, the behavior that these alternative designs engender. Reducing interdependencies leads to robust designs that result in relatively stable and predictable behaviors. Designs that highlight interdependencies, such as cross-functional teams, lead to greater exploration of possible configurations of actions, though at the possible cost of coordination difficulties. Actors adapt not only on fixed landscapes, but also on surfaces that are deformed by others' actions. Such couupled landscapes have important implications for the emergence of cooperation in the face of social dilemmas. Finally, actors' perceptions of landscapes are influenced by the manner in which they are framed by devices such as strategy frameworks and managerial accounting systems.
Manufacturing to Order with Random Yield and Costly Inspection
Authors: Abraham Grosfeld-Nir, Yigal Gerchak, Qi-Ming He
Venue: Operations Research (2000)

This study considers a situation where a contractor receives an order that it commits to satisfy in full. The fulfillment of the contract requires manufacturing and inspection. Because the number of defective units within a produced lot is not known in advance, it is possible that after examining the lot, it is learned that the number of conforming units is short of the demand. If so, further manufacturing and inspection are required. Once enough conforming units are found, the inspection terminates, and the remaining uninspected units, as well as all defectives, are scrapped.Whereas previous "multiple production runs" studies implicitly assumed that inspection costs are negligible, we include these costs as a key part of the problem. It turns out that the optimal production lot size depends on the inspection cost. Our model is very general: We provide a framework to calculate the optimal batch and the expected number of inspections for any yield pattern, as well as for any inspection procedure. We also provide results and numerical examples concerning specific yield patterns that are common in practice.
Pontryagin's maximum principle of optimal control governed by some non-well-posed semilinear parabolic differential equations
Authors: Gengsheng Wang
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

This paper concerns about necessary conditions for optimal control problems governed by some semilinear parabolic differential equations, which may be non-well posed. The two-point boundary (time variable) state constraint involves. The control set may be non-convex.
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
Authors: Celso C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
Venue: INFORMS Journal on Computing (2002)

We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP + PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the use of several construction heuristics with a weight perturbation strategy that combines intensification and diversification elements, as in a strategic oscillation approach. The improvement phase circularly explores two different local search strategies. The first uses anode-based neighborhood for local search, while the second uses a key-path-based neighborhood. An adaptive path-relinking technique is applied to a set of elite solutions as apost-optimization strategy. Computational results on a broad set of benchmark problems illustrate the effectiveness and the robustness of our heuristic, which is very competitive when compared to other approximate algorithms.
Restricted circular-arc graphs and clique cycles
Authors: Terry A. McKee
Venue: Discrete Mathematics (2003)

Circular-arc graphs are natural analogs of chordal and interval graphs, but without some of the features that make chordal and interval graphs particularly nice; perhaps, the biggest difference is the failure of the Helly condition. Restricting circular-arc representations so as to have no three or fewer arcs cover the entire circle and to have the endpoints of arcs be distinguishable by other arcs results in a notion of 'restricted circular-arc graphs' that enjoys many of the nice features of chordal graphs. Their theory is surprisingly parallel to that of chordal graphs, substituting 'clique cycles' for clique trees, but they also have several distinctive features and characterizations.
Topic detection and tracking evaluation overview
Authors: Jonathan G. Fiscus, George R. Doddington
Venue: Topic detection and tracking: event-based information organization (2002)

The objective of the Topic Detection and Tracking (TDT) program is to develop technologies that search, organize and structure multilingual, news oriented textual materials from a variety of broadcast news media. This research program uses controlled laboratory simulations of hypothetical systems to test the efficacy of potential technologies, to gauge research progress, and to provide a forum for the exchange of research information. This chapter introduces TDT's evaluation methodology including: the Linguistic Data Consortium's TDT corpora, evaluation metrics used in TDT and the five TDT research tasks: Topic Tracking, Link Detection, Topic Detection, First Story Detection, and Story Segmentation.
A multiplier theorem using the Schechter's method of interpolation
Authors: María J. Carro
Venue: Journal of Approximation Theory (2003)

Let m be a measurable bounded function and let us assume that there exists a bounded functions S so that m(ξ)S(ξ)it-1 is a Fourier multiplier on Lp uniformly in t ∈ R. Then, using the analytic interpolation theorem of Stein, one can show that necessarily m is a Lp multiplier. The purpose of this work is to show that under the above conditions, it holds that, for every k ∈ N, m(log S)k ∈ Mp. The technique is based on the Schechter's interpolation method.
Eternal: a component-based framework for transparent fault-tolerant CORBA
Authors: P. Narasimhan, L. E. Moser, P. M. Melliar-Smith
Venue: Software&mdash;Practice Experience (2002)

Enterprises are increasingly involved in worldwide round-the-clock e-commerce and e-business, which requires them to be operational 24 hours per day, 7 days per week. With outages leading to loss of revenue, reputation and customers, fault tolerance becomes increasingly important. By mixing the fault tolerance logic into the application logic, existing fault tolerance practices render applications more complex, more prone to errors, and more difficult to maintain and build. The Eternal system is a component-based middleware framework that provides transparent fault tolerance for enterprise applications, and that ensures continuous 24 × 7 operation without requiring special skills of the application programmers. The Eternal system implements the new Fault-Tolerant CORBA standard.
Creating a web-based simulation gaming exercise using PERL and JavaScript
Authors: Sharma Pillutla
Venue: Simulation and Gaming (2003)

Business simulation gaming has been around for quite a few years. The pedagogical and, more recently, the assessment value of gaming has been recognized and accepted in many circles. Many functional and total enterprise gaming exercises have been used in various business courses. Over the year, as technology has improved, simulation exercises have become more sophisticated and user friendly. The student can now concentrate on the content and learning in the gaming exercise without getting too diverted by the mechanics of playing the game. With the advent of the Internet an added dimension of convenience is now available. Using the World Wide Web (WWW) is a natural extension of making simulation games more powerful and the access more convenient. Due to the ubiquitous nature of the World Wide Web, which is accessible today from any home computer connected to the Internet, it behooves academics to explore and take advantage of this technology. This article delineates one such implementation that makes the entire game available on the Web. The game has been in continuous use for the past 3 years. The various components of the game and how the programming languages Practical Extraction and Reporting Language (PERL) and JavaScript can provide the functionality for making the game available on the Internet are described.
Water From the Desert: Minimizing Costs of Meeting Libya's Water Demands
Authors: A. M. El-Geriani, O. Essamin, D. P. Loucks
Venue: Interfaces (1998)

Libya has two choices for meeting its water demands: the Mediterranean Sea and groundwater from the Sahara Desert. We performed two studies supporting Libya1s decisions regarding further investments in desalination and in groundwater pumping and conveyance systems. We used static and dynamic mixed-integer optimization models to identify least-cost combinations of investments in infrastructure that would meet specified water demands at specified sites. Desalination does not appear to be an economically efficient alternative to the groundwater system, called the "Great Man-made River Project" (GMRP). Results from the static models showed that as water demands increase, various new GMRP components are needed, then get replaced by other new units, and then, under higher demands, are needed again. This demonstrated the need for dynamic capacity-expansion-planning models. The results of both studies are contributing to the Great Man-made River Authority's decision making.
DMSS implementation research: a conceptual analysis of the contributions and limitations of the factor-based and stage-based streams
Authors: Manuel Mora, Francisco Cervantes-Pérez, Ovsei Gelman-Muravchik, Guisseppi A. Forgionne, Marcelo Mejía-Olvera, Alfredo Weitzenfeld-Reitel
Venue: Decision making support systems: achievements, trends and challenges for (2002)

The implementation process of Decision-Making Support Systems (DMSS) is a highly complex process. Frequent implementation failures have caused the number of DMSS installed and adequately used to be far less than expected. The Theory of Factors and the Theory of Stages have been used to study this problem. Both approaches have generated a rich picture about key DMSS implementation issues. However, this knowledge is fragemented and disperse, offering only partial and reduced views and finding about strategies, tactics and operational processes to avoid failures in DMSS implementations. In this chapter, we organize the previous work into a unified and complete picture of the phenomenon. First, we examine the nature of the implementation problem from these research perspectives. Secondly, we continue with a conceptual analysis of the theoretical foundations of the Factor-based and Stage-based approaches. In this analysis we discuss the main models posed in both approaches and synthesize their findings. Then, their contributions and limitations are discussed and the Systems Approach is suggested as a research methodology to alleviate the difficulties. Finally, conclusions and directions for further research are presented.