JCB • VOLUME 182 • NUMBER 1 • 2008 2 ATHEROSCLEROSIS NEEDS SHC Liu et al. fi nd that an adaptor protein called Shc orchestrates the response of endothelial cells to stress caused by turbulent blood fl ow. In endothelial cells, alterations in blood fl ow are sensed by cell–cell junctions and cell–matrix adhesions, which can trigger infl ammation and the formation of atherosclerotic plaques. The ...

The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving a large instance. In this paper, we propose a size reduction algorithm which is based on the Lagrangi...

The collapse of Terra's algorithmic stablecoin UST shocked the cryptocurrency market. This study investigates underlying causes de-pegging event through an in- depth analysis token economics Terra blockchain. Using on-chain data, this identifies a misalignment in economic incentive structure blockchain protocol as key contributor to de-pegging. It is found that undercompensation when it was red...

While Carbon Dioxide based Enhanced Oil Recovery (CO2 -EOR) is often regarded as one of the most economically viable methods carbon capture, utilization and storage (CCUS), little known about existing CO2 supply contracts in -EOR industry. By studying a sample 103 sales U.S. 1980s 1990s, this paper aims to find out what drives key terms these contracts. In particular, special price adjustment c...

We are concerned with a variation of the standard 0–1 knapsack problem, where the values of items differ under possible S scenarios. By applying the ‘pegging test’ the ordinary knapsack problem can be reduced, often significantly, in size; but this is not directly applicable to our problem. We introduce a kind of surrogate relaxation to derive upper and lower bounds quickly, and show that, with...

We are concerned with a variation of the knapsack problem, the bi-objective max–min knapsack problem (BKP), where the values of items differ under two possible scenarios. We have given a heuristic algorithm and an exact algorithm to solve this problem. In particular, we introduce a surrogate relaxation to derive upper and lower bounds very quickly, and apply the pegging test to reduce the size ...