The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Dynamic time warping algorithm is widely used in similar search of time series. However, large scales of route search in existing algorithms resulting in low operational efficiency. In order to improve the efficiency of dynamic time warping algorithm, this paper put forward an improved algorithm, which plans out a three rectangular area in the search area of the existing algorithms, search path won't...
This article describes several properties of the random problem space for the Subset Sum problem, derived both empirically and analytically. Empirical results support the conjecture that Subset Sum instances always have a solution when the input set S is a set of n elements with a maximum value of m, the target sum t is between m and the sum of the smallest n − 1 elements of S, and n ≥ ⌊m/2⌋ + 1....
An important and common prerequisite of many asymmetric cryptography systems is the availability of a secure mechanism for exchanging or distributing public keys. In this paper we compare two adaptive trust-based distributed schemes to deliver public keys in a peer-to-peer network. In such a scenario, centralized solutions, for example based on a certification authority or a public key infrastructure,...
To mitigate the soft-error effects for designing digital signal processing systems, a hierarchical evaluation algorithm is proposed in this paper, which is used to estimate the latent fault vulnerabilities based on the analysis of soft-error sensitive attributes. In this algorithm, the evaluated scales of sensitive attributes are devised for soft-error vulnerability factors of function modules. And...
The heterogeneous network (HetNet) which consists of several small cell base stations (BSs) and an overlaid macro cell BS is a promising solution to accomplish very high data rate and energy-efficient communication. The design of energy-efficient mechanisms and radio resource allocation among BSs is an important issue in HetNet. There are a variety of ON/OFF switching algorithms for BSs in the literature...
In this paper, we consider virtual machine (VM) placement problem for cloud data centers. Different from previous works, the VMs considered need to be conducted within a finite duration. However, due to the limited resource at physical machines (PMs), the VM may be unable to place on a single PM within duration. To make sure the successful placement, the VM may undergo several PMs for service, e.g...
Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of...
New strategies based on cognitive radio are being discussed to make a more efficient use of the HF band. Multiple users transmit in this band with a worldwide coverage but having multiple collisions with other HF stations. The use of the Upper Confidence Bound (UCB) algorithm is proposed in this work to provide them with a dynamic spectrum access mitigating mutual interference. Based on reinforcement...
When traffic arrives from the network for an idled mobile device, the network executes device activation procedures to wake the device up. Current device activation mechanisms are ill suited to support the expected growth of machine-to-machine (M2M) devices and traffic. We propose an adaptive device activation architecture for LTE/EPC cellular networks that adapts to network conditions and M2M application...
Trust has always played a pivotal role among two individuals or parties in decision making. But, trust is an entity which is not crisp. Due to its imprecise nature, the authors realized the importance of quantifying trust in the world of Internet i.e. while reading a blog of an unknown person or when one's friend writes something about him on a social networking site and also in the real world when...
In order to solve the collision problems between multiple RFID tags and improve the identification efficiency, this work presents an improved dynamic framed slotted ALOHA Anti-collision algorithm for RFID systems. Based on the time slot distribution information, the algorithm estimates the average number of tags in each collision slot and then dynamically sets the frame size for unrecognized tags...
We here propose geographical proximity based target-group formation algorithm to efficiently distribute advertisement messages of social-commerce services with device-to-device (D2D) communications. The convergence of D2D communications and the social-commerce services is able to invoke synergistic effects because the D2D users can voluntarily relay the messages to their neighbor users to obtain a...
Social-aware pervasive networks consider the users' social behavior to overcome intermittent end-to-end connectivity, inherent to this type of networking: forwarding decisions consider local knowledge about the behavior of nodes to predict future encounters. Complex Network Analysis (CNA) has been used to support contact prediction, by aggregating connectivity graphs into less volatile social graphs...
This paper considers the problem of delivering K different contents to D destinations from N sources in wireless networks. Traffic in opposite directions over two wireless hops can utilize the advantage of network coding (NC) in order to decrease the number of transmissions used. We call such coded hops as “NC-links”. On the other hand, the multicast (MC) links can transmit data to several nodes at...
The amorphous cells have emerged as a new paradigm to meet the fast increasing wireless capacity and coverage demands. Compared with the traditional cellular networks with hexagon-based deployments, the amorphous cells support mobile base stations (MBS) to form dynamic cell topologies, which can adapt to the group-movement behaviors of network loads. These amorphous cells are required to be self-organized...
This paper proposes the application of a quantum inspired reinforcement learning technique for spectrum assignment of wireless communication networks. The proposed technique aims to enhance the speed of learning convergence through the dependence of the decision process on a well ranked action desirability table which is updated based on the success or failure of an action. In addition, the exploration...
Wind farm layout orientation plays an important factor to reduce the total wake loss and hence increase the capacity factor of the wind farm. Different wind farms layout design optimization techniques are widely used and classified into five different types including, Pattern Search Algorithm (PSAs), Gradient Search Algorithms (GSAs), Greedy Heuristic Algorithms (GHAs), Simulated Annealing Algorithms...
Existing algorithms for orienting sensors in directional sensor networks have primarily concerned themselves with the problem of maximizing the number of covered targets, assuming that target identification as a non-issue. Such an assumption however, does not hold true in all situations. In this paper, a distributed heuristic algorithm for choosing active sensors and orienting them with the goal of...
This paper describes about compact approach for high dynamic range imaging in the mobile camera. The dynamic range of real world is much larger than that of the mobile sensor. So it's almost impossible to make high dynamic image with just one shot. This paper focuses on the small number of frames for high dynamic range imaging synthesis and the complexity of algorithm. With only one short and long...
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we show that the reverse minus domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees. For chordal graphs...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.