Skip to main content
Ahmed Omar
  • Gaza Strip
  • 0599573933

Ahmed Omar

قائمة بمعظم المصطلحات الشائعة في ترجمة منتجات العطور مع توصيف لمعانيها
Research Interests:
A wireless sensor network (WSN) is a collection of nodes organized into a cooperative network. Each node consists of processing capability (one or more microcontrollers, CPUs or DSP chips), may contain multiple types of memory (program,... more
A wireless sensor network (WSN) is a collection of nodes organized into a cooperative network. Each node consists of processing capability (one or more microcontrollers, CPUs or DSP chips), may contain multiple types of memory (program, data and flash memories), have a RF transceiver (usually with a single omni-directional antenna), have a power source (e.g., batteries and solar cells), and accommodate various sensors and actuators. The nodes communicate wirelessly and often self-organize after being deployed in an ad hoc fashion. Systems of 1000s or even 10,000 nodes are anticipated. Such systems can revolutionize the way we live and work.
Research Interests:
Voice over IP (VoIP) is a blanket description for any service that delivers standard voice telephone services over Internet Protocol (IP). Computers to transfer data and files between computers normally use Internet protocol. "Voice over... more
Voice over IP (VoIP) is a blanket description for any service that delivers standard voice telephone services over Internet Protocol (IP). Computers to transfer data and files between computers normally use Internet protocol.
"Voice over IP is the technology of digitizing sound, compressing it, breaking it up into data packets, and sending it over an IP (internet protocol) network where it is reassembled, decompressed, and converted back into an analog wave form.." The transmission of sound over a packet switched network in this manner is an order of magnitude more efficient than the transmission of sound over a circuit switched network.
Research Interests:
Dijkstra's algorithm is called the single-source shortest path. It is also known as the single source shortest path problem. It computes length of the shortest path from the source to each of the remaining vertices in the graph.
Research Interests: