Ontology-Centered Knowledge Management Using Information Retrieval Techniques

The paper argues that an effective solution to information and knowledge management (KM) needs of practitioners in the construction industry can be found in the provision of an adapted knowledge environment that makes use of user profiling and document summarization techniques based on information retrieval sciences. The conceptualization of the domain through ontology takes a pivotal role in the proposed knowledge environment and provides a semantic referential to ensure relevance, accuracy, and completeness of information. A set of KM services articulated around the selected ontology have been developed, using the Web services model, tested, and validated in real organizational settings. This provided the basis for formulating recommendations and key success factors for any KM project development.     

A survey on fraud and service misuse in voice over IP (VoIP) networks

The migration from circuit-switched networks to packet-switched networks necessitates the investigation of related issues such as service delivery, QoS, security, and service fraud and misuse. The latter can be seen as a combination of accounting and security aspects. In traditional telecommunication networks, fraud accounts for annual losses at an average of 3%–5% of the operators’ revenue and still increasing at a rate of more than 10% yearly. It is also expected that in VoIP networks, the situation will be worse due to the lack of strong built-in security mechanisms, and the use of open standards. This paper discusses the fraud problem in VoIP networks and evaluates the related available solutions.     

Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections

The problem of reconstructing a pattern of an object from its approximate discrete orthogonal projections in a 2-dimensional grid, may have no solution because the inaccuracy in the measurements of the projections may generate an inconsistent problem. To attempt to overcome this difficulty, one seeks to reconstruct a pattern with projection values having possibly some bounded differences with the given projection values and minimizing the sum of the absolute differences.

This paper addresses the problem of reconstructing a pattern with a difference at most equal to +1 or −1 between each of its projection values and the corresponding given projection value. We deal with the case of patterns which have to be horizontally and vertically convex and the case of patterns which have to be moreover connected, the so-called convex polyominoes. We show that in both cases, the problem of reconstructing a pattern can be transformed into a Satisfiability (SAT) Problem. This is done in order to take advantage of the recent advances in the design of solvers for the SAT Problem. We show, experimentally, that by adding two important features to CSAT (an efficient SAT solver), optimal patterns can be found if there exist feasible ones. These two features are: first, a method that extracts in linear time an optimal pattern from a set of feasible patterns grouped in a generic pattern (obtaining a generic pattern may be exponential in the worst case) and second, a method that computes actively a lower bound of the sum of absolute differences that can be obtained from a partially defined pattern. This allows to prune the search tree if this lower bound exceeds the best sum of absolute differences found so far.     

Target point‐based path‐following controller for a car‐type vehicle using bounded controls

In this paper, we have studied the control problem of target point‐based path following for car‐type vehicles. This special path‐following task arises from the needs of vision‐based guidance systems, where a given target point located ahead of the vehicle, in the visual range of the camera, must follow a specified path. A solution to this problem is developed through a nonlinear transformation of the path‐following problem into a reference trajectory tracking problem, by modeling the target point as a virtual vehicle. The use of target point complicates the control problem, as the development produces a first‐order nonlinear nonglobally Lipschitz differential equation with finite escape time. This problem is solved by using small control signals. Bounded feedback laws are designed to control the real vehicle's angular acceleration and the virtual vehicle's velocity, to achieve stability. The resulting controller is globally asymptotically stable with respect to the origin, the proof of which is derived from Lyapunov‐based arguments and a bootstrap argument. It is also shown that the use of exponentially convergent observers/differentiators does not affect the stability of the closed‐loop system. The effectiveness of this controller has been illustrated through simulations. Copyright © 2014 John Wiley & Sons, Ltd.     

Non-targeted analysis of tea by hydrophilic interaction liquid chromatography and high resolution mass spectrometry

Tea is the second most consumed beverage in the world and its consumption has been associated with numerous potential health benefits. Factors such as fermentation methods, geographical origin and season can affect the primary and secondary metabolite composition of tea. In this study, a hydrophilic interaction liquid chromatography (HILIC) method coupled to high resolution mass spectrometry in both positive and negative ionisation modes was developed and optimised. The method when combined with principal component analysis to analyse three different types of tea, successfully distinguished samples into different categories, and provided evidence of the metabolites which differed between them. The accurate mass and high resolution attributes of the mass spectrometric data were utilised and relative quantification data were extracted post-data acquisition on 18 amino acids, showing significant differences in amino acid concentrations between tea types and countries. This study highlights the potential of HILIC chromatography combined with non-targeted mass spectrometric methods to provide a comprehensive understanding of polar metabolites in plant extracts.     

