Solving the Problem of Forbidden States in Discrete Event Systems: A Novel Systematic Method for Reducing the Number of Control Places

This paper deals with the problem of forbidden states in Discrete Event Systems modelled by non‐safe Petri Nets. To avoid these states, some Generalized Mutual Exclusion Constraints can be assigned to them. These constraints limit the weight sum of tokens in some places and can be enforced on the system using control places. When the number of these constraints is large, a large number of control places should be added to the system. In this paper, a method is presented to assign the small number of constraints to forbidden states using some states which cover the forbidden states. So, a small number of control places are added to the system leading to obtaining a maximally permissive controller.     

A Saturating Extension of an Output Feedback Controller for Internally Damped Euler‐Lagrange Systems

In this research, a novel extension of the passivity‐based output feedback trajectory tracking controller is developed for internally damped Euler‐Lagrange systems with input saturation. Compared with the previous output feedback controllers, this new design of a combined adaptive controller‐observer system will reduce the risk of actuator saturation effectively via generalized saturation functions. Semi‐global uniform ultimate boundedness stability of the tracking errors and state estimation errors is guaranteed by Lyapunov stability analysis. An application of the proposed saturated output feedback controller is the stabilization of a nonholonomic wheeled mobile robot with saturated actuators towards desired trajectories. Simulation results are provided to illustrate the efficiency of the proposed controller in dealing with the actuator saturation.     

Your comments matter: incorporating viewers’ comments for ranking online video content using bibliometrics

ABSTRACT

The quality of user-generated content over World Wide Web media is a matter of serious concern for both creators and users. To measure the quality of content, webometric techniques are commonly used. In recent times, bibliometric techniques have been introduced to good effect for evaluation of the quality of user-generated content, which were originally used for scholarly data. However, the application of bibliometric techniques to evaluate the quality of YouTube content is limited to h-index and g-index considering only views. This paper advocates for and demonstrates the adaptation of existing Bibliometric indices including h-index, g-index and M-index exploiting both views and comments and proposes three indices h_vc, g_vc and m_vc for YouTube video channel ranking. The empirical results prove that the proposed indices using views along with the comments outperform the existing approaches on a real-world dataset of YouTube.     

Controller Synthesis with Highly Simplified Linear Constraints

This paper deals with the problem of forbidden states in safe Petri nets to obtain a maximally permissive controller. To prevent the system from entering the forbidden states, assigning some constraints to them is possible. The constraints can be enforced on the system using control places. When the number of forbidden states is large, a large number of constraints should be assigned to them. This results in a large number of control places being added to the model of the system, which causes a complicated model. Some methods have been proposed to reduce the number of constraints. Nevertheless, they do not always give the best results. In this paper, two ideas are offered to reduce the number of constraints, giving a more simplified controller.     

“How do you know that I don’t understand?” A look at the future of intelligent tutoring systems

Many software systems would significantly improve performance if they could adapt to the emotional state of the user, for example if Intelligent Tutoring Systems (ITSs), ATM’s, ticketing machines could recognise when users were confused, frustrated or angry they could guide the user back to remedial help systems so improving the service. Many researchers now feel strongly that ITSs would be significantly enhanced if computers could adapt to the emotions of students. This idea has spawned the developing field of affective tutoring systems (ATSs): ATSs are ITSs that are able to adapt to the affective state of students. The term “affective tutoring system” can be traced back as far as Rosalind Picard’s book Affective Computing in 1997.This paper presents research leading to the development of Easy with Eve, an ATS for primary school mathematics. The system utilises a network of computer systems, mainly embedded devices to detect student emotion and other significant bio-signals. It will then adapt to students and displays emotion via a lifelike agent called Eve. Eve’s tutoring adaptations are guided by a case-based method for adapting to student states; this method uses data that was generated by an observational study of human tutors. This paper presents the observational study, the case-based method, the ATS itself and its implementation on a distributed computer systems for real-time performance, and finally the implications of the findings for Human Computer Interaction in general and e-learning in particular. Web-based applications of the technology developed in this research are discussed throughout the paper.     

Detection and classification of road signs in natural environments

An automatic road sign recognition system first locates road signs within images captured by an imaging sensor on-board of a vehicle, and then identifies the detected road signs. This paper presents an automatic neural-network-based road sign recognition system. First, a study of the existing road sign recognition research is presented. In this study, the issues associated with automatic road sign recognition are described, the existing methods developed to tackle the road sign recognition problem are reviewed, and a comparison of the features of these methods is given. Second, the developed road sign recognition system is described. The system is capable of analysing live colour road scene images, detecting multiple road signs within each image, and classifying the type of road signs detected. The system consists of two modules: detection and classification. The detection module segments the input image in the hue-saturation-intensity colour space, and then detects road signs using a Multi-layer Perceptron neural-network. The classification module determines the type of detected road signs using a series of one to one architectural Multi-layer Perceptron neural networks. Two sets of classifiers are trained using the Resillient-Backpropagation and Scaled-Conjugate-Gradient algorithms. The two modules of the system are evaluated individually first. Then the system is tested as a whole. The experimental results demonstrate that the system is capable of achieving an average recognition hit-rate of 95.96% using the scaled-conjugate-gradient trained classifiers.     

