In NB-IoT systems, UEs with poor signal quality employ more repetitions to compensate for additional signal attenuation. Excessively high CE levels and repetitions of UEs lead to wastage of valuable wireless resources, whereas inadequate CE levels and repetitions result in data retrieval failure at the receiving end. Therefore, a machine learning-based adaptive repetition scheme for a 3GPP NB-IoT system is proposed in this work to effectively improve overall network transmission efficiency. The results of simulation show the effect of the discount factor? on the convergence behavior of the proposed scheme, with a lower discount factor value denoting the myopic behavior of the proposed scheme, which results from the fact that it places more emphasis on immediate rewards. And the propose scheme is capable of effectively improving the average spectral efficiency.

Storage nodes are expected to be placed as an intermediate tier of large scale sensor networks for caching the collected sensor readings and responding to queries with benefits of power and storage saving for ordinary sensors. Nevertheless, an important issue is that the compromised storage node may not only cause the privacy problem, but also return fake/incomplete query results. We propose a simple yet effective dummy reading-based anonymization framework, under which the query result integrity can be guaranteed by our proposed verifiable top-$k$query (VQ) schemes. Compared with existing works, the VQ schemes have a fundamentally different design philosophy and achieve the lower communication complexity at the cost of slight detection capability degradation. Analytical studies, numerical simulations, and prototype implementations are conducted to demonstrate the practicality of our proposed methods.

A new efficient algorithm using the compressed domain features of H.264 INTRA frames is proposed for moving object extraction on huge video surveillance archives. To achieve searching efficiency, we propose to locate moving objects by scrutinizing only the INTRA frames in video surveillance archives in H.264 compressed domain with short GOP length. In the proposed structure, a modified codebook algorithm is designed to build the block-based background models from the INTRA coding features. Through the subtraction with the background codebook models, the foreground energy frame is filtered and normalized for detecting the existence of moving objects. To overcome the over-segmentation problem and enable the unsupervised searching, a new structure of hysteresis thresholding, where the thresholds are obtained automatically by an efficient algorithm, is adopted to extract foreground blocks. At the final step, the connected components labeling (CCL) and morphological filters are employed to obtain the list of moving objects. As shown in the experimental results, the proposed algorithm outperforms representative existing works.

Vehicular ad-hoc network (VANET) is a rapidly developing technology which supports vehicle-to-vehicle communications and vehicle-to-infrastructure communications. With the two types of communication modes, users can access the Internet via some devices such as CAR PCs and PDAs. With the Internet connection, many value-added applications can be developed. However, Internet connection for VANETs faces a great challenge: the high mobility of vehicles results in frequent handoffs, which may cause significant packet delay and packet losses. This paper examines the necessary steps involved in a VANET handoff process and reviews some related studies in the literature that reduces the handoff time for VANETs.

Telemedicine applications are evolving quickly as information technologies improve. New requirements from users and changes in business processes make it necessary to frequently alter applications. Developers are responsible for redesigning the applications on both the user and server sides to meet the latest requirements. This is both time consuming and expensive. A new approach is needed to improve the support of application construction and to reduce the costs involved. In this paper, we use OSGi as a platform, on which to combine components in order to form new functionalities used pervasively in different devices on the user side. Examples include cell phones, PDAs, and home gateways. For server side applications, we divided the health care system into several layers and combined the services provided by these modules using a loose-coupling mechanism - process choreography. When the requirements or system flows of the telemedicine server are changed, the proposed system can adapt to meet new needs by replacing the bundles on the edge server and reconfiguring the business process used in the health care system.

