Abstract
High-level synthesis (HLS) is of paramount importance to enable software developers to map critical computations to FPGA-based hardware accelerators. However, in order to generate efficient hardware accelerators one needs to apply significant code transformations and adequately use the directive-driven approach, part of most HLS tools. The code restructuring and directives needed are dependent not only of the characteristics of the input code but also of the HLS tools and target FPGAs. These aspects require a deep knowledge about the subjects involved and tend to exclude software developers. This paper presents our recent approach for automatic code restructuring targeting HLS tools. Our approach uses an unfolded graph representation, which can be generated from program execution traces, and graph-based optimizations, such as folding, to generate suitable HLS C code. In this paper, we describe the approach and the new optimizations proposed. We evaluate the approach with a number of representative kernels and the results show its capability to generating efficient hardware implementations only achievable using manual restructuring of the input software code and manual insertion of adequate HLS directives.

Abstract
The most current forecasts point to a decrease in the amount of potable water available. This increase in water scarcity is a problem with which sustainable agricultural production is facing. This has led to an increasing search for technical solutions in order to improve the efficiency of irrigation systems. In this context, this work describes the architecture of an agent-based network and the cyberphysical elements which will be deployed in a strawberry fertigation production plant. The operation of this architecture relies on local information provided by LoRA based wireless sensor network that is described in this paper. Using the information provided by the array of measurement nodes, cross-referenced with local meteorological data, grower experience and the actual crop vegetative state, it will be possible to better define the amount of required irrigation solution and then to optimise the water usage.

Abstract
Finding important nodes is a classic task in network science. Nodes are important depending on the context; e.g., they can be (i) nodes that, when removed, cause the network to collapse or (ii) influential spreaders (e.g., of information, or of diseases). Typically, central nodes are assumed to be important, and numerous network centrality measures have been proposed such as the degree centrality, the betweenness centrality, and the subgraph centrality. However, centrality measures are not tailored to capture one particular kind of important nodes: dominant nodes. We define dominant nodes as nodes that dominate many others and are not dominated by many others. We then propose a general graphlet-based measure of node dominance called graphlet-dominance (GD). We analyze how GD differs from traditional network centrality measures. We also study how certain parameters (namely the importance of dominating versus not being dominated and indirect versus direct dominances) influence GD. Finally, we apply GD to author ranking and verify that GD is superior to PageRank in four of the five citation networks tested.

Abstract
The hypergraph-of-entity is a joint representation model for terms, entities and their relations, used as an indexing approach in entity-oriented search. In this work, we characterize the structure of the hypergraph, from a microscopic and macroscopic scale, as well as over time with an increasing number of documents. We use a random walk based approach to estimate shortest distances and node sampling to estimate clustering coefficients. We also propose the calculation of a general mixed hypergraph density based on the corresponding bipartite mixed graph. We analyze these statistics for the hypergraph-of-entity, finding that hyperedge-based node degrees are distributed as a power law, while node-based node degrees and hyperedge cardinalities are log-normally distributed. We also find that most statistics tend to converge after an initial period of accentuated growth in the number of documents.

Abstract

Abstract
There is a great worldwide desire to launch new technology-based business. In this sense, and increasingly, entrepreneurship courses have arisen in several universities and many of the courses in the management, administration and engineering areas already offer entrepreneurship curricular units. Throughout those programs, the teams develop key integrated competencies in innovation, entrepreneurship and technology that will ultimately enable the students to create and develop new technology-based businesses. The Business Plan Reference Manual for IT Businesses provides a reference manual for undergraduate and graduate students that intend to launch their start-up business in the IT field. It helps them to create and model the business plan of their business. Therefore, this manual is mainly aimed at instructors who want to offer a practical view of the process of modeling, designing and developing an IT start-up. Additionally, it can be individually used by entrepreneurs who wish to launch their start-up businesses in IT field. The structure of the book was defined taking into account different approaches to the construction of the business plan, which basically consider a disaggregation of some of these chapters in others smaller (e.g., marketing plan into products/services and market, financial plan into investment plan and economic-financial projections). We chose to aggregate these dimensions into a single chapter, which in our view facilitates the process of analyzing a business plan. It is also relevant to mention the inclusion of "Chapter V - Prototype description" which is innovative and intends to take into account the application of this business plan template to the information technology sector. © 2018 River Publishers. All rights reserved.