Joint data rate and power allocation for lifetime maximization in interference limited ad hoc networks

In this paper, we consider the following problem in the wireless ad hoc network: Given a set of paths between source and destination, how to divide the data flow among the paths and how to control the transmission rates, times, and powers of the individual links in order to maximize the operation time of the worst network node. If all nodes are of equal importance, the operation time of the worst node is also the lifetime of the network. By solving the problem, our aim is to investigate how the network lifetime is affected by link conditions such as the maximum transmission power of a node and the peak data rate of a link. For the purpose, we start from a system model that incorporates the carrier to interference ratio (CIR) into a variable data rate of a link. With this, we can develop an iterative algorithm for the lifetime maximization, which resembles to the distributed power control in cellular systems. Numerical examples on the iterative algorithm are included to illustrate the network lifetime as a function of the maximum transmission power and the peak data rate.     

An alternate quantum adiabatic evolution for the Deutsch–Jozsa problem

Deutsch–Jozsa algorithm has been implemented via quantum adiabatic evolutions by Das et al. (Phys Rev A 65:062310, 2002) and Wei et al. (Phys Lett A 354:271, 2006). In the latter literature, the authors have shown a modified version of the adiabatic evolution which can improve the performance of the algorithm of S. Das et al’s to constant time. In this paper, we also improve the algorithm of S. Das et al’s in a constant time but by using a different construction of adiabatic evolution, i.e., adding ancillary qubits. The algorithm in this paper provides an alternative option to potential users.     

Optimality of partial adiabatic search and its circuit model

In this paper, we first uncover a fact that a partial adiabatic quantum search with \(O(\sqrt{N/M})\) time complexity is in fact optimal, in which \(N\) is the total number of elements in an unstructured database, and \(M\) ( \(M\ge 1\) ) of them are the marked ones(one) \((N\gg M)\) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.     

Research on the group decision-making about emergency event based on network technology

In order to improve decision-making efficiency about emergency event, this paper proposes a novel concept, i.e., Agile-Delphi Method, which is an integration of agile decision and Delphi Method implicating that the decision-makers instantly deliver, respond, treat, and utilize information via Delphi process while conducting group decision-making about emergency event. The paper details the mechanism of group decision-making about emergency event based on network technology and Agile-Delphi Method. Finally, the paper conducts an empiric analysis taking the “111 event”, i.e., the liquid ammonia spill event happened on November 1, 2006 in a phosphorus chemical company in China, as an example.     

Extract conceptual graphs from plain texts in patent claims

This paper develops techniques to extract conceptual graphs from a patent claim using syntactic information (POS, and dependency tree) and semantic information (background ontology). Due to plenteous technical domain terms and lengthy sentences prevailing in patent claims, it is difficult to apply a NLP Parser directly to parse the plain texts in the patent claim. This paper combines techniques such as finite state machines, Part-Of-Speech tags, conceptual graphs, domain ontology and dependency tree to convert a patent claim into a formally defined conceptual graph. The method of a finite state machine splits a lengthy patent claim sentence into a set of shortened sub-sentences so that the NLP Parser can parse them one by one effectively. The Part-Of-Speech and dependency tree of a patent claim are used to build the conceptual graph based on the pre-established domain ontology. The result shows that 99% sub-sentences split from 1700 patent claims can be efficiently parsed by the NLP Parser. There are two types of nodes in a conceptual graph, the concept and the relation nodes. Each concept or relation can be extracted directly from a patent claim and each relation can link with a fixed number of concepts in a conceptual graph. From 100 patent claims, the average precision and recall of a concept class mapping from the patent claim to domain ontology are 96% and 89%, respectively, and the average precision and recall for Real relation class mapping are 97% and 98%, respectively. For the concept linking of a relation, the average precision is 79%. Based on the extracted conceptual graphs from patents, it would facilitate automated comparison and summarization among patents for judgment of patent infringement.     

