ppxscal/embedding_network huggingface dataset:
Existence of solutions of a dynamic Signorini's problem with nonlocal friction in viscoelasticity
Authors: Marius Cocou
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

A dynamic unilateral contact problem with nonlocal friction for a viscoelastic body satisfying a Kelvin-Voigt law is studied. Using a penalty method and compactness results, the existence of a weak solution of this problem is proved.
Estimation of signal arrival times in the presence of delay noise
Authors: Sarvesh Bhardwaj, Sarma B. K. Vrudhula, David Blaauw
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Delay due to capacitive coupling of interconnects has become an important reliability issue in the design of nanometer circuits. In this paper we present a probabilistic approach towards analyzing the impact of capacitive coupling noise on signal delay. The variation in the delay is due to the variation in the relative arrival times of the aggressors and the victim. We derive expressions for the moments of the victim voltage in the presence of noise. From these we compute estimates of the earliest and latest possible arrival times of the victim. We compare the analytical results with Monte Carlo simulations using SPICE. Even though the analytical calculations are 200 times faster than the Monte Carlo simulations, the differences in the estimates of the mean and standard deviation of the arrival time is no more than 2.8%. In addition, the width of the timing intervals using the proposed approach is reduced by as much as 48% with a confidence level of 0.984. That is 98.4% of the Monte Carlo simulations result in an arrival time that falls within the derived interval which is 48% shorter.
Multiparty authentication services and key agreement protocols with semi-trusted third party
Authors: Dong Zheng, Kefei Chen, Jinyuan You
Venue: Journal of Computer Science and Technology (2002)

This paper introduces a new family of group key establishment protocols suitable for small or medium-sized groups. Five protocols are presented, using a semi-trusted server, with varying security service. The first one is a non-authenticated key agreement protocol suitable for applications with low security requirements. The second protocol adds an authenticated key agreement to provide collaborative authentication. The third and the fourth protocols provide key establishment with integrity and confirmation services, and the fifth protocol is the member adding protocol. A major advantage of the protocols is that they reduce the numbers of rounds from n to 5.
Dynamic Scheduling in a Make-to-Stock System: A Partial Characterization of Optimal Policies
Authors: Francis De Vericourt, Fikri Karaesmen, Yves Dallery
Venue: Operations Research (2000)

We consider the problem of dynamically allocating production capacity between two products to minimize the average inventory and backorder costs per unit time in a make-to-stock single machine system. Using sample path comparisons and dynamic programming, we give a characterization of the optimal hedging point policy for a certain region of the state space. The characterization is simple enough to lead to easily implementable heuristics and provides a formal justification of some of the earlier heuristics proposed.
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
Authors: Robert J. Walters
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that developers need help to analyse and understand them. However, at design time, when this understanding is crucial, the system is unavailable because it has yet to be built. Formal, executable models can help with this problem by providing developers with a platform on which to establish the feasibility of a proposed design. However, commercial developers seemreluctant to employ this type of modelling in their design activity.This paper describes a modelling tool in which the traditional model generation technique of writing "programming language like" code is replaced with a model generation tool which uses a graphical representation of models whilst retaining sufficient formality to permit the models to be executed, or converted into code for analysis by a traditional model checking tool.
Anticipating the Consequences of School Reform: a New Use of Dea
Authors: Shawna Grosskopf, Kathy J. Hayes, Lori L. Taylor, William L. Weber
Venue: Management Science (1999)

We use DEA-type linear programming techniques to simulate a basic component of educational reform-eliminating restrictions on the allocation of school personnel. Our technique allows us to identify potential output gains (or equivalently potential cost savings) from reform. We can also identify which personnel groups are likely to gain and lose under this reform. When we apply our model to a sample of Texas school districts, we find evidence that the educational establishment has substantial economic rents to protect from school reform, and that the primary beneficiaries of reform are likely to be affluent school districts with few minority students. The technique, which relies on the relationship between the direct and indirect distance functions, can be easily generalized to measure the potential gains from removing other input restrictions such as union work rules, environmental regulations, or deed restrictions.
Airline Crew Scheduling with Regularity
Authors: Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy
Venue: Transportation Science (2001)

The airline crew scheduling problem is the problem of assigning crew itineraries to flights. The problem is hard due to a large number of itineraries and the complicated cost function of an itinerary. The classic approach, which uses a set partitioning formulation, only captures the objective function of minimizing cost. We add a second goal of maximizing the repetition or regularity of itineraries over a weekly horizon and we develop models that capture regularity. We present a new algorithm that solves the crew scheduling problem over a weekly horizon. Solutions are reported that improve on existing solutions used by an airline.
Teaching programming through successive problem transformations
Authors: Pavel Azalov, Fani Zlatarova
Venue: Journal of Computing Sciences in Colleges (2003)