Peer-to-peer (P2P) communications have attracted a great deal of attention from the network research community in recent years. However, due to the fundamental limitations of wireless environments, providing reliable data availability for P2P applications over wireless ad hoc networks is still a major challenge. To address the problem, a distributed and randomised scheme based on self-avoiding walks is proposed. The scheme concatenates disparate network layers, with the goal of recovering from routing failures that disrupt P2P data accessibility. In addition, a probabilistic approach is presented that explores the tradeoffs between several system parameters. Some new analysis tools, such as path coupling, are utilised which provide a better understanding of the system's operations. That the proposed concepts and techniques make a significant contribution to the design of effective and efficient P2P applications in wireless ad hoc networks is believed.

Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-business

The object of the research was to develop a deployment management framework that supported dynamic reconfiguration for home gateway services. This system uses a Service Oriented Architecture (SOA) that contains four subsystems. These include: a management agent, a deployment management server, a process management module, and an operation portal. The architecture of this system not only improves the efficiency of application delivery, but also provides a platform that can effectively support process changes when needed.

As checking spam became part of our daily life, unsolicited bulk e-mails (UBE) have become unmanageable and intolerable. Bulk volume of spam e-mails delivering to mail transfer agents (MTAs) is similar to the effect of denial of services (DDoS) attacks as it dramatically reduces the dependability and efficiency of networking systems and e-mail servers. Spam mails may also be used to carry viruses and worms which could significantly affect the availability of computer systems and networks. There have been many solutions proposed to filter spam in the past. Unfortunately there is no silver bullet to deter spammers and eliminate spam mails. That is, in isolation, each of existing spam protection mechanisms has its own advantages and disadvantages. In this paper, we analyze the shortcomings of existing anti-spam solutions and propose a multi-faceted approach using the spam-resistible mail agent (SRMA), which provides the most advantages and the least disadvantages of existing anti-spam solutions. Our experiments show that the proposed SRMA is immune to existing spambots and the prototype proves to be effective, feasible and deployable.

Network survivability is a key issue in reliable WDM optical network design to assure the service guarantee to customers. Rather than conventional connection link/ path/subpath based protection switching scheme, we propose protection group (submesh)-based approach to fast recover traffic from single/multiple link/node failures. By the group-based spare resource discovery and exploitation, the local channel utilization of network are maximized and hence enhance the overall quality of protection. The simulation results show that the local resource utilization and restoration time are efficient under heavy load in the dynamic traffic environment over dense mesh backbone networks.

Redundant rows and columns have been used for years to improve the yield of DRAM fabrication. However, finding a memory repair solution has been proved to be an NP-complete problem. This paper presents an efficient algorithm, which is able to find a repair solution for shared spare memory arrays if a solution exists. The remarkable performance of the algorithm can be demonstrated by experimental results.

In this paper, we propose an algorithm to construct the ordered binary decision diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes isomorphic sub-problems and thus avoids redundant computations. The system reliability could be efficiently computed by the OBDD. Finally, we propose an approach to compute the importance measures for multiple components by traversing the OBDD only once. The correctness and the effectiveness of our approach are demonstrated by experiments on 30 benchmark networks. The experimental results on a 2-by-100 lattice network, which has 2/sup 99/ paths or 10,000 cuts, show an impressive improvement compared to the previous works using the sum of disjoint products method that have exponential complexity. The CPU time of our method, including the calculation of not only the reliability but also the importance measures, for a 100-stage lattice network is only about 0.24 seconds. Thus, this approach is very helpful for the reliability and sensitivity analysis of large networks.

Checkpointing protocols for distributed computing systems can also be applied to mobile computing systems, but the unique characteristics of the mobile environment need to be taken into account. In this paper, an improved time-based checkpointing protocol is proposed, which is suitable for mobile computing systems based on Mobile IP. The main improvement over a traditional time-based protocol is that our protocol reduces the number of checkpoints per checkpointing process to nearly minimum, so that fewer checkpoints need to be transmitted through the bandwidth-limited wireless links. The proposed protocol also performs very well in the aspects of minimizing the number and the size of messages transmitted in the wireless network. Therefore, the protocol brings very little overhead to a mobile host which has limited resource. Additionally, by integrating the improved timer synchronization technique, our protocol can also be applied to wide area networks.

