ppxscal/embedding_network huggingface dataset:
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations
Authors: Hanif D. Sherali, J. Cole Smith, Antonio A. Trani
Venue: Transportation Science (2002)

In this paper, we present an airspace planning model (APM) that has been developed for use in both tactical and strategic planning contexts under various airspace scenarios. Given a set of flights for a particular time horizon, along with (possibly several) alternative flight-plans for each flight that are based on delays and diversions, due to special-use airspace (SUA) restrictions prompted by launches at spaceports or adverse weather conditions, this model prescribes a set of flight-plans to be implemented. The model formulation seeks to minimize and delay fuel-cost-based objective function, subject to the constraints that each flight is assigned one of the designated flight-plans, and that the resulting set of flight-plans satisfies certain specified workload, safety, and equity criteria. These requirements ensure that the workload for air-traffic controllers in each sector is held under a permissible limit, that any potential conflicts are routinely resolvable, and that the various airlines involved derive equitable levels of benefits from the overall implemented schedule. To solve the resulting 0--1 mixed-integer programming problem more effectively using commercial software (e.g., CPLEX-MIP), we explore the use of reformulation techniques designed to more closely approximate the convex hull of feasible solutions to the problem. We also prescribe a polynomial-time heuristic procedure that is demonstrated to provide solutions to the problem within 0.01% of optimality. Computational results are reported on several scenarios based on actual flight data obtained from the Federal Aviation Administration (FAA) to demonstrate the efficacy of the proposed approach for air-traffic management (ATM) purposes.
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
Authors: François Vanderbeck
Venue: Operations Research (2000)

Dantzig-Wolfe decomposition as applied to an integer program is a specific form of problem reformulation that aims at providing a tighter linear programming relaxation bound. The reformulation gives rise to an integer master problem, whose typically large number of variables is dealt with implicitly by using an integer programming column generation procedure, also known as branch-and-price algorithm. There is a large class of integer programs that are well suited for this solution technique. In this paper, we propose to base the Dantzig-Wolfe decomposition of an integer program on the discretization of the integer polyhedron associated with a subsystem of constraints (as opposed to its convexification). This allows us to formulate the integrality restriction directly on the master variables and sets a theoretical framework for dealing with specific issues such as branching or the introduction of cutting planes in the master. We discuss specific branching schemes and their effect on the structure of the column generation subproblem. We give theoretical bounds on the complexity of the separation process and the extent of the modifications to the column generation subproblem. Our computational tests on the cutting stock problem and a generalisation--the cutting strip problem--show that, in practice, all fractional solutions can be eliminated using branching rules that preserve the tractability of the subproblem, but there is a trade-off. between branching efficiency and subproblem tractability.
A Pragmatic View of Knowledge and Boundaries: Boundary Objects in New Product Development
Authors: Paul R. Carlile
Venue: Organization Science (2002)

This study explores the premise that knowledge in new product development proves both a barrier to and a source of innovation. To understand the problematic nature of knowledge and the boundaries that result, an ethnographic study was used to understand how knowledge is structured differently across the four primary functions that are dependent on each other in the creation and production of a high-volume product. A pragmatic view of 'knowledge in practice' is developed, describing knowledge as localized, embedded, and invested within a function and how, when working across functions, consequences often arise that generate problematic knowledge boundaries. The use of a boundary object is then described as a means of representing, learning about, and transforming knowledge to resolve the consequences that exist at a given boundary. Finally, this pragmatic view of knowledge and boundaries is proposed as a framework to revisit the differentiation and integration of knowledge.
Asymptotic behaviour and existence of nonoscillatory solutions of second-order neutral delay difference equations
Authors: Xianyi Li, Yong Zhou
Venue: The Korean Journal of Computational Applied Mathematics (2003)

In this paper, we give a classification of nonoscillatory solution of a second-order neutral delay difference equation of the form Δ2(xn-cnxn-r) = f(n,xg1(n),....,xgm(n)). Some existence results for each kind of nonoscillatory solutions are also established.
Numerical computation of water and solitary waves by the double exponential transform
Authors: K. Kobayashi, H. Okamoto, J. Zhu
Venue: Journal of Computational and Applied Mathematics (2003)

We propose a numerical method for solving integral equations whose solutions possess singularities at the end points. Our method is based on the double exponential transform and effective use of the Fast Fourier Transform. Its accuracy is tested by Nekrasov's integral equation for water-waves and Yamada's equation for solitary waves.
The genome generator: simulating the development of junk DNA
Authors: Robert W. McGrail, S. Rebecca Thomas, Michael Tibbetts
Venue: Journal of Computing Sciences in Colleges (2003)