Teaching by examples and problems is a well-known and often used approach when teaching Computer Science. This paper discusses the development of Computer Science lectures using successive problem transformations. A concrete system of examples and problems is described, too. The idea to use such lectures could be especially appropriate for introductory Computer Science courses. The formal description of the idea how to develop similar systems of examples and problems is also considered.
Market Entry Strategy Under Firm Heterogeneity and Asymmetric Payoffs
Authors: Chakravarthi Narasimhan, Z. John Zhang
Venue: Marketing Science (2000)

How should a firm decide whether or not to enter an untested market when a competing firm is vying for the same market? Should a firm always speed to the market in an effort to capitalize on pioneering advantages? We address those questions by developing a simple game-theoretical model that captures the most essential factors in a firm's market entry decision, such as market uncertainty, firm heterogeneity, competition, cannibalization, and order-of-entry effects.Our analysis shows that in a competitive context, both pioneering advantages and laggard's disadvantages can motivate a firm to speed to an untested market. Therefore, pioneering advantages alone are not an adequate guide for a firm to formulate its market entry strategy. The optimal decision may call for a firm to be a prudent laggard when pioneering advantages to the firm are substantial, or to become a market pioneer when facing pioneering disadvantages. We characterize different patterns of market entry as equilibrium outcomes for different configurations of the market reward structure and offer a conceptual framework for formulating market entry strategies that go beyond the conventional dichotomy:speed orwait. We show that the paradoxical phenomenon of "disadvantaged pioneers" can arise in a competitive context as the outcome of rational firms making rational choices.To show that pioneering advantages alone are not the right litmus test for market entry decisions, we apply our general framework to a concrete case where consumer preference or the premium that consumers are willing to pay for the pioneering brand gives rise to pioneering advantages and laggard's disadvantages. We conclude that the firm with a larger pioneering premium may choose to wait, while a firm with a smaller pioneering premium speeds to the market.Our analysis also sheds light on empirical research on pioneering advantages. Because firms may race into a market solely to avoid laggard's disadvantages rather than to capture pioneering advantages, pioneers are not necessarily the firms best positioned to establish, exploit, and maintain pioneering advantages. Therefore, it is not surprising that a significant percentage of pioneers fail, as documented by recent empirical research. Our normative investigation further suggests that this predicament in empirical research will not disappear even if we have complete data, use the right measurements, and employ perfect statistical techniques. Therefore, it is perhaps more fruitful to redirect our research effort in the search for pioneering advantages.Finally, we extend our analysis to incorporate the effect of cannibalization on an incumbent firm's market entry strategy. We conclude that cannibalization can motivate an incumbent firm to wait, as the conventional wisdom suggests, but it can also be an impetus for a firm to become a market pioneer. We offer supporting evidence for our analysis and discuss managerial implications of our conclusions.
Mathematical modelling of compressible inviscid fluid flow through a sealing gap in the screw compressor
Authors: J. Vimmr
Venue: Mathematics and Computers in Simulation (2003)

In this article, the essential steps of the numerical simulation of compressible inviscid fluid flow in a sealing gap of the screw compressor starting from the description of a mathematical model to its final numerical solution are presented. The mathematical model of compressible inviscid flow is described by the conservative system of the Euler equations. For the numerical solution of this system, the cell-centred finite volume formulation of the explicit two-step MacCormack scheme with Jameson's artificial dissipation was used.
Optimizing Military Airlift
Authors: Steven F. Baker, David P. Morton, Richard E. Rosenthal, Laura Melody Williams
Venue: Operations Research (2002)

We describe a large-scale linear programming model for optimizing strategic (intercontinental) airlift capability. The model routes cargo and passengers through a specified transportation network with a given fleet of aircraft subject to many physical and policy constraints. The time-dynamic model captures a significant number of the important aspects of an airlift system in a large-scale military deployment, including aerial refueling, tactical (intracontinental) aircraft shuttles, and constraints based on crew availability. The model is designed to provide insight into issues associated with designing and operating an airlift system. We describe analyses for the U.S. Air Force system concerning fleet modernization and concerning the allocation of resources that affect the processing capacity of airfields.
Synthetic social relationships in animated virtual characters
Authors: Bill Tomlinson, Bruce Blumberg
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

