Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

Bestsellers

Linear Algebra and Optimization with Applications to Machine Learning
Linear Algebra and Optimization with Applications to Machine Learning

Volume I: Linear Algebra for Computer Vision, Robotics, and Machine Learning
by Jean Gallier and Jocelyn Quaintance
Linear Algebra and Optimization with Applications to Machine Learning
Linear Algebra and Optimization with Applications to Machine Learning

Volume II: Fundamentals of Optimization Theory with Applications to Machine Learning
by Jean Gallier and Jocelyn Quaintance

 

  • articleNo Access

    Multi-Criteria Decision-Making for Heterogeneous Multiprocessor Scheduling

    This paper proposes a new tri-objective scheduling algorithm called Heterogeneous Reliability-Driven Energy-Efficient Duplication-based (HRDEED) algorithm for heterogeneous multiprocessors. The goal of the algorithm is to minimize the makespan (schedule length) and energy consumption, while maximizing the reliability of the generated schedule. Duplication has been employed in order to minimize the makespan. There is a strong interest among researchers to obtain high-performance schedules that consume less energy. To address this issue, the proposed algorithm incorporates energy consumption as an objective. Moreover, in order to deal with processor and link failures, a system reliability model is proposed. The three objectives, i.e., minimizing the makespan and energy, while maximizing the reliability, have been met by employing a method called Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS). TOPSIS is a popular Multi-Criteria Decision-Making (MCDM) technique that has been employed to rank the generated Pareto optimal schedules. Simulation results demonstrate the capability of the proposed algorithm in generating short, energy-efficient and reliable schedules. Based on simulation results, we observe that HRDEED algorithm demonstrates an improvement in both the energy consumption and reliability, with a reduced makespan. Specifically, it has been shown that the energy consumption can be reduced by 5–47%, and reliability can be improved by 1–5% with a 1–3% increase in makespan.

  • articleNo Access

    FIVE STEPS OF EVOLUTION FROM NON-LIFE TO LIFE-LIKE ROBOTS

    There are many interests in developing life-like robots, or robots which are both intelligent and autonomous. And, one obvious characteristics of life-like creatures is that they can autonomously develop and learn during their life span. Such abilities obviously depend on the ways of designing human-like minds. Then, a fundamental question is how to devise the innate, or built-in, principles behind the blueprint of a human-like mind, and to apply these findings to guide the design of the mind of life-like robots. In the literature, there are two schools of thoughts. One advocates the study of the nervous systems of biological brains (e.g. human brain) until the discovery of the blueprint of a mind. The second approach is to follow the path of invention and validation until the full understanding of physical principles which enable the design of an artificial mind that is as good as a biological mind. This paper embraces the second approach, and aims at formulating a new ground which could guide the design of the minds of life-like robots at various stages. In particular, the discussion is focused on answering the question of what life is from an engineering point of view. And, we approach the answer by examining the key steps of evolution from non-life to life. In this paper, five key steps of evolution from non-life to life will be discussed in detail. They are embodiment of energy flow, embodiment of signal flow, embodiment of knowledge flow, embodiment of decision flow, and embodiment of awareness flow. These findings are grounded on our engineering works toward the development of low-cost humanoid (LOCH) robot, and offer a unique perspective and an engineering basis. Whenever possible, the discussions in this paper are supported by real results of experiments on real robots.

  • articleNo Access

    FORCE CONTROL OF THE REDUNDANT LEG OF A BIPED ROBOT TO PRODUCE LARGE INERTIAL EFFECTS FOR CROSSING OBSTACLES

    This paper proposes an energy control method for dynamic obstacle crossing by a planar biped. This approach was tested in a simulation where it was found to enable the biped robot to cross obstacles of different heights, due to inertial forces, by leaning with the front foot on the obstacles. The propulsion energy of the system is produced by the rear leg, which is endowed with four actuated degrees-of-freedom (hip, knee, ankle, toes), and is controlled by force control with four degrees-of-freedom in the non-singular case, and three degrees-of-freedom in the singular case. This paper identifies ten geometric, energetic and servo-control parameters necessary for dynamic obstacle crossing. The methodology presented allowed the dynamic crossing of an obstacle up to 20 cm high, at which point the joint torque limit for the propelling ankle was reached.

  • chapterNo Access

    Survey on Link Quality Models in Wireless Ad Hoc Networks

    Emerging advanced wireless ad hoc networks make it possible for network resources to be utilized anywhere and anytime. However, compared with traditional infrastructure-based networks, wireless ad hoc networks are relatively unstable and unreliable due to the underlying wireless medium and infrastructure-less nature. Existing techniques compensate for the instability of wireless links by employing either packet retransmissions, network coding, opportunistic routing, thick (or multiple) paths, or route fixes (using alternative routes). This chapter seeks to compare these techniques in terms of energy cost, the increment of reliability, and various other metrics.

  • chapterNo Access

    Security Attacks and Challenges in Wireless Sensor Networks

    With the advancements of networking technologies and miniaturization of electronic devices, wireless sensor networks (WSN) have become an emerging area of research in academic, industrial, and defense sectors. Sensors combined with low power processors and wireless radios will see widespread adoption in the new future for a variety of applications including battlefield, hazardous area, and structural health monitoring. However, many issues need to be solved before the full-scale implementations are practical. Among the research issues in WSN, security is one of the most challenging. Securing WSN is challenging because of the limited resources of the sensors participating in the network. Moreover, the reliance on wireless communication technology opens the door for various types of security threats and attacks. Considering the special features of this type of network, in this chapter we address the critical security issues in wireless sensor networks. We discuss cryptography, steganography, and other basics of network security and their applicability to WSN. We explore various types of threats and attacks against wireless sensor networks, possible countermeasures, and notable WSN security research. We also introduce the holistic view of security and future trends for research in wireless sensor network security.

    Briefly, in this chapter we will present the following topics:

    • Basics of security in wireless sensor networks.

    • Feasibility of applying various security approaches in WSN.

    • Threats and attacks against wireless sensor networks.

    • Key management issues.

    • Secure routing in WSN.

    • Holistic view of security in WSN.

    • Future research issues and challenges.