An AHB system is made of masters slaves and intercOnnectiOns. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a master, every destination node is a slave and every internal node is an arbiter there must be one and only one arc exiting a master and one or more entering a slave (single slave verus multi-slave or arbitrated slave) an arbiter can have as many input and output cOnnectiOns as needed. A bridge is a special node that collapses one or more slave nodes and a master node in a new "complex" node.
標簽： intercOnnectiOns approach general include
上傳時間： 2015-12-12
上傳用戶：lyy1234
Hammerhead2 is a stress testing tool designed to test out your web server and web site. It can initiate multiple cOnnectiOns from IP aliases and simulated numerous (256+) users at any given time
標簽： Hammerhead2 web designed testing
上傳時間： 2016-01-04
上傳用戶：youlongjian0
Mod_python is an Apache module that embeds the Python interpreter within the server. With mod_python you can write web-based applications in Python that will run many times faster than traditional CGI and will have access to advanced features such as ability to retain database cOnnectiOns and other data between hits and access to Apache internals. A more detailed description of what mod_python can do is available in this O Reilly article.
標簽： interpreter Mod_python mod_python the
上傳時間： 2016-01-25
上傳用戶：yd19890720
Siproxd is a proxy/masquerading daemon for the SIP protocol. It handles registrations of SIP clients on a private IP network and performs rewriting of the SIP message bodies to make SIP cOnnectiOns work via an masquerading firewall (NAT). It allows SIP software clients (like kphone, linphone) or SIP hardware clients (Voice over IP phones which are SIP-compatible, such as those from Cisco, Grandstream or Snom) to work behind an IP masquerading firewall or NAT router
標簽： registrations masquerading SIP protocol
上傳時間： 2016-04-10
上傳用戶：fnhhs
// This program accesses a SPI EEPROM using polled mode access. The F06x MCU // is configured in 4-wire Single Master Mode, and the EEPROM is the only // slave device connected to the SPI bus. The read/write operations are // tailored to access a Microchip 4 kB EEPROM 25LC320. The relevant hardware // cOnnectiOns of the F06x MCU are shown here:
標簽： configured accesses program EEPROM
上傳時間： 2014-01-18
上傳用戶：liglechongchong
// This program accesses a SPI EEPROM using polled mode access. The F06x MCU // is configured in 4-wire Single Master Mode, and the EEPROM is the only // slave device connected to the SPI bus. The read/write operations are // tailored to access a Microchip 4 kB EEPROM 25LC320. The relevant hardware // cOnnectiOns of the F06x MCU are shown here:
標簽： configured accesses program EEPROM
上傳時間： 2016-04-12
上傳用戶：qb1993225
FMA is a free1 powerful phone editing tool allowing users to easily manage all of the personal data stored in their phones, via a number of different cOnnectiOns methods. FMA allows easy management of Phonebook (both SIM and Phone memory), SMS, Profiles, and Files stored on the phone. FMA can also allow you to pickup and dial calls directly from your PC. FMA is fun and much more whatever you want it to be, it is whatever a mobile phone should have :-) (Currently based on Sony Ericsson T610 features set).
標簽： allowing powerful personal editing
上傳時間： 2014-08-12
上傳用戶：wlcaption
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous cOnnectiOns, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
Find an introduction to the architecture, concepts and algorithms of the Linux kernel in Professional Linux Kernel Architecture, a guide to the kernel sources and large number of cOnnectiOns among subsystems.
標簽： introduction architecture Professiona algorithms
上傳時間： 2014-01-15
上傳用戶：TRIFCT
Learn how to leverage a key Java technology used to access relational data from Java programs, in an Oracle environment. Author Donald Bales begins by teaching you the mysteries of establishing database cOnnectiOns, and how to issue SQL queries and get results back. You ll move on to advanced topics such as streaming large objects, calling PL/procedures, and working with Oracle9i s object-oriented features, then finish with a look at transactions, concurrency management, and performance
標簽： Java technology relational leverage
上傳時間： 2017-08-02
上傳用戶：xz85592677
