End-Node Security

2019 ◽  
pp. 45-69
Author(s):  
Antonio Skarmeta ◽  
Dan Garcia Carrillo ◽  
Alexis Olivereau
Keyword(s):  
End Node

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals Penerapan Algoritma Minimax Pada Game Macan-macanan

2016 ◽  
Vol 6 (1) ◽  
pp. 21
Author(s):  
Kartika Imam Santoso ◽  
Farida Yunita ◽  
Nafi Projo Kusumo
Keyword(s):  
Artificial Intelligence ◽  
Computer Game ◽  
Terminal State ◽  
Technology Products ◽  
Object Based ◽  
Minimax Algorithms ◽  
Evaluation Algorithm ◽  
End Node ◽  
Intelligence Approach ◽  
Artificial Intelligence Approach

Lots of traditional games, but now the game is becoming obsolete. Many games were replaced with the modern game technology products. Modern games are becoming more practical because it did not require the terrain and many friends. Quite alone in front of the screen was a person may engage in an exciting game. One of the efforts to preserve and disseminate traditional games one of which is macan-macanan is to adapt the game into a computer game. This study aims to apply artificial intelligence using minimax algorithms and programming language ActionScript 3 in the game with a macan-macanan research methods are prototyping. The design used in this study is an artificial intelligence approach for representing the state, science, human computer interaction for designing the user experience, as well as the UML for object-based design. Results from this study is that in order to determine the value of the evaluation algorithm minimax for the end node / terminal state in the game macan-macanan, required the calculation of the total step is valid for each piece, as well as to pawn macan, necessary calculations springboard to a higher value and the weight difference the appropriate type of pawns.

Resource Acquisition from Set-Top-Boxes for Service Provision

2013 ◽  
Vol 5 (3) ◽  
pp. 19-34
Author(s):  
Joseph So Chi-ho ◽  
Po-choi Wong
Keyword(s):  
Service Provision ◽  
Load Distribution ◽  
Low Cost ◽  
Service Level Agreement ◽  
Service Level ◽  
Resource Acquisition ◽  
Rational Decision ◽  
Quality Requirement ◽  
Acquisition Scheme ◽  
End Node

Resource Acquisition service is a network-based service that acquires sufficient resources to satisfy the application requirement. Set-top-boxes (STB) are good sources of resource providers delivering this type of service collaboratively. Unfortunately, the accessibility of STBs is controlled by end-node users. It leads to uncertainty of the amount of resource available to the service operators. As an incentive, STB holders acting as resource provider can be remunerated for sharing the resources. Resource acquisition schemes can explore the available resources and provide the upper layer applications with sufficient resources to satisfy the requirements in service level agreement. A remuneration model is developed to reflect the rational decision of resource providers. The authors investigate the resource acquisition scheme under various load distribution and topologies of peer neighbourhood and find that cost-aware Requisition Algorithm can improve the service quality requirement fulfilment in a low cost.

scholarly journals SLA-aware resource scheduling algorithm for cloud storage

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Yong Wang ◽  
Xiaoling Tao ◽  
Feng Zhao ◽  
Bo Tian ◽  
Akshita Maradapu Vera Venkata Sai
Keyword(s):  
Cloud Computing ◽  
Cloud Storage ◽  
Scheduling Algorithm ◽  
The Public ◽  
Computing Paradigm ◽  
Self Service ◽  
End Node ◽  
Violation Rate ◽  
And Storage ◽  
Compare And Contrast

AbstractCloud computing is a novel computing paradigm, which connects plenty of computing resources and storage resources via Internet. Cloud computing provides a number of high-quality services, such as cloud storage, outsourcing computing, and on-demand self-service, which have been widely accepted by the public. In cloud computing, by submitting their tasks to cloud, plenty of applications share huge computation and storage resources. However, how to schedule resource efficiently is a big challenge in cloud computing.In this paper, we propose a SLA-aware resource algorithm to enable cloud storage more efficiently. In our scheme, we take advantage of the back-end node space utilization and I/O throughput comprehensively simultaneously. We compare and contrast the existing scheduling storage policies by implementing those algorithms. The extensive tests show that our algorithm achieves a considerable improvement in terms of violation rate and the number of used hosts.

scholarly journals An approach for real-time motion planning of an inchworm robot in complex steel bridge environments

Robotica ◽  
2016 ◽  
Vol 35 (6) ◽  
pp. 1280-1309 ◽  
Author(s):  
David Pagano ◽  
Dikai Liu
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Real Time ◽  
Line Of Sight ◽  
Steel Bridge ◽  
Time Motion ◽  
3D Environments ◽  
3D Scenarios ◽  
End Node ◽  
2D And 3D

SUMMARYPath planning can be difficult and time consuming for inchworm robots especially when operating in complex 3D environments such as steel bridges. Confined areas may prevent a robot from extensively searching the environment by limiting its mobility. An approach for real-time path planning is presented. This approach first uses the concept of line-of-sight (LoS) to find waypoints from the start pose to the end node. It then plans smooth, collision-free motion for a robot to move between waypoints using a 3D-F2algorithm. Extensive simulations and experiments are conducted in 2D and 3D scenarios to verify the approach.

scholarly journals Time Switching Based Wireless Powered Relay Transmission with Uplink NOMA

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5467
Author(s):  
Zhihua Lin ◽  
Shihua Cao ◽  
Jianqing Li
Keyword(s):  
Multiple Access ◽  
Relay Node ◽  
Base Station ◽  
Spectrum Efficiency ◽  
Transmission Model ◽  
System Throughput ◽  
Time Switching ◽  
Power Domain ◽  
End Node ◽  
Save Energy

Non-orthogonal multiple access (NOMA) utilizes power domain multiplexing to improve spectrum efficiency compared with orthogonal multiple access (OMA). In the Internet of Things (IoT) uplink NOMA networks, if the channel between the far-end node and the base station is in deep fading, allocating larger transmitting power for this node cannot achieve higher spectrum efficiency and overall system throughput. Relay cooperative communication reduces the transmitting power at the far-end node but leads to extra energy expenditure at the relay node. Fortunately, simultaneous wireless information and power transfer (SWIPT) is advocated in energy-constrained IoT networks to save energy consumption. However, early works all focus on energy harvesting (EH) from one source node or one dedicated power supply station. In this paper, we propose a time switching based wireless powered relay transmission model with uplink NOMA where our EH technique can harvest energy from two simultaneously transmitting nodes. More importantly, by optimizing relay position more energy is harvested from the near-end node at the relay and relay signal attenuation to the destination is reduced as well. Furthermore, the closed-form expressions of outage probability and overall system throughput are derived, and numerical results prove that NOMA in our EH scheme achieves better performance compared to the traditional EH scheme and OMA by optimizing the position of the relay node, time switching factor and so on.

Sign in / Sign up

Export Citation Format

Share Document