Proportional directional valve based automatic steering system for tractors

Most automatic steering systems for large tractors are designed with hydraulic systems that run on either constant flow or constant pressure. Such designs are limited in adaptability and applicability. Moreover, their control valves can unload in the neutral position and eventually lead to serious hydraulic leakage over long operation periods. In response to the problems noted above, a multifunctional automatic hydraulic steering circuit is presented. The system design is composed of a 5-way-3- position proportional directional valve, two pilot-controlled check valves, a pressure-compensated directional valve, a pressurecompensated flow regulator valve, a load shuttle valve, and a check valve, among other components. It is adaptable to most open-center systems with constant flow supply and closed-center systems with load feedback. The design maintains the lowest pressure under load feedback and stays at the neutral position during unloading, thus meeting the requirements for steering. The steering controller is based on proportional-integral-derivative (PID) running on a 51-microcontroller-unit master control chip. An experimental platform is developed to establish the basic characteristics of the system subject to stepwise inputs and sinusoidal tracking. Test results show that the system design demonstrates excellent control accuracy, fast response, and negligible leak during long operation periods.     

ARAP++: an extension of the local/global approach to mesh parameterization

Mesh parameterization is one of the fundamental operations in computer graphics (CG) and computeraided design (CAD). In this paper, we propose a novel local/global parameterization approach, ARAP++, for singleand multi-boundary triangular meshes. It is an extension of the as-rigid-as-possible (ARAP) approach, which stitches together 1-ring patches instead of individual triangles. To optimize the spring energy, we introduce a linear iterative scheme which employs convex combination weights and a fitting Jacobian matrix corresponding to a prescribed family of transformations. Our algorithm is simple, efficient, and robust. The geometric properties (angle and area) of the original model can also be preserved by appropriately prescribing the singular values of the fitting matrix. To reduce the area and stretch distortions for high-curvature models, a stretch operator is introduced. Numerical results demonstrate that ARAP++ outperforms several state-of-the-art methods in terms of controlling the distortions of angle, area, and stretch. Furthermore, it achieves a better visualization performance for several applications, such as texture mapping and surface remeshing.     

A social tag clustering method based on common co-occurrence group similarity

Social tagging systems are widely applied in Web 2.0. Many users use these systems to create, organize, manage, and share Internet resources freely. However, many ambiguous and uncontrolled tags produced by social tagging systems not only worsen users’ experience, but also restrict resources’ retrieval efficiency. Tag clustering can aggregate tags with similar semantics together, and help mitigate the above problems. In this paper, we first present a common co-occurrence group similarity based approach, which employs the ternary relation among users, resources, and tags to measure the semantic relevance between tags. Then we propose a spectral clustering method to address the high dimensionality and sparsity of the annotating data. Finally, experimental results show that the proposed method is useful and efficient.     

A semi-supervised privacy-preserving clustering algorithm for healthcare

With the proliferation of healthcare data, the cloud mining technology for E-health services and applications has become a hot research topic. While on the other hand, these rapidly evolving cloud mining technologies and their deployment in healthcare systems also pose potential threats to patient’s data privacy. In order to solve the privacy problem in the cloud mining technique, this paper proposes a semi-supervised privacy-preserving clustering algorithm. By employing a small amount of supervised information, the method first learns a Large Margin Nearest Cluster metric using convex optimization. Then according to the trained metric, the method imposes multiplicative perturbation on the original data, which can change the distribution shape of the original data and thus protect the privacy information as well as ensuring high data usability. The experimental results on the brain fiber dataset provided by the 2009 PBC demonstrated that the proposed method could not only protect data privacy towards secure attacks, but improve the clustering purity.     

Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks

Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally employed to overcome this problem. In this paper, a new reputation based scheme called probabilistic resource allocation is proposed. This strategy probabilistically decide whether to provide the resource to requesting peer or not. Aforesaid method gives selection preference to higher reputation peers and at the same time provides some finite probability of interaction between those peers who don’t have good reputation about each other. This avoids disconnection between the aforesaid peers. The proposed scheme also introduces a new mechanism for resource distribution which not only allocates resources based on peers’ reputation but simultaneously maximizes network utility also. Algorithm for formation of interest groups based upon both similarity of interests and reputation between peers is also presented.     

Adaptive,incentive and scalable dynamic tree overlay for P2P live video streaming

