ppxscal/embedding_network huggingface dataset:
An axiomatic approach to fuzzy cardinalities of finite fuzzy sets
Authors: J. Casasnovas, J. Torrens
Venue: Fuzzy Sets and Systems (2003)

An axiomatic definition of fuzzy cardinalities for finite fuzzy sets, defined by means of a convex fuzzy set on the natural numbers, is presented in such a way that it includes the fuzzy cardinalities defined by authors like Zadeh, Ralescu, Dubois, Wygralak, and characterizes the cardinalities that fulfill the additivity property by means of the extended addition of fuzzy numbers. Such cardinalities result defined by two functions, one nondecreasing and the other nonincreasing in a similar way to the scalar cardinality (Fuzzy Sets and Systems 110 (2000) 175).
Scheduling length for switching element disjoint multicasting in Banyan-type switching networks
Authors: Yeonghwan Tscha
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

Due to the stringent bit-error requirement in fiber optics, preventing the forthcoming crosstalk at switching elements (SEs) is very crucial in the large-scale photonic switches. In this paper, we consider the SE-disjoint multicasting for a photonic Banyan-type switching network. This ensures that at most, one connection holds each SE in a given time thus, neither photonic crosstalk nor link blocking will arise in the switching network implemented with optical devices such as directional couplers, splitters and combiners. Routing a set of connections under such constraint usually takes several routing rounds hence, it is desirable to keep the number of rounds (i.e., scheduling length) to a minimum. Unfortunately, finding the optimal length is NP-complete in general, we propose an algorithm that seeks an approximation solution less than double of the optimal upper bound. The bound permits the Banyan-type multicasting network to be rearrangeable nonblocking as well as crosstalk-free. It is given that the same bound guarantees wide-sense nonblocking for multicast connections, provided that the multicasting capability of the network is restricted to the second half of the whole stages, and strictly nonblocking for one-to-one connections, yet allowing to be free from the crosstalk. We also consider other crosstalk-free multicasting and the link-disjoint multicasting for the Banyan network. The theory developed in this paper gives a unified foundation on designing nonblocking and crosstalk-free photonic Banyan-type networks under the multicast connections.
Interorganizational Routines and Performance in Strategic Alliances
Authors: Maurizio Zollo, Jeffrey J. Reuer, Harbir Singh
Venue: Organization Science (2002)

This paper applies evolutionary economics reasoning to the strategic alliance context and examines whether and how routinization processes at the partnering-firm level influence the performance of the cooperative agreement. In doing so, it introduces the concept of interorganizational routines, defined as stable patterns of interaction among two firms developed and refined in the course of repeated collaborations, and suggests that partner-specific, technology-specific, and general experience accumulation at the partnering-firm level influence the extent to which alliances result in knowledge accumulation, create new growth opportunities, and enable partnering firms to achieve their strategic objectives. We also consider how governance design choices at the transaction level shape the effectiveness of interorganizational routizination processes. Based on a sample of 145 biotechnology alliances, we find that only partner-specific experience has a positive impact on alliance performance, and that this effect is stronger in the absence of equity-based governance mechanisms. We interpret these results to support the role of interfirm coordination and cooperation routines in enhancing the effectiveness of collaborative agreements.
Spreadsheet graphics for curve sketching in mathematics
Authors: David S. Tucker
Venue: Journal of Computing Sciences in Colleges (2002)

This paper focuses on one aspect of the recent developments in the use of technology in teaching mathematics -- the use of spreadsheet graphics to display problems visually, as well as numerically. Several applications and recent trends are discussed. Since many schools are requiring all students to be familiar with spreadsheets as part of a computer literacy requirement, it is now reasonable to expect them to use spreadsheet graphics in a math course. The spreadsheet program used for examples in this paper is Lotus 1-2-3, but any spreadsheet program will work as well.
3D particle tracking using an active vision
Authors: J.-C. Noyer, C. Boucher, M. Benjelloun
Venue: Pattern Recognition Letters (2003)

This paper concerns the 3D motion estimation and tracking of an object in a scene using an active vision system. We develop a state model which describes in an unified way this estimation problem. In this case, the main difficulty lies in the non-linear state equations. They are solved by the particle filter which avoids the linearization stage.
Extraction and LVS for mixed-domain integrated MEMS layouts
Authors: Bikram Baidya, Tamal Mukherjee
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