We describe a multi-agent system based on the social behavior of the gray wolf (Canis lupus). This system, shown as an interactive installation at SIGGRAPH 2001, allows several participants to direct semi-autonomous wolf pups in a virtual pack. The heart of the system is a simple, biologically-inspired mechanism by which synthetic entities form social relationships with each other. This mechanism enables the virtual wolves to form relationships with each other that are both biologically plausible and engaging to participants in the installation. Systems like the one described in this paper could be of use in a variety of domains, for example, as platforms for simulation, as educational aids, and as entertainment media.
The First Use of a Combined-Value Auction for Transportation Services
Authors: John O. Ledyard, Mark Olson, David Porter, Joseph A. Swanson, David P. Torma
Venue: Interfaces (2002)

Combined-value auctions (CVAs) allow participants to make an offer of a single amount for a collection of items. These auctions provide value to both buyers and sellers of goods or services in a number of environments, but they have rarely been implemented, perhaps because of lack of knowledge and experience. Sears Logistics Services (SLS) is the first procurer of trucking services to use a CVA to reduce its costs. In 1993, it saved 13 percent over past procurement practices. Experimental economics played a crucial role in the development, sale, and use of the CVA.
Distance-based outliers: algorithms and applications
Authors: Edwin M. Knorr, Raymond T. Ng, Vladimir Tucakov
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in areas such as electronic commerce, credit card fraud, and even the analysis of performance statistics of professional athletes. Existing methods that we have seen for finding outliers can only deal efficiently with two dimensions/attributes of a dataset. In this paper, we study the notion of DB (distance-based) outliers. Specifically, we show that (i) outlier detection can be done efficiently for large datasets, and for k-dimensional datasets with large values of k (e.g., $k \ge 5$); and (ii), outlier detection is a meaningful and important knowledge discovery task.First, we present two simple algorithms, both having a complexity of $O(k \: N^2)$, k being the dimensionality and N being the number of objects in the dataset. These algorithms readily support datasets with many more than two attributes. Second, we present an optimized cell-based algorithm that has a complexity that is linear with respect to N, but exponential with respect to k. We provide experimental results indicating that this algorithm significantly outperforms the two simple algorithms for $k \leq 4$. Third, for datasets that are mainly disk-resident, we present another version of the cell-based algorithm that guarantees at most three passes over a dataset. Again, experimental results show that this algorithm is by far the best for $k \leq 4$. Finally, we discuss our work on three real-life applications, including one on spatio-temporal data (e.g., a video surveillance application), in order to confirm the relevance and broad applicability of DB outliers.
Necessary and Sufficient Conditions for the Passivicability of Linear Distributed Systems
Authors: V. A. Bondarko, A. L. Fradkov
Venue: Automation and Remote Control (2003)

For a wide class of systems, as is known, hyper-minimal phase is necessary and sufficient for the strict passivicability of a system. This class contains both concentrated- and distributed-parameter systems, including parabolic equations that describe heat-exchange and diffusion processes. Our results are applicable to finite-dimensional input and output spaces, which are important for application and cover systems with different numbers of inputs and outputs for which passivity is superseded by the G-passivity of some rectangular matrix G. An example of a diffusion-type one-dimensional partial differential equation directly containing control is given. Proofs are based on the infinite-dimensional variant of the Yakubovich&ndash;Kalman lemma and Nefedov&ndash;Sholokhovich exponential stabilization theorem.
Operations Research at Bell Laboratories through the 1970s: Part I
Authors: Cree S. Dawson, Charles J. Mccallum, R. Bradford Murphy, Eric Wolman
Venue: Operations Research (2000)

This historical account of operations research at Bell Laboratories was drafted in the late 1970s when the authors were part of the Operations Research Center within Bell Laboratories at AT&T; it has not previously appeared in the open literature. We have added a few references to later publications that describe particular aspects of the period covered. Discussions of technological practices and organizational arrangements expressed in the present tense represent a viewpoint of about 1980, before "divestiture" split up the Bell System. The principal topics in this issue ofOperations Research are the organizational history, and teletraffic theory and engineering. Upcoming issues ofOperations Research will include parts II and III of this account, comprising capacity expansion in telephone networks, operations analysis, applied statistics, and related OR activities. A comprehensive table of contents for parts I, II, and III can be found in the Online Collection of theOperations Research Home Page, at www.informs.org/pubs.
Transitional regime between vortical states of a gas
Authors: V. D. Gordevskyy
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