The authors extend the work of Loomis and Gilpin, as reported in [12], to further explore the effects of arbitrary insertions, deletions, and reversals on the development of vestigial sequences, otherwise known as "junk DNA," within genomes. In addition to its utility as a research aid, the Genome Generator has proven to be a valuable pedagogical aid for undergraduate courses in biology, bioinformatics, and computer science. Indeed, the fundamental ideas behind this tool are so simple that we have used it successfully in short workshops for visiting high schoolstudents. The authors believe that others will also find the Genome Generator to be a useful teaching tool.
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Venue: Conference on High Performance Networking and Computing (2002)

This 15th Annual SC conference brings together a worldwide community to celebrate its achievements and envision the future of high performance computing, networking, and data technologies. Our theme, "From Terabytes to Insights," emphasizes the opportunity to use technology to transform an ever-increasing flow of data into the knowledge that will impact education, science, business, government, and every aspect of society.The technical program features an outstanding set of speakers - in plenary, masterworks, and papers -- who address key technical, policy, and real-world application issues of HPC. Tutorials and the Education program provide unparalleled opportunities for learning at and beyond the conference. Panel discussions and Birds of a Feather sessions are opportunities for community interaction and discussion. The Awards program recognizes the highest achievements in our field and at the conference.We feature a record number of exhibits from the world's top technology companies, cutting-edge start-ups, research centers, government labs, and top universities, providing an incomparable view of our country's accomplishments. Posters are integrated into the new 'Academic Village' section of the exhibition. And SCinet 2002, in place for the duration of the conference, is one of the most powerful networks on earth.The IntelliBadge&trade; demonstration project will link 'smart' sensor technology to on-the-floor computing and visualization resources as a service to attendees. Technical program attendees who participate in IntelliBadge will be able to pinpoint events that meet their needs and interests, locate people with similar interests, and even find restaurants to suit their tastes.We invite you to enjoy colorful, historic Baltimore, a city of great writers (Edgar Allen Poe, H. L. Mencken), great musicians (Eubie Blake, Billie Holiday), and the home of Fort McHenry, where Francis Scott Key penned "The Star Spangled Banner." The city's Inner Harbor is a perfect example of a rejuvenated inner city neighborhood. Conference hotels, restaurants, and entertainment facilities such as Harborplace, the National Aquarium, and the Maryland Science Center are an easy walk from the convention center.So, whether you want to build the world's most powerful supercomputer, develop lasting scientific collaborations, or simply glimpse the future technologies that will shape our world, you have come to the right place - SC2002 in Baltimore!
The class number one problem for some non-Abelian normal CM-fields of degree 48
Authors: Ku-Young Chang, Soun-Hi Kwon
Venue: Mathematics of Computation (2003)

We prove that there is precisely one normal CM-field of degree 48 with class number one which has a normal CM=subfield of degree 16: the narrow Hilbert class field of Q(√5, √101, θ) with θ3 - θ2 -5θ - 1 = 0.
Investigating police patrol practice for design of IT
Authors: Urban Nulden
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper describes an ongoing research project aiming to find design implications for information technology supporting police patrol work. A field study of approximately 300 hours over a twelve-month period has been conducted. Tentative findings are structured as three design dimensions that are used to discuss a possible IT design.
Computing full disjunctions
Authors: Yaron Kanza, Yehoshua Sagiv
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Under either the OR-semantics or the weak semantics, the answer to a query over semistructured data consists of maximal rather than complete matchings, i.e., some query variables may be assigned null values. In the relational model, a similar effect is achieved by computing the full disjunction (rather than the natural join or equijoin) of the given relations. It is shown that under either the OR-semantics or the weak semantics, query evaluation has a polynomial-time complexity in the size of the query, the database and the result. It is also shown that the evaluation of full disjunctions is reducible to query evaluation under the weak semantics and hence can be done in polynomial time in the size of the input and the output. Complexity results are also given for two related problems. One is evaluating a projection of the full disjunction and the other is evaluating the set of all tuples in the full disjunction that are non-null on some given attributes. In the special case of &gamma;-acyclic relation schemes, both problems have polynomial-time algorithms in the size of the input and the output. In the general case, such algorithms do not exist, assuming that P &ne; NP. Finally, it is shown that the weak semantics can generalize full disjunctions by allowing tuples to be joined according to general types of conditions, rather than just equalities among attributes.
Collaborative simulation grid: multiscale quantum-mechanical/classical atomistic simulations on distributed PC clusters in the US and Japan
Authors: Hideaki Kikuchi, Rajiv K. Kalia, Aiichiro Nakano, Priya Vashishta, Hiroshi Iyetomi, Shuji Ogata, Takahisa Kouno, Fuyuki Shimojo, Kenji Tsuruta, Subhash Saini
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

