«The Karma of Chicken Curry». Tibetan Masala films and youth narratives of exile

This essay offers a preliminary study of the cultural translation practices by young Tibetan exilic filmmakers in India, whose films, rather than rejecting the masala formula offered by Bollywood, have tentatively adapted it to the expectations of a Tibetan diasporic audience looking for a cinema capable of attending to the escapist needs of their minds while simultaneously catering to the intimate dreams of their hearts. I contend that Tashi Wangchuk and Tsultrim Dorjee’s first long feature Phun Anu Thanu (Two Exiled Brothers, 2006) is as an original film that presents a new offer on the menu of Tibetan diasporic films, a kind of spicy curry that has been advocated as a timely necessity and a yet-to-be-fulfilled desire

Multi-layer virtual transport network design

Service overlay networks and network virtualization enable multiple overlay/virtual networks to run over a common physical network infrastructure. They are widely used to overcome deficiencies of the Internet (e.g., resiliency, security and QoS guarantees). However, most overlay/virtual networks are used for routing/tunneling purposes, and not for providing scoped transport flows (involving all mechanisms such as error and flow control, resource allocation, etc.), which can allow better network resource allocation and utilization. Most importantly, the design of overlay/virtual networks is mostly single-layered, and lacks dynamic scope management, which is important for application and network management. In response to these limitations, we propose a multi-layer approach to Virtual Transport Network (VTN) design. This design is a key part of VTN-based network management, where network management is done via managing various VTNs over different scopes (i.e., ranges of operation). Our simulation and experimental results show that our multi-layer approach to VTN design can achieve better performance compared to the traditional single-layer design used for overlay/virtual networks.This work has been partly supported by National Science Foundation awards: CNS-0963974 and CNS-1346688

Learning from Profession Knowledge: Application on Knitting

Knowledge Management is a global process in companies. It includes all the processes that allow capitalization, sharing and evolution of the Knowledge Capital of the firm, generally recognized as a critical resource of the organization. Several approaches have been defined to capitalize knowledge but few of them study how to learn from this knowledge. We present in this paper an approach that helps to enhance learning from profession knowledge in an organisation. We apply our approach on knitting industry

Multi-layer virtual transport network management

Nowadays there is an increasing need for a general paradigm which can simplify network management and further enable network innovations. Software Defined Networking (SDN) is an efficient way to make the network programmable and reduce management complexity, however it is plagued with limitations inherited from the legacy Internet (TCP/IP) architecture. In this paper, in response to limitations of current Software Defined Networking (SDN) management solutions, we propose a recursive approach to enterprise network management, where network management is done through managing various Virtual Transport Networks (VTNs) over different scopes (i.e., regions of operation). Different from the traditional virtual network model which mainly focuses on routing/tunneling, our VTN provides communication service with explicit Quality-of-Service (QoS) support for applications via transport flows, and it involves all mechanisms (e.g., addressing, routing, error and flow control, resource allocation) needed to support such transport flows. Based on this approach, we design and implement a management architecture, which recurses the same VTN-based management mechanism for enterprise network management. Our experimental results show that our management architecture achieves better performance.National Science Foundation awards: CNS-0963974 and CNS-1346688

A recursive approach to network management

Nowadays there is an increasing need for a general management paradigm which can simplify network management and further enable network innovations. In this paper, in response to limitations of current Software Defined Networking (SDN) management solutions, we propose a recursive approach to enterprise network management, where network management is done through managing various Virtual Transport Networks (VTNs). Different from the traditional virtual network model which mainly focuses on routing/tunneling, our VTN provides communication service with explicit Quality-of-Service (QoS) support for applications via transport flows, and it involves all mechanisms (e:g:, routing, addressing, error and flow control, resource allocation) needed to support such transport flows. Based on this approach, we design and implement a management layer, which recurses the same VTN-based management mechanism for enterprise network management. Comparing with an SDN-based management approach, our experimental results show that our management layer achieves better network performance

Mitigating blind spot collision utilizing ultrasonic gap perimeter sensor

