http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Weiming Lin,Jaime F Modiano,Daisuke Ito 대한수의학회 2017 Journal of Veterinary Science Vol.18 No.1
The expression of stage-specific embryonic antigens (SSEAs) was determined in several types of canine cancer cells. Flow cytometry showed SSEA-1 expression in glioblastoma, melanoma, and mammary cancer cells, although none expressed SSEA-3 or SSEA-4. Expression of SSEA-1 was not detected in lymphoma, osteosarcoma, or hemangiosarcoma cell lines. Relatively stable SSEA-1 expression was observed between 24 and 72 h of culture. After 8 days in culture, sorted SSEA-1− and SSEA-1+ cells re-established SSEA-1 expression to levels comparable to those observed in unsorted cells. Our results document, for the first time, the expression of SSEA-1 in several canine cancer cell lines.
Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information
Tripathi, Vishrant,Jones, Nicholas,Modiano, Eytan 한국통신학회 2023 Journal of communications and networks Vol.25 No.5
We consider the design of distributed scheduling algorithms that minimize Age of Information (AoI) in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a distributed Carrier Sense Multiple Access (CSMA) scheme that can mimic its performance. To that end, we propose a distributed protocol called Fresh-CSMA and show that in an idealized setting, Fresh-CSMA can match the scheduling decisions of the max-weight policy with high probability in each frame, and also match the theoretical performance guarantees of the max-weight policy over the entire time horizon. We then consider a more realistic setting and study the impact of protocol parameters on the probability of collisions and the overhead caused by the distributed nature of the protocol. We also consider the monitoring of Markov sources and extend our approach to CSMA protocols that incorporate Age of Incorrect Information (AoII) instead of AoI. Finally, we provide simulations that support our theoretical results and show that the performance gap between the ideal and realistic versions of Fresh-CSMA is small.
A Robust Optimization Approach to Backup Network Design With Random Failures
Johnston, Matthew,Hyang-Won Lee,Modiano, Eytan IEEE 2015 IEEE/ACM transactions on networking Vol.23 No.4
<P>This paper presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffic is rerouted through a preplanned path in the backup network. We introduce a novel approach for dealing with random link failures, in which probabilistic survivability guarantees are provided to limit capacity over provisioning. We show that the optimal backup routing strategy in this respect depends on the reliability of the primary network. Specifically, as primary links become less likely to fail, the optimal backup networks employ more resource sharing among backup paths. We apply results from the field of robust optimization to formulate an ILP for the design and capacity provisioning of these backup networks. We then propose a simulated annealing heuristic to solve this problem for large-scale networks and present simulation results that verify our analysis and approach.</P>