Joint Learning in Innovative R&D Collaboration

The present study analyzes the mechanisms and facilitators behind joint learning in R&D collaborations by way of a qualitative comparative case study analyzing three supplier relationships and three internal R&D partnerships of the focal organization. The results suggest a single joint learning process for internal and external relationships in which the role of the customer and the facilitation of the joint learning process vary depending on the context. Whereas the role of motivation is central for joint learning in the internal relationships, mutual trust is important to the external relationships.     

A network approach to overcoming barriers to market engagement for SMEs in energy efficiency initiatives such as the Green Deal

The Green Deal (GD) was launched in 2013 by the UK Government as a market-led scheme to encourage uptake of energy efficiency measures in the UK and create green sector jobs. The scheme closed in July 2015 after 30 months due to government concerns over low uptake and industry standards but additional factors potentially contributed to its failure such as poor scheme design and lack of understanding of the customer and supply chain journey. We explore the role of key delivery agents of GD services, specifically SMEs, and we use the LoCal-Net project as a case study to examine the use of networks to identify and reduce barriers to SME market engagement. We find that SMEs experienced multiple barriers to interaction with the GD such as lack of access to information, training, and confusion over delivery of the scheme but benefited from interaction with the network to access information, improve understanding of the scheme, increasing networking opportunities and forming new business models and partnerships to reduce risk. The importance of SMEs as delivery agents and their role in the design of market-led schemes such as the GD are discussed with recommendations for improving SME engagement in green sector initiatives.     

Algorithm based decision support system for the concerted selection of equipment in machining/assembly cells

Equipment selection plays a major role in the performance of machining/assembly cells. Based on analytical algorithms, a decision support system (DSS) is developed to select machining centres and robots concurrently from the milieu available in the marketplace. The DSS evaluates the design and geometry of the mating parts that are to be processed and assembled by the cell. Accordingly, it recommends the machining centre and robot that maximize the cell's performance subject to various operational and budget constraints.     

Internationalisation for Survival: The Case of New Ventures

The aim is to deepen our understanding about the internationalisation–survival relationship in the case of new ventures in traditional manufacturing sectors. Hypotheses were tested through Cox’s proportional hazard regressions on a sample of 3,350 firms aged 10 years or less, from the textile-clothing and footwear industry in Spain. A vast majority of new ventures that were both established and closed down over that time are purely domestic firms. That means, a firm increases its likelihood of survival when it becomes international. The highest failure risk relates to those new ventures which are territorially agglomerated and are domestically oriented. Internationalisation is an unconditional strategy for surviving in the case of new manufacturing ventures. In addition, location and efficiency in the activity both matter when operating in international markets. Statistical tests show that an interactive effect of agglomeration and internationalisation exists, while no support for the interaction between age and internationalisation is found. Future research should investigate the trade-off between growth and survival forces to determine the optimum moment to go international and to characterise the strategic choices followed by those new ventures that survive longest.     

A framework for generating tunable test functions for multimodal optimization

Multimodal function optimization, where the aim is to locate more than one solution, has attracted growing interest especially in the evolutionary computing research community. To evaluate experimentally the strengths and weaknesses of multimodal optimization algorithms, it is important to use test functions representing different characteristics and various levels of difficulty. The available selection of multimodal test problems is, however, rather limited and no general framework exists. This paper describes an attempt to construct a software framework which includes a variety of easily tunable test functions. The aim is to provide a general and easily expandable environment for testing different methods of multimodal optimization. Several function families with different characteristics are included. The framework implements new parameterizable function families for generating desired landscapes. Additionally the framework implements a selection of well known test functions from the literature, which can be rotated and stretched. The software module can easily be imported to any optimization algorithm implementation compatible with the C programming language. As an application example, 8 optimization approaches are compared by their ability to locate several global optima over a set of 16 functions with different properties generated by the proposed module. The effects of function regularity, dimensionality and number of local optima on the performance of different algorithms are studied.