• Journal of the Korea Convergence Society
• /
• v.10 no.9
• /
• pp.265-272
• /
• 2019

In this study, 'poverty', which we think in our daily life, started from something. In particular, this study typified the perception of poverty by using the 'Q methodology', a subjective research method, to examine individual subjective opinions. The results of the analysis are as follows. is a "Retraction type", and poverty is a problem of 'Retention', 'Individual Effort Problem', 'Social Structure Problem', 'Low Status' and 'Laziness'. is a "Individual Problem type", and emphasizes 'Individual Effort Problem', 'Laziness', 'Incompetence', 'Starvation' and so on. is a "Basic Problem type", and emphasizes the basic element of life such as 'The Food and Shelter problem', 'Starvation', 'Laziness', and 'No Money'. is a "Resource Distribution Problem Type" that emphasizes the problem of resource allocation according to social structural problems. This study typifies the perception of poverty using subjectivity research method on 21st century and expects converging extension study to empirical studies for generalization.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.260-265
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.44-49
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.463-471
• /
• 2007

Because of MANET's dynamic characteristic, the hidden node problem can happen. Thus it must use with distributed channel access. In Ad hoc networks, carrier sense multiple access with collision avoidance(CSMA/CA) is one of the most widely used medium access control(MAC) schemes for asynchronous data traffics. However, CSMA/CA could not guarantee the quality of multimedia traffics. CSMA is a contention based protocol. Therefor once a node gets a channel, it can momopolze. Thus the fairness problem with channel starvation will happen. We will propose a new MAC protocol to guarantee QoS for multimedia data in ad hoc networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.776-796
• /
• 2010

Integrated RFID-WSNs (wireless sensor networks) have recently been researched to provide object identities, sensing information, mobile service, and network functionalities. In integrated RFID-WSNs, the reader collision is one of the critical problems. Above all, due to the absence of universally applicable anti-collision protocols and the channel capture phenomenon, the medium access control protocols in integrated RFID-WSNs suffer from reader collision and starvation problems. In this paper, we propose an efficient MAC protocol, called EMP, to avoid the above problems in integrated RFID-WSNs. EMP is a CSMA-based MAC protocol which is compatible with sensor networks operating on integrated nodes which consist of an RFID reader and a senor node. EMP resolves not only the reader collision problem, but also the starvation problem using a power control mechanism. To verify the performance of EMP, we compared it with other anti-reader collision MAC protocols using simulations. As a result, the performance of EMP showed improvements in throughput, system efficiency, and energy consumption compared to the single data channel protocols (CSMA/CA, Pulse, and DiCa) in dense deployment environments.

• Molecules and Cells
• /
• v.43 no.3
• /
• pp.236-250
• /
• 2020

Currently, many available anti-cancer therapies are targeting apoptosis. However, many cancer cells have acquired resistance to apoptosis. To overcome this problem, simultaneous induction of other types of programmed cell death in addition to apoptosis of cancer cells might be an attractive strategy. For this purpose, we initially investigated the inhibitory role of TRIP-Br1/XIAP in necroptosis, a regulated form of necrosis, under nutrient/serum starvation. Our data showed that necroptosis was significantly induced in all tested 9 different types of cancer cell lines in response to prolonged serum starvation. Among them, necroptosis was induced at a relatively lower level in MCF-7 breast cancer line that was highly resistant to apoptosis than that in other cancer cell lines. Interestingly, TRIP-Br1 oncogenic protein level was found to be very high in this cell line. Up-regulated TRIP-Br1 suppressed necroptosis by repressing reactive oxygen species generation. Such suppression of necroptosis was greatly enhanced by XIAP, a potent inhibitor of apoptosis. Our data also showed that TRIP-Br1 increased XIAP phosphorylation at serine87, an active form of XIAP. Our mitochondrial fractionation data revealed that TRIP-Br1 protein level was greatly increased in the mitochondria upon serum starvation. It suppressed the export of CypD, a vital regulator in mitochondria-mediated necroptosis, from mitochondria to cytosol. TRIP-Br1 also suppressed shikonin-mediated necroptosis, but not TNF-α-mediated necroptosis, implying possible presence of another signaling pathway in necroptosis. Taken together, our results suggest that TRIP-Br1/XIAP can function as onco-proteins by suppressing necroptosis of cancer cells under nutrient/serum starvation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.101-106
• /
• 2011

In this paper, our goal is to design the controller which operates a manufacturing system, discrete event system, guaranteeing user specification. In specially, based on supervisory control theory W. M. Wonham, our work consists in performing the controller using Petri nets possible parallelism. In addition, we consider the problem of allocation for resources sharing of the issues to consider when designing using Petri net. The controller can be generated by synthesis of user specification model and plant model after giving the management for the resource sharing. This created controller can control the deadlock and starvation which can occur in the case with resource sharing. Previous studies proposed the Constrained Synchronous Reachability graph to synthesis of the two Petri nets models. Therefore, we provide the controlled system which forbids a deadlock and starvation using the result of previous studies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1065-1071
• /
• 2009

Satellite application services can be divided into realtime services like voice communications and non-real time services like traditional data communications. To support both types of services on the same On-Board Switching(OBS), a scheduler which depends on their service classes is required. A fixed priority scheduling policy has a starvation problem. In this paper we propose a scheduling scheme based on premium and age. Premium is a fixed value which is given to a certain class of services. Age is another parameter of the scheduling policy and it will be increased by one for every scheduling cycle. The scheme we propose chooses a packet which has the largest sum of its age and premium. Simulation results indicate that the proposed approach shows better performance in both average cell delay and std-dev of cell delay for the lower class of service. There is no staying in infinite starvation state.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.71-74
• /
• 2000

Due to the complexity of parts flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A grouping heuristic to solve the buffer allocation problem is proposed. Computer simulation using Arena will be experimented to show the validation of the proposed algotithm.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.63-73
• /
• 2000

Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm to solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.