The process of interaction between two vortical flows in a gas of hard spheres is approximately described by the bimodal distribution of a special form. Both the flows rotate about the axes which can fly with arbitrary linear velocities. Some sufficient conditions for the infinitesimality of the uniform--integral residual between the sides of the Boltzmann equation are obtained.
Behavioral Integrity: The Perceived Alignment Between Managers' Words and Deeds as a Research Focus
Authors: Tony Simoms
Venue: Organization Science (2002)

This paper focuses on the perceived pattern of alignment between a manager's words and deeds, with special attention to promise keeping, and espoused and enacted values. It terms this perceived pattern of alignment"Behavioral Integrity." The literatures on trust, psychological contracts, and credibility combine to suggest important consequences for this perception, and literatures on hypocrisy, social accounts, social cognition, organizational change, and management fashions suggest key antecedents to it. The resulting conceptual model highlights an issue that is problematic in today's managerial environment, has important organizational outcomes, and is relatively unstudied.
Software defined QCIF simple profile MPEG-4 for portable devices using dynamically reconfigurable DSP
Authors: J. Geoffrey Chase, Christopher Pretty
Venue: Computer Standards Interfaces (2002)

The ISO MPEG-4 standard is emerging as the dominant digital video standard, and efficient, programmable MPEG-4 video codecs are paramount for emerging mobile devices that aggregate telecommunications with features including digital video. Efficient QCIF simple profile MPEG-4 video codec algorithms are developed for typical 16-bit, dual execution unit DSPs and the additional impact of tightly coupled, co-processors used to dynamically reconfigure the DSP data path is quantified. Efficient, programmable solutions consuming approximately 63 Mcycles, significantly lower than estimates as high as 400 Mcycles, are generated, while dynamic reconfiguration reduces this cost an additional 20%.
Positive Dynamic Systems with the Entropy Operator
Authors: Yu. S. Popkov
Venue: Automation and Remote Control (2003)

The class of positive dynamic systems with the entropy operator argmin was defined. The conditions for continuity, differentiability, and boundedness of the conditional optimal entropy were obtained. For the dynamic systems with this operator, the conditions for solution boundedness were obtained.
Real-time scheduling in video systems
Authors: E. A. de Kock, E. H. L. Aarts, G. Essink
Venue: Engineering of distributed control systems (2001)

We consider the problem of mapping video algorithms onto systems of high-performance video signal processors with hard real-time constraints. The mapping problem under consideration is computationally hard due to the many constraints that need to be satisfied. We present a compact mathematical formulation which identifies the decision variables and the constraints that are involved. We demonstrate that the mapping problem is NP-hard in the strong sense. The insight resulting from the mathematical formulation leads to a solution approach in which the problem is decomposed into subproblems called delay management, partitioning, and scheduling. These subproblems are handled with well-known techniques from the literature such as network flow, local search, and constraint satisfaction.
Mutual Information Agreement in Multicomputer Systems with the Detection and Identification of Byzantine Faults
Authors: V. Yu. Grishin, A. V. Lobanov, V. G. Sirenko
Venue: Automation and Remote Control (2003)

A method is suggested of the mutual information agreementin multicomputer systems with intercomputer bus-type communication channels and the broadcast way of transfer of intercomputer messages. The method makes it possible to detect and identify symptoms (both by the places of their emergence and by the types of faults, such as malfunctions programmed malfunctions, or failures) of multiple faults of computers and transmitting interfaces (interface devices) with communication channels, which can occur in all cycles of the interchange. In addition, the method enables one to distinguish, first, faults of computers and transmitting interfaces, if it is possible, and, second, the situation of the nondelivery of a message in initial cycles and the situation of the delivery of this message with distortions.
Dynamic Binding in Mobile Applications: A Middleware Approach
Authors: Paolo Bellavista, Antonio Corradi, Rebecca Montanari, Cesare Stefanelli
Venue: IEEE Internet Computing (2003)

By separating binding concerns from application logic, the Colomba approach exploits metadata to let mobile applications adapt to dynamic environments.
Computing left Kan extensions
Authors: M. R. Bush, M. Leeming, R. F. C. Walters
Venue: Journal of Symbolic Computation (2003)

We describe a new extension of the Todd-Coxeter algorithm adapted to computing left Kan extensions. The algorithm is a much simplified version of that introduced by Carmody and Walters (Category Theory, Proceedings of the International Conference Held in Como, Italy, 22-28 July 1990. Springer) in 1991. The simplification allows us to give a straightforward proof of its correctness and termination when the extension is finite.