We investigate a software reliability growth model (SRGM) based on the Non Homogeneous Poisson Process (NHPP) which incorporates a logistic testing effort function. Software reliability growth models proposed in the literature incorporate the amount of testing effort spent on software testing which can be described by an exponential curve, a Rayleigh curve, or a Weibull curve. However it may not be reasonable to represent the consumption curve for testing effort only by an exponential, a Rayleigh or a Weibull curve in various software development environments. Therefore, we show that a logistic testing effort function can be expressed as a software development/test effort curve and give a reasonable predictive capability for the real failure data. Parameters are estimated and experiments on three actual test/debug data sets are illustrated. The results show that the software reliability growth model with logistic testing effort function can estimate the number of initial faults better than the model with Weibull type consumption curve. In addition, the optimal release policy of this model based on cost reliability criterion is discussed.

The hyper-geometric distribution model (HGDM) of software reliability growth has been used for estimating the number of initial faults in a software program. Another important problem in the software development process is to determine when to stop testing and release the software. In this paper, we investigate the optimal release policies minimizing the total expected software cost with a scheduled software delivery time for the HGDM. The total expected software cost includes the penalty cost which should be paid by the manufacturer if the software is delivered after the scheduled delivery time. The main result is that the optimal release time can be determined and shown to be finite. Numerical examples illustrating the optimal software release problem are also presented.>

This paper presents a novel technique to map the minimum vertex cover and related problems onto the Hopfield neural networks. The proposed approach can be used to find near-optimum solutions for these problems in parallel, and particularly the network algorithm always yields minimal vertex covers. Further, the relationships between Boolean equations and arithmetic functions are presented. Based on these relationships, other NP-complete problems in graph theory can also be solved by neural networks. Extensive simulation was performed and the experimental results demonstrate that the network algorithm outperforms the well-known greedy algorithm for the vertex cover problem.>

Several new algorithms for matrix-matrix multiplications on hypercube multiprocessors are presented and evaluated based on the number of multiplications, additions, and transfers. The matrices to be multiplied are uniformly distributed to all processors of a hypercube system. Each processor owns some submatrices which are derived by dividing the source matrices. Each submatrix multiplication can now be performed independently within a processor. All the partial results are then summed up and transferred to a single processor. An orthogonal tree is used for efficient communication. The time complexity is O(log/sub 2/p) if p /spl times/ p processors are used. In addition, the UDD (Uniform Data Distribution) approach is employed when some processors do not work properly and the faulty effects have been detected. Two classes of fault patterns are considered and evaluated.>

Article Free Access Share on The sea-of-wires array synthesis system Authors: Ing-Yi Chen View Profile , Geng-Lin Chen View Profile , Fredrick J. Hill View Profile , Sy-Yen Kuo View Profile Authors Info & Claims DAC '93: Proceedings of the 30th international Design Automation ConferenceJuly 1993 Pages 188–193https://doi.org/10.1145/157485.164664Published:01 July 1993Publication History 2citation442DownloadsMetricsTotal Citations2Total Downloads442Last 12 Months13Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The development of efficient algorithms for constructing a flawless subarray from a defective VLSI/WSI (wafer scale integration) array is discussed. The array consists of identical elements such as processors or memory cells embedded in a switch lattice in the form of a rectangular grid, in contrast to the redundancy approach in which some elements are dedicated as spares, all the elements in the degradation approach are treated in a uniform way. Each element can be either fault-free or defective, and a subarray which contains no faulty element is derived under constraints of switching and routing mechanisms. Although extensive literature exists concerning spare allocation and reconfiguration in arrays with redundancy, little research has been published on optimal reconfiguration in a degradable array. A graph formulation is used to describe the problem, and reconfiguration is found to relate to finding an independent set of a graph. Efficient heuristic algorithms are presented to determine a target subarray from the defective host array.>