In this paper, we propose a new multicast tree framework to be used in peer-to-peer (P2P) live video streaming systems. The proposed system, adapts the tree links under high peer churn and runs in a totally distributed manner. In order to provide this dynamism and seamless streaming at the same time, we propose a cross layer design involving scalable video codec, backup parents and hierarchical clusters. The performance of the system is measured in real world environment PlanetLab that has nodes distributed all over the world. The experiments show that the proposed system provides high quality of experience (QoE) in terms of Peak Signal to Noise Ratio (PSNR), playback delay and duration of pauses. The proposed system also provides incentive mechanism to its users.     

mVoIP for P2P service based authentication system using AA authentication server

VoIP (Voice over Internet Protocol), which provides voice calls as well as additional services at cheaper prices than PSTN (Public Switched Telephone Network), is gaining ground over the latter, which had been the dominant telephone network in the past. This kind of a VoIP service is evolving into a dedicated mVoIP service for the smartphone which allows calls to be made at cheap prices using a WiFi network, as the number of smartphone users is skyrocketing as of late. While an increase in the user base is expected for mVoIP, a packet network is an open network which means anyone can easily gain access and so there can be various problems. To mitigate this, in this paper an authentication system is designed which has an AA (Attribute Authority) server added to VoIP in order to increase security and discriminate user access. In this paper a system for addressing security vulnerabilities from the increase in the use of VoIP services and providing differentiated services according to user access privileges is designed. This paper is organized as follows: Chapter 1 gives the introduction; Chapter 2 is on related research; Chapter 3 describes the proposed technique and system; Chapter 4 implements the system and analyzes its the performance; and Chapter 5 gives the conclusions.     

A virtual service placement approach based on improved quantum genetic algorithm

Despite the critical role that middleboxes play in introducing new network functionality, management and innovation of them are still severe challenges for network operators, since traditional middleboxes based on hardware lack service flexibility and scalability. Recently, though new networking technologies, such as network function virtualization (NFV) and software-defined networking (SDN), are considered as very promising drivers to design cost-efficient middlebox service architectures, how to guarantee transmission efficiency has drawn little attention under the condition of adding virtual service process for traffic. Therefore, we focus on the service deployment problem to reduce the transport delay in the network with a combination of NFV and SDN. First, a framework is designed for service placement decision, and an integer linear programming model is proposed to resolve the service placement and minimize the network transport delay. Then a heuristic solution is designed based on the improved quantum genetic algorithm. Experimental results show that our proposed method can calculate automatically the optimal placement schemes. Our scheme can achieve lower overall transport delay for a network compared with other schemes and reduce 30% of the average traffic transport delay compared with the random placement scheme.     

Adaptive fuzzy integral sliding mode velocity control for the cutting system of a trench cutter

This paper presents a velocity controller for the cutting system of a trench cutter (TC). The cutting velocity of a cutting system is affected by the unknown load characteristics of rock and soil. In addition, geological conditions vary with time. Due to the complex load characteristics of rock and soil, the cutting load torque of a cutter is related to the geological conditions and the feeding velocity of the cutter. Moreover, a cutter’s dynamic model is subjected to uncertainties with unknown effects on its function. In this study, to deal with the particular characteristics of a cutting system, a novel adaptive fuzzy integral sliding mode control (AFISMC) is designed for controlling cutting velocity. The model combines the robust characteristics of an integral sliding mode controller with the adaptive adjusting characteristics of an adaptive fuzzy controller. The AFISMC cutting velocity controller is synthesized using the backstepping technique. The stability of the whole system including the fuzzy inference system, integral sliding mode controller, and the cutting system is proven using the Lyapunov theory. Experiments have been conducted on a TC test bench with the AFISMC under different operating conditions. The experimental results demonstrate that the proposed AFISMC cutting velocity controller gives a superior and robust velocity tracking performance.     

A <Emphasis Type="Italic">K</Emphasis> self-adaptive SDN controller placement for wide area networks

As a novel architecture, software-defined networking (SDN) is viewed as the key technology of future networking. The core idea of SDN is to decouple the control plane and the data plane, enabling centralized, flexible, and programmable network control. Although local area networks like data center networks have benefited from SDN, it is still a problem to deploy SDN in wide area networks (WANs) or large-scale networks. Existing works show that multiple controllers are required in WANs with each covering one small SDN domain. However, the problems of SDN domain partition and controller placement should be further addressed. Therefore, we propose the spectral clustering based partition and placement algorithms, by which we can partition a large network into several small SDN domains efficiently and effectively. In our algorithms, the matrix perturbation theory and eigengap are used to discover the stability of SDN domains and decide the optimal number of SDN domains automatically. To evaluate our algorithms, we develop a new experimental framework with the Internet2 topology and other available WAN topologies. The results show the effectiveness of our algorithm for the SDN domain partition and controller placement problems.