A novel image encryption algorithm in streaming mode is proposed which exhaustively employs an entire set of DNA complementary rules alongwith one dimensional chaotic maps. The proposed algorithm is highly efficient due to encrypting the subset of digital image which contains 92.125 % of information. DNA addition operation is carried out on this MSB part. The core idea of the proposed scheme is to scramble the whole image by means of piecewise linear chaotic map (PWLCM) followed by decomposition of image into most significant bits (MSB) and least significant bits (LSB). The logistic sequence is XORed with the decoded MSB and LSB parts separately and finally these two parts are combined to get the ciphered image. The parameters for PWLCM, logistic map and selection of different DNA rules for encoding and decoding of both parts of an image are derived from 128-bit MD5 hash of the plain image. Simulated experimental results in terms of quantitative and qualitative ways prove the encryption quality. Efficiency and robustness against different noises make the proposed cipher a good candidate for real time applications. 相似文献
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. 相似文献
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. 相似文献
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. 相似文献
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. 相似文献
To improve the performance of embedded processors, an effective technique is collapsing critical computation subgraphs as
application-specific instruction set extensions and executing them on custom functional units. The problem with this approach
is the immense cost and the long times required to design a new processor for each application. As a solution to this issue,
we propose an adaptive extensible processor in which custom instructions (CIs) are generated and added after chip-fabrication.
To support this feature, custom functional units are replaced by a reconfigurable matrix of functional units (FUs). A systematic
quantitative approach is used for determining the appropriate structure of the reconfigurable functional unit (RFU). We also
introduce an integrated framework for generating mappable CIs on the RFU. Using this architecture, performance is improved
by up to 1.33, with an average improvement of 1.16, compared to a 4-issue in-order RISC processor. By partitioning the configuration
memory, detecting similar/subset CIs and merging small CIs, the size of the configuration memory is reduced by 40%. 相似文献
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. 相似文献
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. 相似文献
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... 相似文献
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.