Games to induce specified equilibria

Media access protocols in wireless networks require each contending node to wait for a backoff time, chosen randomly from a fixed range, before attempting to transmit on a shared channel. However, nodes acting in their own selfish interest may not follow the protocol. In this paper, a static version of the problem is modeled as a strategic game played by non-cooperating, rational players (the nodes). The objective is to design a game which exhibits a unique, a priori mixed-strategy Nash equilibrium. In the context of the media access problem, the equilibrium of the game would correspond to nodes choosing backoff times randomly from a given range of values, according to the given distribution. We consider natural variations of the problems concerning the number of actions available to the players and show that it is possible to design such a game when there are at least two players that each have the largest number of possible actions among all players. In contrast, we show that if there are exactly two players with different number of actions available to them, then it becomes impossible to design a strategic game with a unique such Nash equilibrium.     

Approximate probabilistic optimization using exact-capacity-approximate-response-distribution (ECARD)

Probabilistic structural design deals with uncertainties in response (e.g. stresses) and capacity (e.g. failure stresses). The calculation of the structural response is typically expensive (e.g., finite element simulations), while the capacity is usually available from tests. Furthermore, the random variables that influence response and capacity are often disjoint. In previous work we have shown that this disjoint property can be used to reduce the cost of obtaining the probability of failure via Monte Carlo simulations. In this paper we propose to use this property for an approximate probabilistic optimization based on exact capacity and approximate response distributions (ECARD). In Approximate Probabilistic Optimization Using ECARD, the change in response distribution is approximated as the structure is re-designed while the capacity distribution is kept exact, thus significantly reducing the number of expensive response simulations. ECARD may be viewed as an extension of SORA (Sequential Optimization and Reliability Assessment), which proceeds with deterministic optimization iterations. In contrast, ECARD has probabilistic optimization iterations, but in each iteration, the response distribution is approximated so as not to require additional response calculations. The use of inexpensive probabilistic optimization allows easy incorporation of system reliability constraints and optimal allocation of risk between failure modes. The method is demonstrated using a beam problem and a ten-bar truss problem. The former allocates risk between two different failure modes, while the latter allocates risk between members. It is shown that ECARD provides most of the improvement from risk re-allocation that can be obtained from full probabilistic optimization.     

Energy Efficient Hardware Loop Based Optimization for CGRAs

Journal of Signal Processing Systems - Research interest and industry investment in edge computing solutions have increased dramatically in recent years. Consequent quest for balanced performance,...     

A Comparative Investigation of Optical and Structural Properties of Cu-Doped CdO-Derived Nanostructures

In this report, we studied various structural and optical properties of pure and copper-doped cadmium oxide (CdO) thin films. Nanostructured Cu-doped CdO films were deposited using sol–gel spin-coating technique. The structural and morphological changes have been observed by X-ray diffraction (XRD), field emission scanning electron microscopy (FE-SEM), and atomic force microscopy (AFM) studies. The optical and electrical properties of the pure and Cu-doped CdO thin films were studied by UV–vis spectroscopy and four-point probe method, respectively. The XRD peaks show the formation of nanocrystalline CdO with cubic face-centered crystal structure. The band gaps of the as deposited films were found in the range of 2.32–2.73 eV, while after doping, it decreases due to structural deformation. The electrical resitivity was found to decrease approximately ～10 in Cu-doped CdO thin films.     

Optimizing functionally graded nickel–zirconia coating profiles for thermal stress relaxation

The investigations on optimization of composite composition of nickel–zirconia for the functionally graded layered thermal barrier coating for the lowest but uniform stress field under thermal loading is presented. The procedure for obtaining temperature- and composition-dependent thermal and mechanical properties of various coating compositions is discussed. These material parameters were used in thermo-mechanical finite element stress analyses of a nickel substrate with the coating. The results showed that the Von-Mises stresses in the substrate and the interfaces were the lowest with the coating profile that followed a concave power law relationship with the index n ≈ 2.65.     

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×???×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box?(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a $\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1}An axis-parallel k-dimensional box is a Cartesian product R ₁×R ₂×⋅⋅⋅×R _k where R _i (for 1≤i≤k) is a closed interval of the form [a _i ,b _i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a ?1+\frac1clogn?^d-1\lfloor 1+\frac{1}{c}\log n\rfloor^{d-1} approximation ratio for any constant c≥1 when d≥2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard.     

Filtering Data Streams for Entity-Based Continuous Queries

The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and sensor networks) has been recently studied. By exploiting the maximum error (or tolerance) allowed in query answers, algorithms for reducing the use of system resources have been developed. In most of these works, however, query tolerance is expressed as a numerical value, which may be difficult to specify. We observe that in many situations, users may not be concerned with the actual value of an answer, but rather which object satisfies a query (e.g., "who is my nearest neighbor?”). In particular, an entity-based query returns only the names of objects that satisfy the query. For these queries, it is possible to specify a tolerance that is "nonvalue-based.” In this paper, we study fraction-based tolerance, a type of nonvalue-based tolerance, where a user specifies the maximum fractions of a query answer that can be false positives and false negatives. We develop fraction-based tolerance for two major classes of entity-based queries: 1) nonrank-based query (e.g., range queries) and 2) rank-based query (e.g., k-nearest-neighbor queries). These definitions provide users with an alternative to specify the maximum tolerance allowed in their answers. We further investigate how these definitions can be exploited in a distributed stream environment. We design adaptive filter algorithms that allow updates be dropped conditionally at the data stream sources without affecting the overall query correctness. Extensive experimental results show that our protocols reduce the use of network and energy resources significantly.     

Impacts of geographical knowledge, spatial ability and environmental cognition on image searches supported by GIS software

Google Earth search function was used to study the impacts of small-scale spatial ability, large-scale environmental cognition, and geographical knowledge on new technology usage. The participants were 153 junior high students from central Taiwan. Geography grades served as indicators of prior knowledge, mental rotation and abstract reasoning skills as indicators of spatial ability, and sketch maps of school neighborhoods as indicators of environmental cognition (including landmark representation, intersection representation, and frame of reference). Lastly, the authors announced the landmarks searching worksheet and asked the participants to accomplish 16 familiar and unfamiliar landmark searching tasks using Google Earth with keyword search function disabled. The result showed the strongest predictor of landmark searching performance is ‘frame of reference’ in environmental cognition, followed by ‘mental rotation’ of spatial ability, ‘landmark representation’ of environmental cognition, and geographical knowledge. Google Earth landmark searches require complex cognitive processing; therefore, our conclusion is that GIS-supported image search activities give students good practice of active knowledge construction.     

程序逻辑在幻想世界开花——访目标软件副总裁毛海滨

在游戏这个飞速发展的行业里,人们喜新厌旧,玩家们会随意拥立一个游戏的王者,也会多次在一刹那间把被奉为神作的游戏拉下神坛。单机游戏时代似乎已经与我们渐行渐远,不少人怀念那个时代纯粹的快乐,感叹时光不再复返,但有些东西却留了下来,恰如目标软件。 这个成立于1995年的中国游戏企业,经历过中国游戏的黎明时代和历史转型期,从这样的游戏公司身上,我们可以看到中国的游戏产业在诞生的过程中经历了怎样的分娩阵痛;从这样的游戏公司的管理者身上,我们可以看到,中国游戏行业的沧桑变化。 目标公司在历经了十几年的发展后,已经成为了国内游戏界的一流研发企业。现在,我们就来看看,这个企业是如何将中国自主研发战略坚持到底的。