BSLPSDN: Base station location privacy via software-defined networking (SDN) in wireless sensor networks

Base station's location privacy in a wireless sensor network (WSN) is critical for information security and operational availability of the network. A key part of securing the base station from potential compromise is to secure the information about its physical location. This paper proposes a technique called base station location privacy via software-defined networking (SDN) in wireless sensor networks (BSLPSDN). The inspiration comes from the architecture of SDN, where the control plane is separated from the data plane, and where control plane decides the policy for the data plane. BSLPSDN uses three categories of nodes, namely, a main controller to instruct the overall operations, a dedicated node to buffer and forward data, and lastly, a common node to sense and forward the packet. We employ three kinds of nodes to collaborate and achieve stealth for the base station and thus protecting it against the traffic-analysis attacks. Different traits of the WSN including energy status and traffic density can actively be monitored by BSLPSDN, which positively affects the energy goals, expected life of the network, load on common nodes, and the possibility of creating diversion in the wake of an attack on the base station. We incorporated multiple experiments to analyze and evaluate the performance of our proposed algorithm. We use single controller with multiple sensor nodes and multiple controllers with multiple sensor nodes to show the level of anonymity of BS. Experiments show that providing BS anonymity via multiple controllers is the best method both in terms of energy and privacy.     

Deterministic Polymorphic Engineering of MoTe2 for Photonic and Optoelectronic Applications

Developing selective and coherent polymorphic crystals at the nanoscale offers a novel strategy for designing integrated architectures for photonic and optoelectronic applications such as metasurfaces, optical gratings, photodetectors, and image sensors. Here, a direct optical writing approach is demonstrated to deterministically create polymorphic 2D materials by locally inducing metallic 1T′-MoTe₂ on the semiconducting 2H-MoTe₂ host layer. In the polymorphic-engineered MoTe₂, 2H- and 1T′- crystalline phases exhibit strong optical contrast from near-infrared to telecom-band ranges (1–1.5 µm), due to the change in the band structure and increase in surface roughness. Sevenfold enhancement of third harmonic generation intensity is realized with conversion efficiency (susceptibility) of ≈1.7 × 10⁻⁷ (1.1 × 10⁻¹⁹ m² V⁻²) and ≈1.7 × 10⁻⁸ (0.3 × 10⁻¹⁹ m² V⁻²) for 1T′ and 2H-MoTe₂, respectively at telecom-band ultrafast pump laser. Lastly, based on polymorphic engineering on MoTe₂, a Schottky photodiode with a high photoresponsivity of 90 AW⁻¹ is demonstrated. This study proposes facile polymorphic engineered structures that will greatly benefit realizing integrated photonics and optoelectronic circuits.     

Performance improvement of OFDM systems using compressive sensing with group LASSO signal reconstruction algorithm

Wireless Networks - Orthogonal frequency division multiplexing (OFDM) has been investigated for the high-speed transmission of data in radio frequency and optical wireless communications. The OFDM...     

A new method for detecting various variants of GoF design patterns using conceptual signatures

Software design patterns are well-known solutions for solving commonly occurring problems in software design. Detecting design patterns used in the code can help to understand the structure and behavior of the software, evaluate the quality of the software, and trace important design decisions. To develop and maintain a software system, we need sufficient knowledge of design decisions and software implementation processes. However, the acquisition of knowledge related to design patterns used in complex software systems is a challenging, time-consuming, and costly task. Therefore, using a suitable method to detect the design patterns used in the code reduces software development and maintenance costs. In this paper, we proposed a new method based on conceptual signatures to improve the accuracy of design pattern detection. So we used the conceptual signatures based on the purpose of patterns to detect the patterns’ instances that conform to the standard structure of patterns, and cover more instances of patterns’ variants and implementation versions of the patterns and improve the accuracy of pattern detection. The proposed method is a specific process in two main phases. In the first phase, the conceptual signature and detection formula for each pattern is determined manually. Then in the second phase, each pattern in the code is detected in a semi-automatic process using the conceptual signature and pattern detection formula. To implement the proposed method, we focused on GoF design patterns and their variants. We evaluated the accuracy of our proposed method on five open-source projects, namely, Junit v3.7, JHotDraw v5.1, QuickUML 2001, JRefactory v2.6.24, and MapperXML v1.9.7. Also, we performed our experiments on a set of source codes containing the instances of GoF design patterns’ variants for a comprehensive and fair evaluation. The evaluation results indicate that the proposed method has improved the accuracy of design pattern detection in the code.