As design of integrated MicroElectroMechanical Systems (MEMS) matures, there is an increasing need for verification of MEMS layouts. This requires a mixed-domain LVS (layout-versus-schematic) methodology capable of extracting an integrated schematic from the mixed-domain layout and verifying it against the designed schematic. This paper reports on a prototype implementation of MEMS LVS and a MEMS extractor, which, in addition to reconstructing the extracted schematic also captures the domain-specific parasitics in the individual devices. This schematic is then used by a custom schematic-versus-schematic comparator to match connectivity of various elements between the designed and extracted schematics. Finally, simulation of the extracted schematic also helps in capturing the true behavior of the system.
An introduction to the multimedia educational resource for learning and online teaching (MERLOT)
Authors: Mark Hawkes, Daniel Talley, John Webster
Venue: Journal of Computing Sciences in Colleges (2001)

The Multimedia Educational Resource for Learning and Online Teaching (MERLOT) is a continually growing collection of online learning materials and support resources that help faculty enhance their instruction. MERLOT is a community of people who strive to enrich the teaching and learning experience. The resources in MERLOT include: Learning materials, sample assignments showing how the materials could be used in the classroom, evaluations of the learning materials by other individual users and panels of faculty, and people who share an interest in teaching and learning.
Economics and the Design of Open Systems
Authors: David D. Clark
Venue: IEEE Internet Computing (2003)

The implications of system modularity are particularly important for distributed systems operated by multiple profit-seeking commercial providers. In systems such as the Internet, modularity and interfaces shape not only technical design but also the very structure of the industry. System designers thus need to consider the industry structure that their modularity induces.
OverQoS: offering Internet QoS using overlays
Authors: Lakshminarayanan Subramanian, Ion Stoica, Hari Balakrishnan, Randy H. Katz
Venue: ACM SIGCOMM Computer Communication Review (2003)

This paper proposes OverQoS, an architecture for providing Internet QoS using overlay networks. OverQoS empowers third-party providers to offer enhanced network services to their customers using the notion of a controlled loss virtual link (CLVL). The CLVL abstraction bounds the loss-rate experienced by the overlay traffic; OverQoS uses it to provide differential rate allocations, statistical bandwidth and loss assurances, and enables explicit-rate congestion control algorithms.
Creative communication for chance discovery in shopping
Authors: Hiroko Shoji, Koichi Hori
Venue: New Generation Computing (2003)

This study considered an information presentation method to help customers make a concept-articulation type of purchase. When customers follow the concept-articulation type of thinking, they only have vague requirements and try to make a gradual clarification of what they really want through the interaction with salesclerk(s). Skillful salesclerks can communicate with their customers appropriately to discover an opportunity for bringing the customers to their concept-articulation, which often leads to a successful sale. Based on the observations from our analysis of these human behavior in actual purchase activities, we constructed a system called S-Conart (Concept Articulator for Shoppers) to support the concept-articulation type of purchase. The user study conducted using S-Conart shows that using a different method of presenting information can cause a change in the user's mental world, which is also observed in a real-life shopping situation, although in a different form. The result of this user study suggests the possibility of chance discovery by customers themselves, which is expected to be useful for building support systems for concept-articulation type of shoppers.
Nonrepetitive colorings of graphs
Authors: Noga Alon, Jaroslaw Grytczuk, Mariusz Hałuszczak, Oliver Riordan
Venue: Random Structures Algorithms (2002)

A sequence a = a1a2. . . . an is said to be nonrepetitive if no two adjacent blocks of a are exactly the same. For instance, the sequence 1232321 contains a repetition 2323, while 123132123213 is nonrepetitive. A theorem of Thue asserts that, using only three symbols, one can produce arbitrarily long nonrepetitive sequences. In this paper we consider a natural generalization of Thue's sequences for colorings of graphs. A coloring of the set of edges of a given graph G is nonrepetitive if the sequence of colors on any path in G is nonrepetitive. We call the minimal number of colors needed for such a coloring the Thue number of G and denote it by π(G). The main problem we consider is the relation between the numbers π(G) and Δ(G). We show, by an application of the Lovász Local Lemma, that the Thue number stays bounded for graphs with bounded maximum degree, in particular, π(G) ≤ cΔ(G)2 for some absolute constant c. For certain special classes of graphs we obtain linear upper bounds on π(G), by giving explicit colorings. For instance, the Thue number of the complete graph Kn is at most 2n - 3, and π(T) ≤ 4(Δ(T - 1) for any tree T with at least two edges. We conclude by discussing some generalizations and proposing several problems and conjectures.
How Should Team Captains Order Golfers on the Final Day of the Ryder Cup Matches?
Authors: W. J. Hurley
Venue: Interfaces (2002)

I used game theory to examine how team captains should select their slates for the final day of the Ryder Cup matches. Under the assumption that golfers have different abilities and are not influenced by pressure or momentum, I found that drawing names from a hat will do no worse than any other strategy.
Dynamic Control of a Queue with Adjustable Service Rate
Authors: Jennifer M. George, J. Michael Harrison
Venue: Operations Research (2001)