A multidisciplinary, collaborative simulation has been performed on a Grid of geographically distributed PC clusters. The multiscale simulation approach seamlessly combines i) atomistic simulation based on the molecular dynamics (MD) method and ii) quantum mechanical (QM) calculation based on the density functional theory (DFT), so that accurate but less scalable computations are performed only where they are needed. The multiscale MD/QM simulation code has been Grid-enabled using i) a modular, additive hybridization scheme, ii) multiple QM clustering, and iii) computation/communication overlapping. The Gridified MD/QM simulation code has been used to study environmental effects of water molecules on fracture in silicon. A preliminary run of the code has achieved a parallel efficiency of 94% on 25 PCs distributed over 3 PC clusters in the US and Japan, and a larger test involving 154 processors on 5 distributed PC clusters is in progress.
Strategic Learning: the Continuous Side of Discontinuous Strategic Change
Authors: Nalin Kulatilaka, Enrico C. Perotti, Kotaro Kuwada
Venue: Organization Science (1998)

The author introduces the concept of strateg ic learning to explain long-run dynamics of strategic behaviors and organizations. Because a firm's long-run adaptation is realized through a series of strategic behaviors and organizational innovations, organizational capability to design effective stra tegic behaviors and organizational structure is critical for a firm's growth and survival. A series of strategic behaviors is shaped through the stable generation mechanism. Strategic learning is organizational learning that improves the strategic capability of the organization and changes the basic assumptions underlying the stable generation mechanism that structures the strategic behavior design process. Organizations have various levels of knowledge and learn at all levels. The levels of organizational learning interact, making higher order learning such as strategic learning problematic. Distinguishing characteristics of strategic learning are that it is learning without questioning and without unlearning in advance. It starts from a current set of basic assumptions and ends with a new set of basic assumptions. Referring to related literature and a case study, the author describes the process of strategic learning as an intraorganizational ecological process, integrating various levels of learning in organizations and including processes of both strategic knowledge creation and strategic knowledge distillation. He also discusses theoretical and practical implications derived from the strategic learning model.
Telefile: a case study of an online savings bank application
Authors: M. Sanders
Venue: Communications of the ACM (1963)

The development of an on-line computer system for a savings bank institution is traced from the early conceptual needs of the bank to the consummation of design by The Teleregister Corporation. Both bank and equipment criteria are specified which led to the development of the Telefile System of The Teleregister Corporation.Operation of the on-line and off-line programs are described and statistics are cited for reliability and performance of the system. Benefits to the bank are discussed from the banker's point of view; an indication of future trends in the on-line savings bank field is also discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Perspectives on end user development
Authors: Henry Lieberman, Fabio Paternò, Alexander Repenning, Volker Wulf
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The goal of the workshop is to bring about a coherent research agenda in the field of end user development. We seek contributors concerned with: adaptability, adaptivity, tailoring of system functionality and user interfaces, the use of annotations for individuals and user groups, and use of effective visual and multimedia representations.
Intellectual property rights of multimedia enriched websites
Authors: Charles Adetokunbo Shoniregun
Venue: Ubiquity (2003)

Can original print and music survive the multimedia technology hoax?
Stochastic Programming-Based Bounding of Expected Production Costs for Multiarea Electric Power System
Authors: Benjamin F. Hobbs, Yuandong Ji
Venue: Operations Research (1999)

