Flow logic is a \fast prototyping" approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the ow logic as well as in the operational semantics may inhibit proving the analysis correct. Our main conclusion is that environment based semantics is more exible than either substit...

We present a complete algorithm for the uniication of higher-order patterns modulo the associative-commutative theory of some constants +1; : : : ; +n. Given an AC-uniication problem over higher-order patterns, the output of the algorithm is a nite set DAG solved forms 9], constrained by some exible-exible equations with the same head on both sides. Indeed, in the presence of AC constants, such...

An interesting application of Cmfp is for the case when the capacities of the arcs in the network are not fixed but can be increased at certain costs per unit (see e.g. [Ful59, KNR98, SK98]). One is allowed to spend a certain budget for raising capacities and wishes to maximize the throughput. This network improvement problem can be formulated as an instance of Cmfp where the cost functions on ...

We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman, Ostrovsky, and Schwarz (2007) and Varian (2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price (GSP) auctions. However, bidders often have to set their daily budgets when they participate in an auction; on...

We characterize the efficiency space of deterministic, dominant-strategy incentive compatible, individually rational and Pareto-optimal combinatorial auctions in a model with two players and k nonidentical items. We examine a model with multidimensional types, private values and quasilinear preferences for the players with one relaxation: one of the players is subject to a publicly known budget...

We propose algorithms for developing (1) a rigid (constrained) and (2) a exible planetary gearbox model. The two methods are compared against each other and advantages/disadvantages of each method are discussed. The rigid model (1) has gear tooth reaction forces expressed by Lagrange multipliers. The exible approach (2) is being compared with the gear tooth forces from the rigid approach, rst w...

Suppose that a government wishes to distribute a resource such as public land or radio spectrum. A natural option is to sell it at the market-clearing price, via a standard auction, but other methods have a long history, as the passage above indicates. Land was assigned on a first-come first-served basis during the 1889 Oklahoma Land Rush. In many countries, new housing units may be subject to ...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

Feature selection is an important problem in machine learning and data mining. We consider the problem of selecting features under the budget constraint on the feature subset size. Traditional feature selection methods suffer from the "monotonic" property. That is, if a feature is selected when the number of specified features is set, it will always be chosen when the number of specified featur...