Brightness Adjustment for Foldable Displays

When placed in a folded configuration, foldable computing-device displays include several different portions such as a front, back, exterior, or interior portion. In practical operation, various portions of the foldable display will be in an active or illuminated condition for different lengths of time, which can result in one or more of the portions of the display appearing to be brighter than adjacent portions because of variations in display decay. A boundary or stark dividing line between two adjacent portions of differing brightness can be distracting to a user when the foldable computing-device display is used in a fully-extended configuration. To reduce the appearance of brightness variation, the brightness of a brighter of two adjacent portions can be reduced or the brightness of a dimmer portion of the two adjacent can be increased in a gradient pattern in a transition region between the two adjacent portions of the foldable display

Strategic Analysis and Model Construction on Conflict Resolution with Motion Game Theory

This research uses the “Participating Observation Method” to observe the interaction between manufacturer and distributor negotiation strategies, determine the preference and expectation of participants, and establish a framework for this type of research. Then it sets up the “analysis framework of negotiation strategies” between the manufacturer and the distributor based on an analysis of the respective conditions, advantages, and disadvantages of the manufacturer and distributor. Thirdly, this study sets up a reward matrix of the strategy action game between the manufacturer and the distributor. Then establishes a set of feasible “negotiation models” based on the reward matrix of the strategy game between the both parties to observe how the manufacturer and the distributor make their own bargaining decisions in the situation of information asymmetry or exterior opportunity/threat. Finally, this study establishes a “multi-agent strategy game protocol system model” to solve the conflict resulting from the self-strategizing of both parties for their own interests, and to achieve the utmost efficiency in the negotiation

Topological entanglement entropy for torus knot bipartitions and the Verlinde-like formulas

The topological R\'enyi and entanglement entropies depend on the bipartition of the manifold and the choice of the ground states. However, these entanglement quantities remain invariant under a coordinate transformation when the bipartition also undergoes the same transformation. In the context of topological quantum field theories, these coordinate transformations reduce to representations of the mapping class group on the manifold of the Hilbert space. We employ this invariant property of the R\'enyi and entanglement entropies under coordinate transformations for TQFTs in (2 + 1) dimensions on a torus with various bipartitions. By utilizing the replica trick and the surgery method to compute the topological R\'enyi and entanglement entropies, the invariant property results in Verlinde-like formulas. Furthermore, for the bipartition with interfaces as two non-intersecting torus knots, an $SL(2, \mathbb{Z})$ transformation can untwist the torus knots, leading to a simple bipartition with an effective ground state. This invariant property allows us to demonstrate that the topological entanglement entropy has a lower bound $-2 \ln D$, where $D$ is the total quantum dimensions of the system.Comment: ref.[20] is corrrected to Phys. Rev. Lett. 98, 060401 (2007); Fig. 3.15 is also modifie

Obstacle-Resistant Deployment Algorithms for Wireless Sensor Networks

[[abstract]]Node deployment is an important issue in wireless sensor networks (WSNs). Sensor nodes should be efficiently deployed in a predetermined region in a low-cost and high-coverage-quality manner. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment and, therefore, increase hardware costs and create coverage holes. This paper presents the efficient obstacle-resistant robot deployment (ORRD) algorithm, which involves the design of a node placement policy, a serpentine movement policy, obstacle-handling rules, and boundary rules. By applying the proposed ORRD, the robot rapidly deploys a near-minimal number of sensor nodes to achieve full sensing coverage, even though there exist unpredicted obstacles with regular or irregular shapes. Performance results reveal that ORRD outperforms the existing robot deployment mechanism in terms of power conservation and obstacle resistance and, therefore, achieves better deployment performance.[[incitationindex]]SC