scispace - formally typeset
Search or ask a question
Institution

Naval Postgraduate School

EducationMonterey, California, United States
About: Naval Postgraduate School is a education organization based out in Monterey, California, United States. It is known for research contribution in the topics: Tropical cyclone & Nonlinear system. The organization has 5246 authors who have published 11614 publications receiving 298300 citations. The organization is also known as: NPS & U.S. Naval Postgraduate School.


Papers
More filters
Journal ArticleDOI
TL;DR: A unified framework for handling the computation of optimal controls where the description of the governing equations or that of the path constraint is not a limitation and any inherent smoothness present in the optimal system trajectories is harnessed.

99 citations

Journal ArticleDOI
TL;DR: In this article, the authors used present weather observations taken by ships and relating them to a given amount of precipitation, and derived new estimates of oceanic rainfall for the Pacific Ocean between 30°S and 60°N.
Abstract: By using present weather observations taken by ships and relating them to a given amount of precipitation, new estimates of oceanic rainfall for the Pacific Ocean between 30°S and 60°N have been derived. Satellite microwave measurements and Taylor's (1973) island analysis support our findings. Annual and quarterly rainfall maps, drawn from our estimates, agree with other modem, land-derived values, but provide greater detail. Between the equator and 60°N, the annual depth and volume rainfall totals are 1282 mm and 1.16×105 km3, respectively. Maps of amplitude and phase show that most of the rainfall north of 28°N occurs in winter, while maximum rainfall occurs in July and August in the tropics. Diurnal rainfall, studied at selected locations, is at a minimum at noon in all but the western pan of the North Pacific. Here there is no distinct minimum.

99 citations

Journal ArticleDOI
TL;DR: A game-theoretic model is developed to describe real-time dynamic price competition between firms that sell substitutable products and shows the existence of Nash equilibrium.

98 citations

Journal ArticleDOI
TL;DR: This paper uses network data from Noordin Top’s South East Asian terror network to illustrate how both kinetic and non-kinetic strategies could be pursued depending on a commander's intent, and strongly advises the use of SNA metrics in developing alterative counter-terrorism strategies that are contextdependent rather than letting S NA metrics define and drive a particular strategy.
Abstract: Our goal in this paper is to explore two generic approaches to disrupting dark networks: kinetic and nonkinetic The kinetic approach involves aggressive and offensive measures to eliminate or capture network members and their supporters, while the non-kinetic approach involves the use of subtle, non-coercive means for combating dark networks Two strategies derive from the kinetic approach: Targeting and Capacity-building Four strategies derive from the non-kinetic approach: Institution-Building, Psychological Operations, Information Operations and Rehabilitation We use network data from Noordin Top’s South East Asian terror network to illustrate how both kinetic and non-kinetic strategies could be pursued depending on a commander’s intent Using this strategic framework as a backdrop, we strongly advise the use of SNA metrics in developing alterative counter-terrorism strategies that are contextdependent rather than letting SNA metrics define and drive a particular strategy

98 citations

Journal ArticleDOI
TL;DR: A “sliding time window heuristic” is developed to solve the open pit mine block sequencing problem, which seeks a discretetime production schedule that maximizes the net present value of the orebody extracted from an open-pit mine.
Abstract: The open pit mine block sequencing problem (OPBS) seeks a discretetime production schedule that maximizes the net present value of the orebody extracted from an open-pit mine. This integer program (IP) discretizes the mine’s volume into blocks, imposes precedence constraints between blocks, and limits resource consumption in each time period. We develop a “sliding time window heuristic” to solve this IP approximately. The heuristic recursively defines, solves and partially fixes an approximating model having: (i) fixed variables in early time periods, (ii) an exact submodel defined over a “window” of middle time periods, and (iii) a relaxed submodel in later time periods. The heuristic produces near-optimal solutions (typically within 2% of optimality) for model instances that standard optimization software fails to solve. Furthermore, it produces these solutions quickly, even though our OPBS model enforces standard upper-bounding constraints on resource consumption along with less standard, but important, lower-bounding constraints.

98 citations


Authors

Showing all 5313 results

NameH-indexPapersCitations
Mingwei Chen10853651351
O. C. Zienkiewicz10745571204
Richard P. Bagozzi104347103667
Denise M. Rousseau8421850176
John Walsh8175625364
Ming C. Lin7637023466
Steven J. Ghan7520725650
Hui Zhang7520027206
Clare E. Collins7156021443
Christopher W. Fairall7129319756
Michael T. Montgomery6825814231
Tim Li6738316370
Thomas M. Antonsen6588817583
Nadia Magnenat-Thalmann6552114850
Johnny C. L. Chan6126114886
Network Information
Related Institutions (5)
Georgia Institute of Technology
119K papers, 4.6M citations

89% related

University of Maryland, College Park
155.9K papers, 7.2M citations

88% related

Arizona State University
109.6K papers, 4.4M citations

87% related

University of Colorado Boulder
115.1K papers, 5.3M citations

86% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202331
2022151
2021321
2020382
2019352
2018362