Failure to identify the vehicle by the side of the vehicle or in other word as blind spot area, especially larger vehicles are one of the causes of the accident. For some drivers, the simple solution is to place an additional side mirror. However, it is not the best solution because this additional side mirrors do not provide an accurate picture of actual or estimated distance to the object or another vehicle. The objective of this project is to identify the causes of automobile collisions, notably the side collision impact causes by the blind spot, to develop a system that can detect the presence vehicles on the side and to develop a system that are affordable for normal car users. To achieve this objective, flow chart was designed to help write coding using Arduino 1.0.2 and design hardware. This system can detect the obstacle within range 2cm to 320cm from the edge of the project vehicle. Before this system developed, the survey was conducted to determine what the driver wants. After that, the design process is carried out. The input to this system is Ping ultrasonic sensor, LCD, LED, and siren for the output part. LCD and LED were displaying the distance from the vehicle and the siren will be switched on to warn the driver when have obstacle in the blind spot area. As a conclusion, the Mitigating Blind Spot Collision Utilizing Ultrasonic Gap Perimeter Sensor System has successfully completed. This system able to detect the presence of other vehicles on the side of the project vehicle, especially in the blind spot area and will alert the driver when the vehicle is nearby when the alarm system is operated. The efficiency of this system to detect objects in the blind spot area is 79.82%. Others, it will give the display value less than one second after obstacle exists in front of the sensor. This operating time is most important because if the system is slow, the main function of this system to detect the obstacle in the blind spot area is not achieved

Sequential nonideal measurements of quantum oscillators: Statistical characterization with and without environmental coupling

A one-dimensional quantum oscillator is monitored by taking repeated position measurements. As a first con- tribution, it is shown that, under a quantum nondemolition measurement scheme applied to a system initially at the ground state, (i) the observed sequence of measurements (quantum tracks) corresponding to a single experiment converges to a limit point, and that (ii) the limit point is random over the ensemble of the experiments, being distributed as a zero-mean Gaussian random variable with a variance at most equal to the ground-state variance. As a second contribution, the richer scenario where the oscillator is coupled with a frozen (i.e., at the ground state) ensemble of independent quantum oscillators is considered. A sharply different behavior emerges: under the same measurement scheme, here we observe that the measurement sequences are essentially divergent. Such a rigorous statistical analysis of the sequential measurement process might be useful for characterizing the main quantities that are currently used for inference, manipulation, and monitoring of many quantum systems. Several interesting properties of the quantum tracks evolution, as well as of the associated (quantum) threshold crossing times, are discussed and the dependence upon the main system parameters (e.g., the choice of the measurement sampling time, the degree of interaction with the environment, the measurement device accuracy) is elucidated. At a more fundamental level, it is seen that, as an application of basic quantum mechanics principles, a sharp difference exists between the intrinsic randomness unavoidably present in any quantum system, and the extrinsic randomness arising from the environmental coupling, i.e., the randomness induced by an external source of disturbance.Comment: pages 16 Figures

Pricing differentiated brokered internet services

Price war, as an important factor in undercutting competitors and attracting customers, has spurred considerable work that analyzes such conflict situation. However, in most of these studies, quality of service (QoS), as an important decision-making criterion, has been neglected. Furthermore, with the rise of service-oriented architectures, where players may offer different levels of QoS for different prices, more studies are needed to examine the interaction among players within the service hierarchy. In this paper, we present a new approach to modeling price competition in service-oriented architectures, where there are multiple service levels. In our model, brokers, as the intermediaries between end-users and service providers, offer different QoS by adapting the service that they obtain from lower-level providers so as to match the demands of their clients to the services of providers. To maximize profit, players at each level, compete in a Bertrand game, while they offer different QoS. To maintain an oligopoly market, we then describe underlying dynamics which lead to a Bertrand game with price constraints at the providers' level. Numerical examples demonstrate the behavior of brokers and providers and the effect of price competition on their market shares.http://www.cs.bu.edu/fac/matta/Papers/sdp2016.pdfAccepted manuscrip

Improving distributed virtual network embedding with offline optimization

To cope with the complexity of the ever changing internet architecture, network virtualization services are vowed to play an important role in the future. To provide such solutions effectively, internet providers face the problem of optimizing the allocation of virtual networks on their physical resources. Since this problem is known to be NP-hard, heuristic based online solutions tend to provide better response time, however they lead to non-optimal solutions. This paper shows how a periodic live migration of virtual networks, using a state provided by offline optimization, can help an internet provider increase its virtual network load by up to 20%. Due to better packing of virtual load, some physical resources can also be shut down to save energy

An Adaptive Policy Management Approach to BGP Convergence

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently adopt a set of local policies that specify which routes it accepts and advertises from/to other networks, as well as which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme (APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially-conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts (policy conflict-avoidance vs. -control mode), each AS dynamically adjusts its own path preferences—increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the substability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, routing load, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.National Science Foundation (ANI-0095988, EIA-0202067, ITR ANI-0205294