We consider a single-server queue with Poisson arrivals, where holding costs are continuously incurred as a nondecreasing function of the queue length. The queue length evolves as a birth-and-death process with constant arrival rate ? = 1 and with state-dependent service rates Âµ nthat can be chosen from a fixed subset A of [0, 8). Finally, there is a nondecreasing cost-of-effort functionc(Â·) on A, and service costs are incurred at ratec(Âµ n ) when the queue length isn. The objective is to minimize average cost per time unit over an infinite planning horizon. The standard optimality equation of average-cost dynamic programming allows one to write out the optimal service rates in terms of the minimum achievable average costz*. Here we present a method for computingz* that is so fast and so transparent it may be reasonably described as an explicit solution for the problem of service rate control. The optimal service rates are nondecreasing as a function of queue length and are bounded if the holding cost function is bounded. From a managerial standpoint it is natural to comparez*, the minimum average cost achievable with state-dependent service rates, against the minimum average cost achievable with a single fixed service rate. The difference between those two minima represents the economic value of a responsive service mechanism, and numerical examples are presented that show it can be substantial.
BIST Module for Mixed-Signal Circuits
Authors: Serge N. Demidenko, Vincenzo Piuri, Vyacheslav N. Yarmolik, A. Shmidman
Venue: Proceedings of the 13th International Symposium on Defect and Fault-Tolerance in VLSI Systems (1998)

T-flip-flop implementation of the universal module (signature analyzer and test generator) for built-in self-test of mixed signal circuits is proposed and analyzed.
Behavior relativity of Petri nets
Authors: Changjun Jiang, Huaiqing Wang, Shaoyi Liao
Venue: Journal of Computer Science and Technology (2002)

This paper presents a novel methodology for modelling and analyzing of behavior relations of concurrent systems. The set of all firing sequences of a Petri net is an important tool for describing the dynamic behavior of concurrent systems. In this paper, the behavior relativity of two concurrent subsystems in their synchronous composition is presented. Such behavior relativities, including Controlled Relativity, United Relativity, Interactive Relativity and Exclusive Relativity, are defined respectively. The properties of the relativities are discussed in detail. The analysis method for these properties is based on minimum T-invariants, when two subsystems are live bounded Petri nets. A well-known example has also been analyaed using the new methodology to demonstrate the advantages of the proposed methodology.
Experimental study of cockpit displays of traffic information for pilot self-spacing in congested airspace
Authors: Kirk Benson, Glenn Dean, Geoffrey Kuhlmann, Brian Sperling, Amy R. Pritchett, Julie A. Jacko
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

An experimental study examined cockpit displays of traffic information for pilot self-spacing in congested airspace. Results demonstrate that pilots have the capability to benefit from additional traffic information and take over some additional control responsibility. Additionally, this experiment shows that pilots benefit from the presentation of velocity and closure rate, and from range spacing arcs.
A relevance restriction strategy for automated deduction
Authors: David A. Plaisted, Adnan Yahya
Venue: Artificial Intelligence (2003)

Identifying relevant clauses before attempting a proof may lead to more efficient automated theorem proving. Relevance is here defined relative to a given set of clauses S and one or more distinguished sets of support T. The role of a set of support T can be played by the negation of the theorem to be proved or the query to be answered in S which gives the refutation search goal orientation. The concept of relevance distance between two clauses C and D of S is defined using various metrics based on the properties of paths connecting C to D. This concept is extended to define relevance distance between a clause and a set (or multiple sets) of support. Informally, the relevance distance reflects how closely two clauses are related. The relevance distance to one or more support sets is used to compute a relevance set R, a subset of S that is unsatisfiable if and only if S is unsafisfiable. R is computed as the set of clauses of S at distance less than n from one or more support sets: if n is sufficiently large then R is unsatisfiable if S is. If R is much smaller than S, a refutation from R may be obtainable in much less time than a refutation from S. R must be efficiently computable to achieve an overall efficiency improvement. Different relevance metrics are defined, characterized and related. The tradeoffs between the amount of effort invested in computing a relevance set and the resulting gains in finding a refutation are addressed. Relevance sets may be utilized with arbitrary complete theorem proving strategies in a completeness-preserving manner. The potential of the advanced relevance techniques for various applications of theorem proving is discussed
Analysis of a ridged circular disk microstrip antenna element excited by a microstrip transmission line proximity method using cavity model
Authors: A. R. Mallahzadeh, F. H. Kashani, K. Barkeshli
Venue: Iranian Journal of Science and Technology (2002)

A simple and ridged circular patch antenna element excited by a transmission line proximity method is analyzed. The approach is based on conserving the power action at the ridged position using the cavity model with the assumption of a linear variation of the current distribution on the overlap portion of the line and the patch. The smallest line to ground plane spacing for which a match of the radiator to the line is feasible is found for a given thickness and the patch radius.
A General Framework for the Study of Decentralized Distribution Systems
Authors: Ravi Anupindi, Yehuda Bassok, Eitan Zemel
Venue: Manufacturing Service Operations Management (2001)