Enhanced performance in the deteriorated area of multicrystalline silicon wafers by internal gettering

The deteriorated area of the multicrystalline silicon (mc‐Si) ingots grown by directional solidification, commonly known as the Red Zone, is usually removed before wafering. This area, characterized by poor minority carrier lifetime, is located on the sides, at the top, and the bottom of the mc‐Si ingots. In this study, the effect of internal gettering by oxygen precipitates and structural defects has been investigated on the bottom zone of a mc‐Si ingot. Nucleation and growth of oxygen precipitates as well as low temperature annealing were studied. Photoluminescence imaging, lifetime mapping, and interstitial iron measurements performed by μ‐PCD reveal a considerable reduction of the bottom Red Zone. An improvement of lifetime from below 1 µs to about 20 µs and a reduction of interstitial iron concentration from 1.32 × 10¹³ at/cm³ to 8.4 × 10¹⁰ at/cm³ are demonstrated in this paper. Copyright © 2013 John Wiley & Sons, Ltd.     

A new worm propagation threat in BitTorrent: modeling and analysis

Peer-to-peer (P2P) networking technology has gained popularity as an efficient mechanism for users to obtain free services without the need for centralized servers. Protecting these networks from intruders and attackers is a real challenge. One of the constant threats on P2P networks is the propagation of active worms. Recent events show that active worms can spread automatically and flood the Internet in a very short period of time. Therefore, P2P systems can be a potential vehicle for active worms to achieve fast worm propagation in the Internet. Nowadays, BitTorrent is becoming more and more popular, mainly due its fair load distribution mechanism. Unfortunately, BitTorrent is particularly vulnerable to topology aware active worms. In this paper we analyze the impact of a new worm propagation threat on BitTorrent. We identify the BitTorrent vulnerabilities it exploits, the characteristics that accelerate and decelerate its propagation, and develop a mathematical model of their propagation. We also provide numerical analysis results. This will help the design of efficient detection and containment systems.     

Graph-Based Radio Resource Sharing Schemes for MTC in D2D-based 5G Networks

Apart from the the increasing demand of smartphones in human-to-human (H2H) communications, the introduction of machine-to-machine (M2M) devices poses significant challenges to wireless cellular networks. In order to offer the ability to connect billion of devices to propel the society into a new era of connectivity in our homes, officies and smart cities, we design novel radio resource sharing algorithms in a H2H/M2M coexistence case to accommodate M2M communications while not severely degrading existing H2H services. We propose group-based M2M communications that share the same spectrum with H2H communications through device-to-device (D2D) communication, as one of the technology components of 5G architecture. First, we formulate radio resource sharing problem as a sum-rate maximization, problem for which the optimal solution is non-deterministic polynomial-time hard (NP-hard). To overcome the computational complexity of the optimal solution, we model the resource sharing problem as a bipartite graph, then propose a novel interference-aware graph-based resource sharing scheme using a fixed M2M transmit power. To further enhance the protection of H2H services, we introduce an adaptive power control mechanism into the interference-aware graph-based resource sharing scheme. M2M transmit power is efficiently adjusted using one among the two following alternative controllers, namely, either the proportional integral derivative (PID) or the fuzzy logic. The latter is proposed within the aim to assure the desired quality-of-service (QoS) of H2H users and increase the efficiency of M2M spectrum usage. In both cases (fixed and adaptive), a centralized and a semi-distributed instantiations are given. Simulation results show that adaptive M2M radio resource sharing scheme using fuzzy logic is the one that achieves the best compromise. In fact, it guarantees H2H performance in terms of throughput and fairness while maximizing the efficiency of M2M spectrum usage. Simulation results also show that in spite of its quite good performance, semi-distributed M2M resource sharing instantiation achieves them with a decline of up to 10% in terms of H2H throughput compared to the centralized instantiation. This is achieved through a markedly lower communication overhead.