Data analytics involves choosing between many different algorithms and experimenting with possible combinations of those algorithms. Existing approaches however do not support scientists with the laborious tasks of ex...
详细信息
In this paper, an handwritten character recognition system based on acceleration is presented. The character recognition system using a 3-dimensional (3D) accelerometer, includes three procedures: original signal dete...
详细信息
In this paper, an handwritten character recognition system based on acceleration is presented. The character recognition system using a 3-dimensional (3D) accelerometer, includes three procedures: original signal detection, signal processing (preprocessing and quantization) and recognition/classification. In quantization procedure, Trajectory Orientation (TO) and Curve Feature (CF) are adopted and compared. In recognition procedure, Fully-connected Hidden Markov Model (HMM) and Left-Right HMM are both implemented and compared. The system, in the recognition of 10 Arabic numerals, achieves the Correct Rate(CR) of 99.05% and the Total Correct Rate (TCR) of 94.76%.
In today's high speed networks it is becoming increasingly challenging for network managers to understand the nature of the traffic that is carried in their network. A major problem for traffic analysis in this co...
详细信息
In today's high speed networks it is becoming increasingly challenging for network managers to understand the nature of the traffic that is carried in their network. A major problem for traffic analysis in this context is how to extract a concise yet accurate summary of the relevant aggregate traffic flows that are present in network traces. In this paper, we present two summarization techniques to minimize the size of the traffic flow report that is generated by a hierarchical cluster analysis tool. By analyzing the accuracy and compaction gain of our approach on a standard benchmark dataset, we demonstrate that our approach achieves more accurate summaries than those of an existing tool that is based on frequent itemset mining.
In this paper, we present a novel color-mood-aware technique to re-texture clothing in a photograph. An efficient classification algorithm is developed to classify clothing textures using color mood scheme. To re-text...
详细信息
Service composition is an effective way to build complex Web service applications. However, it is a challenge to handle failure recovery due to the uncertainty of service in distributed and heterogeneous environment. ...
详细信息
Service composition is an effective way to build complex Web service applications. However, it is a challenge to handle failure recovery due to the uncertainty of service in distributed and heterogeneous environment. This paper proposes an approach to handling failure recovery in service composition. Petri nets are used to model the different components of service composition, failure recovery rules and service selection strategies are given. Based on these, aspect-orientation is used to weave failure recovery concern into service composition, which includes failure warning concern, service selection concern and recovery concern, the weaving mechanism dynamically integrates these schemas into a failure recovery model. The operation semantics and related theories of Petri nets help prove its effectiveness and correctness. A case study and experimental results demonstrate the approach can simplify the failure recovery process, and improve the design quality of service composition.
Internet of Things (IoT) refers to the networked interconnection of everyday objects. IoT is an upcoming research field and is being regarded as the revolution in the world of communication because of its extensible a...
详细信息
Internet of Things (IoT) refers to the networked interconnection of everyday objects. IoT is an upcoming research field and is being regarded as the revolution in the world of communication because of its extensible applications in numerous fields. Due to open and self-assimilation nature of these networks they are highly prone to attacks. Because of this reason security is of primary concern here. The security attack can be of various types, the idea here is to prevent IoT networks from Distributed Denial of Service (DDoS) attack. The objective of Denial of Service (DoS) is to make the server resources unavailable to the intended user, and when several such DoS attacks are present in a network then the attack is known as a DDoS attack. Our strategy is to prevent DDoS attack in IoT networks by using Learning Automata (LA) concepts. In this paper, we present a Service Oriented Architecture (SOA) which is used as a system model for IoT here. SOA provides a platform to the developers using which they can develop various applications for IoT without any concern regarding the nature of the objects, thereby acting as a middleware. The DDoS prevention strategy has been targeted for the SOA based architecture for IoT. The simulation results show that the proposed scheme is effective in preventing DDoS attacks in IoT.
COQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logi...
详细信息
COQ is an interactive theorem proving tool. The paper abstractly describes the feature of COQ, the architecture and working modes of PLC program with the example of typical PLC. It also introduces the first-order logic syntax and semantics of Intuitionistic Logic. It briefly introduces the main Gallina language syntax elements, the corresponding use methods and main theorem proving tactic on COQ. The work has modeled kernel data type and basic statements and and the denotational semantics of PLC program with Gallina. It has given the correctness proof of PLC program based on theorem proving, i.e. based on semantics function the relationship of configuration between the before codes execution and the after is proved. The main purpose is to prove whether a PLC program satisfies certain nature within a scan period.
In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be ...
详细信息
In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential step-stone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1).
This paper looks into the problems faced by Underwater Sensor Networks (UWSNs), with regard to energy optimization and efficient data delivery. A new algorithm is proposed which uses the properties of a "Parabola...
详细信息
This paper looks into the problems faced by Underwater Sensor Networks (UWSNs), with regard to energy optimization and efficient data delivery. A new algorithm is proposed which uses the properties of a "Parabola" in order to transmit data packets from source to destination. The scheme is called the "Parabola-based Routing"(PBR) algorithm. The algorithm is adaptive, and transmits packets in hop-by-hop fashion. Each node in the scenario is aware of its location in the form of its Cartesian coordinates. These coordinates help the nodes in the formation of the parabola for packet sending, as well as in knowing the location of other nodes. The best suited node is selected every time so as to maintain low probability of data transmission failure and optimum energy consumption thereby, using greedy approach every time in selecting the node for packet transmission. In order, to maintain the packet delivery ratio, a hop-by-hop "acknowledgement process" has also been devised. We have validated the efficiency of our algorithm through simulation analysis. The simulation results indicate a better performance of PBR over DSR in both mobile and static scenarios.
Intrusion detection plays a very important role in network security system. It is proved to analyze the payload of network protocol and to model a payload-based anomaly detector (PAYL) can successfully detect outliers...
详细信息
暂无评论