A bounding-based method is developed for estimating the expected operation cost of a multiarea electric power system in which transmission capacity limits interarea flows. Costs include the expense of power generation and losses suffered by consumers because of supply shortfalls, averaged over random generator outage states and varying demand levels. The calculation of this expectation, termed the distribution problem, is a large-scale stochastic programming problem. Rather than solving this problem directly, lower and upper bounds to the expected cost are created using two more easily solved models. The lower bound is from a deterministic model based on the expected value of the uncertain inputs. The upper bound results from a linear program with recourse whose structure permits relatively quick solution by Benders decomposition. The Benders subproblems use probabilistic production costing, which can be viewed as a stochastic greedy algorithm, to consider random outages and demands. These bounds are iteratively tightened by partitioning realizations of the random variables into subsets based on the status of larger generators and a cluster analysis of demands. Computational examples are described and application issues addressed.
Efficient model order reduction via multi-node moment matching
Authors: Yehea I. Ismail
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit moment matching around s=0. As compared to the well-known Single-point Moment Matching (SMM) techniques (such as AWE), MMM has several advantages. First, the number of moments required by MMM is significantly lower than SMM for a reduced order model of the same accuracy, which directly translates into computational efficiency. This higher computational efficiency of MMM as compared to SMM increases with the number of inputs to the circuit. Second, MMM has much better numerical stability as compared to SMM. This characteristic allows MMM to calculate an arbitrarily high order approximation of a linear system, achieving the required accuracy for systems with complex responses. Finally, MMM is highly suitable for parallel processing techniques especially for higher order approximations while SMM has to calculate the moments sequentially and cannot be adapted to parallel processing techniques.
Using Analogical Reasoning and Schema Formation to Improve the Success in Formulating Linear Programming Models
Authors: Frederic H. Murphy, Venkat Panchanadam
Venue: Operations Research (1999)

In this paper we look at alternative ways of teaching linear programming model formulation and show that the material needs to be presented within the context of a structure that improves the ability of students to apply the models to subsequent problems. This work builds on the cognitive psychology literature on formulating algebra word problems. We show that presenting a conceptual framework prior to teaching linear programming examples is better then either no conceptual framework or presenting the framework after teaching the examples.
Location based services: locating the money
Authors: Kirk Mitchell, Mark Whitmore
Venue: Mobile commerce: technology, theory, and applications (2003)

Location based services (LBS) are considered by some to be the 'golden child" of wireless data services and one of the few areas where users would be willing to pay a premium for usage. Mobile Operators however are yet to be convinced, and despite acknowledging location services as strategic, have not considered it a priority. Recent LBS deployments however focusing on a holistic view of user behaviour are showing positive signs of success. These deployments focus on providing services that integrate different content from multiple sources to provide users with a coherent and logically connected flow of application options. These applications are called "Find it, Route it, Share it & Buy it. Importantly this model maximises return on investment (ROI) by motivating user to undertake multiple transactions. The challenge for those within the LBS industry is to convince mobile operators that LBS is viable and can deliver a strong ROI. Indeed, the future success of LBS is as much dependant on locating the money as it is about locating the subscribers.
Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
Authors: Robert Mifflin, Claudia Sagastizábal
Venue: SIAM Journal on Optimization (2002)

We give second-order expansions for quite general nonsmooth functions from the $\cal{V}\cal{U}$-space decomposition point of view. The results depend on primal-dual gradient structure, which we relate to general concepts of second-order epi-derivatives and partly smooth functions. Expressions for the associated second-order objects are given in terms of $\cal{U}$-subspace Hessians.
Policy Model for Pollution Control in the Copper Industry, Including a Model for the Sulfuric Acid Market
Authors: René Caldentey, Susana Mondschein
Venue: Operations Research (2003)

In this paper we develop a policy model for pollution control investment and operational decisions in the copper industry. The system consists of (i) a nonlinear integer model to optimize smelter operations, including the investment decisions relating to smelting capacity and pollution control plants that complies with environmental regulations, and (ii) a network flow model to describe the economic behavior of the sulfuric acid market, which considers the sulfuric acid produced at the pollution abatement stages in the smelting process. This second model solves for an equilibrium among spatially separated markets, that determines the price and distribution of acid in each demand and supply region. The two models interact through the input each receives from the other. Thus, the smelter model uses the sulfuric acid price at each smelter to find optimal operational and investment decisions, whereas the sulfuric acid market model considers sulfuric acid output at the smelters as part of the supply input to find the price of this product at each smelter location. The solution given by the policy model is the global equilibrium obtained when this iterative process between the two models converges. Thus, the price of the sulfuric acid, which is the central component when deciding when and where to locate a sulfuric acid plant, is determined endogenously, rather than assumed exogenous as in most models of this type. Computational experiments show that expected profits associated with the copper industry can increase significantly when the problem is solved in aggregate, as compared with the smelters making their decisions independently. Several applications of the policy model are described.