• Title/Summary/Keyword: Value problem

Search Result 4,708, Processing Time 0.038 seconds

Fair Bit Allocation in Spatially Correlated Sensor Fields Using Shapley Value (공간 상관성을 갖는 센서장에서 섀플리 값을 이용한 공정한 비트 할당)

  • Sang-Seon Byun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.4
    • /
    • pp.195-201
    • /
    • 2023
  • The degree of contribution each sensor makes towards the total information gathered by all sensors is not uniform in spatially correlated sensor fields. Considering bit allocation problem in such a spatially correlated sensor field, the number of bits to be allocated to each sensor should be proportional to the degree of contribution the sensor makes. In this paper, we deploy Shapley value, a representative solution concept in cooperative game theory, and utilize it in order to quantify the degree of contribution each sensor makes. Shapley value is a system that determines the contribution of an individual player when two or more players work in collaboration with each other. To this end, we cast the bit allocation problem into a cooperative game called bit allocation game where sensors are regarded as the players, and a payoff function is given in the criteria of mutual information. We show that the Shapley value fairly quantifies an individual sensor's contribution to the total payoff achieved by all sensors following its desirable properties. By numerical experiments, we confirm that sensor that needs more bits to cover its area has larger Shapley value in spatially correlated sensor fields.

A 3-SAT Polynomial Time Algorithm Based on Minimum Frequency Literal-First Selection Method (최소 빈도수 문자 우선 선택 방법의 3-SAT 다항시간 알고리즘)

  • Sang-Un, Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.1
    • /
    • pp.157-162
    • /
    • 2023
  • To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. The algorithm firstly decides a truth value of a literal in sequence of previously-set priority. The priority order is as follows: a literal whose occurrence in a clause is 1(k=1), a literal which is k≥2 and whose truth value is either 0 or 1, and a literal with the minimum frequency. Then, literals whose truth value is determined are then deleted from clause T and the remaining clauses. This process is repeated l times, the number of literals. As a result, the proposed algorithm has been successful in accurately determining the satisfiability of a given equation f and in deciding the truth value of all the literals. This paper, therefore, provides not only a linear-time algorithm as a viable solution to the SAT problem, but also a basis for solving the P versus NP problem.

EXISTENCE OF NONNEGATIVE SOLUTIONS FOR BOUNDARY VALUE PROBLEMS

  • Kim, RakJoong
    • Korean Journal of Mathematics
    • /
    • v.17 no.4
    • /
    • pp.495-505
    • /
    • 2009
  • By means of Green function and fixed point theorem related with cone theoretic method we show that there exist multiple nonnegative solutions of a Dirichlet problem $$\array{-[p(t)x^{\prime}(t)]^{\prime}={\lambda}q(t)f(x(t)),\;t{\in}I=[0,\;T]\\x(0)=0=x(T)}$$, and a mixed problem $$\array{-[p(t)x^{\prime}(t)]^{\prime}={\mu}q(t)f(x(t)),\;t{\in}I=[0,\;T]\\x^{\prime}(0)=0=x(T)}$$, where ${\lambda}$ and ${\mu}$ are positive parameters.

  • PDF

A Genetic Algorithm for the Ship Scheduling Problem (선박운항일정계획 문제의 유전해법)

  • 이희용;김시화
    • Journal of the Korean Institute of Navigation
    • /
    • v.24 no.5
    • /
    • pp.361-371
    • /
    • 2000
  • This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

  • PDF

HOPF'S BOUNDARY TYPE BEHAVIOR FOR AN INTERFACE PROBLEM

  • Beygmohammadi, Maryam;Sweers, Guido
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.249-265
    • /
    • 2017
  • Interface problem here refers to a second order elliptic problem with a discontinuous coefficient for the second order derivatives. For the corresponding boundary value problem, the maximum principle still holds but Hopf's boundary point lemma may fail. We will give an optimal power type estimate that replaces Hopf's lemma at those boundary points, where this coefficient jumps.

A Damping Distribution Method for Inverse Kinematics Problem Near Singular Configurations (특이점 근방에서 역 기구학 해를 구하기 위한 자동 감쇄 분배 방법)

  • 성영휘
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.6
    • /
    • pp.780-785
    • /
    • 1998
  • In this paper, it is shown that the conventional methods for dealing with the singularity problem of a manipulator can be generalized as a local minimization problem with differently weighted objective functions. A new damping method proposed in this article automatically determines the damping amounts for singular values, which are inversely proportional to the magnitude of the singular values. Furthermore, this can be done without explicitly computing the singular values. The proposed method can be applied to all the manipulators with revolute joints.

  • PDF

ON COMPLEX VARIABLE METHOD IN FINITE ELASTICITY

  • Akinola, Ade
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.183-198
    • /
    • 2003
  • We highlight the alternative presentation of the Cauchy-Riemann conditions for the analyticity of a complex variable function and consider plane equilibrium problem for an elastic transversely isotropic layer, in finite deformation. We state the fundamental problems and consider traction boundary value problem, as an example of fundamental problem-one. A simple solution of“Lame's problem”for an infinite layer is obtained. The profile of the deformed contour is given; and this depends on the order of the term used in the power series specification for the complex potential and on the material constants of the medium.