We develop a general framework for the analysis of decentralized distribution systems. We carry the analysis in terms of a simplified model which entailsN retailers who face stochastic demands and hold stocks locally and/or at one or more central locations. An exogenously specified fraction of any unsatisfied demand (demand greater than locally available stock) at a retailer could be satisfied using excess stocks at other retailers and/or stocks held at a central location. We consider inventory ordering and allocation decisions. The operational decisions of inventory and allocation of stocks and the financial decision of allocation of revenues/costs must be made in a way consistent with the individual incentives of the various independent retailers. We develop a "coopetitive" framework for the sequential decisions of inventory and allocation. We introduce the notion ofclaims that allows us to separate the ownership (with decision rights) and the location of inventories in the system. For the cooperative shipping and allocation decision, we use the concept of core and develop sufficient conditions for the existence of the core. For the inventory decision, we develop conditions for the existence of a pure strategy Nash Equilibrium. For this decentralized system, we show that there exists an allocation mechanism that achieves the first-best solution for inventory deployment and allocation. We develop conditions under which the first-best equilibrium will be unique. Our model can be easily generalized to include complicated ownership structures such as "super dealers," partnerships, "inventory speculators," and situations in retail e-commerce settings such as "click-through arrangements," separation of "demand generators," and "fulfillment houses," etc. It can also be applied to situations involving capacity allocations and product substitutions.
Library statistics and outcomes assessment
Authors: Rose L. Bland, Allison M. Howard
Venue: Building a virtual library (2003)

The objective of collecting library statistics is "to assess the quality and effectiveness of services [and resources] provided by the library" (Poll, 2001,p.307). A review of the literature shows that measurement of electronic resources is a concern, that standards are necessary, and collaboration with publishers is required. As libraries spend more of their valuable resources to provide access to the electronic environment, they need to turn their attention to the effective measurement of electronic resources. In order to do this, libraries must determine relevant statistics (including those that can be collected internally by the library), request vendors to provide standardized statistics, and finally, evaluate the data in the context of their unique setting to enable sound decision-making. Libraries also need to utilize user surveys in addition to local and content-provider statistics, to get a clearer picture of their user's needs and satisfaction with library services and resources. Although the task is daunting, obtaining reliable statistics in the electronic environment is needed and continues to be another challenging area in academic libraries.This chapter will examine the various issues involved in gathering usage statistics for library electronic resources, including questions relating to why libraries collect statistics, what needs to be collected, and how data are collected. The chapter will also address the challenges encountered in collecting data, the perspective of content-providers, and the issues involved in data presentation. Finally, there will be a short review of several key initiatives on statistics for electronic collections.
Scheduling Aircraft Landings--The Static Case
Authors: J. E. Beasley, M. Krishnamoorthy, Y. M. Sharaiha, D. Abramson
Venue: Transportation Science (2000)

In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all successive planes are respected. We present a mixed-integer zero--one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss how our formulations can be used to model a number of issues (choice of objective function, precedence restrictions, restricting the number of landings in a given time period, runway workload balancing) commonly encountered in practice. The problem is solved optimally using linear programming-based tree search. We also present an effective heuristic algorithm for the problem. Computational results for both the heuristic and the optimal algorithm are presented for a number of test problems involving up to 50 planes and four runways.
Pointer cache assisted prefetching
Authors: Jamison Collins, Suleyman Sair, Brad Calder, Dean M. Tullsen
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Data prefetching effectively reduces the negative effects of long load latencies on the performance of modern processors. Hardware prefetchers employ hardware structures to predict future memory addresses based on previous patterns. Thread-based prefetchers use portions of the actual program code to determine future load addresses for prefetching.This paper proposes the use of a pointer cache, which tracks pointer transitions, to aid prefetching. The pointer cache provides, for a given pointer's effective address, the base address of the object pointed to by the pointer. We examine using the pointer cache in a wide issue superscalar processor as a value predictor and to aid prefetching when a chain of pointers is being traversed. When a load misses in the L1 cache, but hits in the pointer cache, the first two cache blocks of the pointed to object are prefetched. In addition, the load's dependencies are broken by using the pointer cache hit as a value prediction.We also examine using the pointer cache to allow speculative precomputation to run farther ahead of the main thread of execution than in prior studies. Previously proposed thread-based prefetchers are limited in how far they can run ahead of the main thread when traversing a chain of recurrent dependent loads. When combined with the pointer cache, a speculative thread can make better progress ahead of the main thread, rapidly traversing data structures in the face of cache misses caused by pointer transitions.