Fuzzy linear symmetrical bi-level programming is the most extensive problem in multi-level programming. A new method based on tolerance degree has been introduced in this paper. The method mainly concerns the modeling of complicated Supply Chain with bi-level Stackelberg structure. We analyze the reason lead to uncertainties in supply chain, summarize methods of dealing with uncertainties, and ...

The bi-level input processing model posits two levels of speech sound processing. In this model, context-bound allophones are encoded separately at a lower level of processing. If this is the case, second language learners should exhibit some facilitation effect when perceiving non-native phonemes that are used as context-bound allophones in their first language. Using a cue-weighting design, t...

We discuss the X-ray flux of gamma-ray burst afterglows at redshifts in the range 3-30, including the effects of the intergalactic He II absorption. We point out that strong X-ray lines may form locally in burst afterglows starting minutes after the trigger. This can provide distinctive X-ray distance indicators out to the redshifts where the first generation of massive stars form.

Systemic risk events constitute an important issue in current financial systems. A leading course of action used to mitigate such events is identification of systemically important agents in order to implement the prudential policies in a financial system. In this paper, a bi-level cross-shareholding network of the stock market is considered according to direct and integrated ownership structur...

We developed a low bitrate watercolor-like video form, which is constructed with a bi-level Y luminance component and a number of UV chrominance combinations. The bi-level Y-component outlines the features of an image and the UV-combinations describe the basic color information of the image. The UV combinations are dynamically chosen during encoding. The resultant video looks better than bi-lev...

We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V,E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E′ ⊂ E, covering T and r, such that the network induced by E′ is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T . ...

In congested urban areas, it remains a pressing challenge to reduce unnecessary vehicle circling for parking while at the same time maximize parking space utilization. In observance of new information technologies that have become readily accessible to drivers and parking agencies, we develop a dynamic non-cooperative bi-level model (i.e. Stackelberg leader-follower game) to set parking prices ...