Academia.eduAcademia.edu

Figure 55 – uploaded by minh day nguyen

See full PDFdownloadDownload figure
Table- II: Calculated correction factor C’ for the Mearurement of Sheet Resistivities using Four-Point Probe on Narrow Structure specimens.

Figure 55 - II: Calculated correction factor C’ for the Mearurement of Sheet Resistivities using Four-Point Probe on Narrow Structure specimens.

Related Figures (94)

II. UMTS RADIO NETWORK PLANNING The UMTS network architecture is depicted in Figure 1. The core network handles call control and mobility management functionalities, while the UTRAN (UMTS terrestrial radio access network) manages the radio packet transmission and resource management. Packet routing and transfer within the core network are supported by definition of new logical network nodes called GGSN (gateway GPRS [general packet radio system] support node) and SGSN (serving GPRS support node). The GGSN is basically a packet router with additional mobility management features, and it connects with various network elements through standardized interfaces. The GGSN acts as a physical interface to the external packet data networks. The SGSN handles packet delivery to and from mobile terminals. Each SGSN is responsible for delivering packets to the terminals within its service area. GGSN and SGSN are capable of supporting terminal data rates up to 2 Mbps. A UTRAN consists of one or more RNSs (radio network subsystems), which in turn consist of base stations (Node Bs) and RNCs (radio network controllers). The RNS performs all of the radio resource and air interface management functionalities. The UMTS network architecture inherits most of its structure from the GSM model in the UTRAN. The UMTS radio network planning process can be divided into three parts; the initial phase (also called system dimension); detailed planning phase; and the optimization and monitoring phase. Each of the phases requires additional considerations such as propagation measurements, traffic demand measurements and so on. The process of the UMTS radio network planning is illustrated in Figure 2.
II. UMTS RADIO NETWORK PLANNING The UMTS network architecture is depicted in Figure 1. The core network handles call control and mobility management functionalities, while the UTRAN (UMTS terrestrial radio access network) manages the radio packet transmission and resource management. Packet routing and transfer within the core network are supported by definition of new logical network nodes called GGSN (gateway GPRS [general packet radio system] support node) and SGSN (serving GPRS support node). The GGSN is basically a packet router with additional mobility management features, and it connects with various network elements through standardized interfaces. The GGSN acts as a physical interface to the external packet data networks. The SGSN handles packet delivery to and from mobile terminals. Each SGSN is responsible for delivering packets to the terminals within its service area. GGSN and SGSN are capable of supporting terminal data rates up to 2 Mbps. A UTRAN consists of one or more RNSs (radio network subsystems), which in turn consist of base stations (Node Bs) and RNCs (radio network controllers). The RNS performs all of the radio resource and air interface management functionalities. The UMTS network architecture inherits most of its structure from the GSM model in the UTRAN. The UMTS radio network planning process can be divided into three parts; the initial phase (also called system dimension); detailed planning phase; and the optimization and monitoring phase. Each of the phases requires additional considerations such as propagation measurements, traffic demand measurements and so on. The process of the UMTS radio network planning is illustrated in Figure 2.
The up-link and the ideal situation of the WCDMA technology are considered. That is to say, we will assume the coverage is limited by the maximum transmission power at the mobile and neither blocking nor outage takes place in the cellular system. Based on Equation (5), we can understand the performance of a WCDMA network by developing a simple expression for the The analysis in the above the capacity calculation can be isolated from coverage. However, in the 3G networks, it is important to derive the relationship between the coverage and capacity. B. Coverage versus Capacity
The up-link and the ideal situation of the WCDMA technology are considered. That is to say, we will assume the coverage is limited by the maximum transmission power at the mobile and neither blocking nor outage takes place in the cellular system. Based on Equation (5), we can understand the performance of a WCDMA network by developing a simple expression for the The analysis in the above the capacity calculation can be isolated from coverage. However, in the 3G networks, it is important to derive the relationship between the coverage and capacity. B. Coverage versus Capacity
WCDMA capacity planning is directly related to the link budget and, thus, to the base station coverage area. In the link budget in Table 1, only one type of service (64/144 kbps data transmission) was introduced, and the base station coverage was fixed for this service. It is possible to have any type of service between the voice calls and 2 Mbps data traffic in the WCDMA base station. This means that the base station coverage area is different for different users. (Figure 3)
WCDMA capacity planning is directly related to the link budget and, thus, to the base station coverage area. In the link budget in Table 1, only one type of service (64/144 kbps data transmission) was introduced, and the base station coverage was fixed for this service. It is possible to have any type of service between the voice calls and 2 Mbps data traffic in the WCDMA base station. This means that the base station coverage area is different for different users. (Figure 3)
Figure 3: Relative cell range and cell area versus user bit rate using WCDMA (cell ranges calculated by Okumura-Hata model at antenna height of 25m)
Figure 3: Relative cell range and cell area versus user bit rate using WCDMA (cell ranges calculated by Okumura-Hata model at antenna height of 25m)
Figure 1. Proposed Video Sharing between PDAs Advances in computing and communication in recent years have made video on demand sharing feasible between resourceful devices like computer systems or digital media devices. In VOD systems, movie database is stored in a central server or in a group of interconnected servers. The video server is connected with high-capacity network interfaces through which local distribution centers (hubs) receive the stream data and broadcast to the households. Such systems can share video stream between them by high-speed networks and buffering in larger memories. However, similar VOD sharing between PDAs or Smart-Phone could not be offered due to PDA-to-PDA low rate wireless Modern PDAs and Smart Phones support both IEEE 802.11 (WLAN) and IEEE 802.16e (WiMax and WiBro) protocols with limited functionality. Our work mainly focuses on Video on Demand sharing over Wireless Broadband (WiBro) transmission between PDAs, and also covers the client-server communications between PDA and Server. Proposed network engine considers the memory capacity of PDA, transmission rate, bandwidth, connection procedure and user interaction. It is implemented on HP iPAQ PDAs and experimented with some real video clip.
Figure 1. Proposed Video Sharing between PDAs Advances in computing and communication in recent years have made video on demand sharing feasible between resourceful devices like computer systems or digital media devices. In VOD systems, movie database is stored in a central server or in a group of interconnected servers. The video server is connected with high-capacity network interfaces through which local distribution centers (hubs) receive the stream data and broadcast to the households. Such systems can share video stream between them by high-speed networks and buffering in larger memories. However, similar VOD sharing between PDAs or Smart-Phone could not be offered due to PDA-to-PDA low rate wireless Modern PDAs and Smart Phones support both IEEE 802.11 (WLAN) and IEEE 802.16e (WiMax and WiBro) protocols with limited functionality. Our work mainly focuses on Video on Demand sharing over Wireless Broadband (WiBro) transmission between PDAs, and also covers the client-server communications between PDA and Server. Proposed network engine considers the memory capacity of PDA, transmission rate, bandwidth, connection procedure and user interaction. It is implemented on HP iPAQ PDAs and experimented with some real video clip.
We implement the VOD network engine in HP iPAQ hw6945 Mobile Messenger with operating system Windows Mobile 5.0 Phone Edition. In contrast to the generic computing devices, programming tools in PDA environment offer limited functionalities. JZ2ME, embedded visual c++, embedded visual basic and embedded c (for Embedded Linux) are such programming compilers. Further, for rendering graphics OpenGL ES is used instead of OpenGL. In our work we have chosen the Embedded Visual c++ as our platform was Windows Mobile, for embedded Linux the Embedded C can be used. Figure 2(a): Client-Server Connection Protocol
We implement the VOD network engine in HP iPAQ hw6945 Mobile Messenger with operating system Windows Mobile 5.0 Phone Edition. In contrast to the generic computing devices, programming tools in PDA environment offer limited functionalities. JZ2ME, embedded visual c++, embedded visual basic and embedded c (for Embedded Linux) are such programming compilers. Further, for rendering graphics OpenGL ES is used instead of OpenGL. In our work we have chosen the Embedded Visual c++ as our platform was Windows Mobile, for embedded Linux the Embedded C can be used. Figure 2(a): Client-Server Connection Protocol
Figure 2(b): PDA-to-PDA Connection Protocol in case 1, when the source PDA is already receiving a video strean
Figure 2(b): PDA-to-PDA Connection Protocol in case 1, when the source PDA is already receiving a video strean
Table 1: PDA-Server Packet Transmission Delays
Table 1: PDA-Server Packet Transmission Delays
Table 2: PDA-to-PDA Packet Transmission Delays Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table 2: PDA-to-PDA Packet Transmission Delays Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table 1 shows the observed per packet delay for video streaming in PDA-Server Connection and corresponding graph is shown in Figure 3. From the results, we find that the PDA-Server connection is capable of providing VOD service on PDAs. Only few packets are dropped with the maximum RTCP packet size (64KB). There is no packet loss below that packet size. Video streaming services generally use the 14KB, which is shown in shaded row in Table 1. Delay columns in Table 1 shows that 16KB packets can be delivered perfectly to cope up with the video information timing. In busy wireless network environment, larger packet sizes can experience larger delays that may degrade the video performance. Shaded region in Figure 3 shows the optimum tolerable video frame packet delay and we find that packet size of 14KB to 32KB the video frames appear in real-time.
Table 1 shows the observed per packet delay for video streaming in PDA-Server Connection and corresponding graph is shown in Figure 3. From the results, we find that the PDA-Server connection is capable of providing VOD service on PDAs. Only few packets are dropped with the maximum RTCP packet size (64KB). There is no packet loss below that packet size. Video streaming services generally use the 14KB, which is shown in shaded row in Table 1. Delay columns in Table 1 shows that 16KB packets can be delivered perfectly to cope up with the video information timing. In busy wireless network environment, larger packet sizes can experience larger delays that may degrade the video performance. Shaded region in Figure 3 shows the optimum tolerable video frame packet delay and we find that packet size of 14KB to 32KB the video frames appear in real-time.
Fig 1. A maximum margin hyperplane with its support vectors VI. Overview of Architecture The block diagram of our proposed architecture is shown in figure-2. The architecture includes a user interface that i: responsible for communicating with the user, a pool of training examples, active learning module, e-mail classifier and use: mailbox. The total module can be in either Training mode (TM) or Active Mode (AM). In training mode the module wil collect individual user e-mails that they considered as spam or legitimate. After collecting sufficient amount of both span and legitimate e-mails the learning process will begin. Now the module will switch to active mode. In this mode the modul classify user’s e-mails as spam or nonspam and place them in his or her mailbox according to their probability. When a use observes that an e-mail is misclassified, he or she will provide feedback with misclassified e-mail and its label he or sh¢ considered. After receiving feedback the module will switch to training mode and above described procedure will begir again.
Fig 1. A maximum margin hyperplane with its support vectors VI. Overview of Architecture The block diagram of our proposed architecture is shown in figure-2. The architecture includes a user interface that i: responsible for communicating with the user, a pool of training examples, active learning module, e-mail classifier and use: mailbox. The total module can be in either Training mode (TM) or Active Mode (AM). In training mode the module wil collect individual user e-mails that they considered as spam or legitimate. After collecting sufficient amount of both span and legitimate e-mails the learning process will begin. Now the module will switch to active mode. In this mode the modul classify user’s e-mails as spam or nonspam and place them in his or her mailbox according to their probability. When a use observes that an e-mail is misclassified, he or she will provide feedback with misclassified e-mail and its label he or sh¢ considered. After receiving feedback the module will switch to training mode and above described procedure will begir again.
Fig 2. Architecture of Active Learning SVMs with Relevance Feedback
Fig 2. Architecture of Active Learning SVMs with Relevance Feedback
Therefore, {X“,Y, p} isa symplectic frame. Hence completes the proof. Il. SYMPLECTIC AND CONTACT MANIFOLDS
Therefore, {X“,Y, p} isa symplectic frame. Hence completes the proof. Il. SYMPLECTIC AND CONTACT MANIFOLDS
eo rerarH rrr The apparatus is illustrated in figure-1 The main n furnace is a vacuum tight aluminum tube of length 333 mm, internal diameter 20 mm and outer diameter 27 mm is directly heated by a bifilar — wound with Mo-resistance wire ( d = 5 mm) and opens at both ends. The central 250 mm is surrounded by an austenite (25-20 Cr-Ni) stainless steel tube, which carries the furnace winding, insulated from the tube by a layer of mica. The two tubes are separated by a gap of 1.06 mm and are held concentric by a pyrophyllite plug at each end of the outer tube. The furnace winding of 0.0359 inch in diameter tray in three non-inductive separate sections, each having a resistance of about 10Q and each externally shunted by a variable resistance. The stainless-steel tube is surrounded by alumina brick and powder insulation contained inside 220 mm diameter asbestos of outer tube. The heating of the magnetic coil is prevented by radiation shields, by a vacuum of 10° Pa, and by water cooled outer shell.
eo rerarH rrr The apparatus is illustrated in figure-1 The main n furnace is a vacuum tight aluminum tube of length 333 mm, internal diameter 20 mm and outer diameter 27 mm is directly heated by a bifilar — wound with Mo-resistance wire ( d = 5 mm) and opens at both ends. The central 250 mm is surrounded by an austenite (25-20 Cr-Ni) stainless steel tube, which carries the furnace winding, insulated from the tube by a layer of mica. The two tubes are separated by a gap of 1.06 mm and are held concentric by a pyrophyllite plug at each end of the outer tube. The furnace winding of 0.0359 inch in diameter tray in three non-inductive separate sections, each having a resistance of about 10Q and each externally shunted by a variable resistance. The stainless-steel tube is surrounded by alumina brick and powder insulation contained inside 220 mm diameter asbestos of outer tube. The heating of the magnetic coil is prevented by radiation shields, by a vacuum of 10° Pa, and by water cooled outer shell.
This value of the apparatus constant C was calculated using equation (4). The results of these values are well fit with the results of Busch et al [27], Cusack et al [28] and Roll et al [29] respectively. VU. EXPERIMENTAL RESULTS & DISCUSSION
This value of the apparatus constant C was calculated using equation (4). The results of these values are well fit with the results of Busch et al [27], Cusack et al [28] and Roll et al [29] respectively. VU. EXPERIMENTAL RESULTS & DISCUSSION
Table 3: Tin (Sn) of M.P. 231.9 °C
Table 3: Tin (Sn) of M.P. 231.9 °C
Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table 7: Zinc (Zn) of M.P. 419.39 °C
Table 7: Zinc (Zn) of M.P. 419.39 °C
Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table 9: Aluminium (Al) of M.P.658.5 °C Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table 9: Aluminium (Al) of M.P.658.5 °C Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
CELL BASED CALL ADMISSION CONTROL In case of tree based call admission control a new call or a handover call is admitted to a group of 7 cells which is shown in Figure 1. So, new call arrival rate for the group of 7 cells is 7A. Handover rate for the tree is 3h as there are 18 outside edge for the tree and handover rate to an edge of the cell is h/6 (18 X h/6 = 3h) which is also mentioned in [1]. Call termination rate is L, for new call arrival and wu, for handover calls. Here 7C is total number of channels for the tree where N number of channels used for both new calls and handover calls. 7C-N channels are reserved for handling only handover calls.
CELL BASED CALL ADMISSION CONTROL In case of tree based call admission control a new call or a handover call is admitted to a group of 7 cells which is shown in Figure 1. So, new call arrival rate for the group of 7 cells is 7A. Handover rate for the tree is 3h as there are 18 outside edge for the tree and handover rate to an edge of the cell is h/6 (18 X h/6 = 3h) which is also mentioned in [1]. Call termination rate is L, for new call arrival and wu, for handover calls. Here 7C is total number of channels for the tree where N number of channels used for both new calls and handover calls. 7C-N channels are reserved for handling only handover calls.
State transition diagram [3] for tree based call admission is shown in figure 4. And for cell based call admission contro shown in figure 5. By analyzing the state transition diagram in figure 4 and using cut equation we find following derivec equations: WaT ss els se pee Ves bcs | ees fac ce eee ee TI eee | ase ee ax “hss eed we lke cee Ze: Probability of handover failure in a tree based technique is
State transition diagram [3] for tree based call admission is shown in figure 4. And for cell based call admission contro shown in figure 5. By analyzing the state transition diagram in figure 4 and using cut equation we find following derivec equations: WaT ss els se pee Ves bcs | ees fac ce eee ee TI eee | ase ee ax “hss eed we lke cee Ze: Probability of handover failure in a tree based technique is
Figure 5. State transition diagram for cell based call admission control Probability of handover failure in a cell based technique is
Figure 5. State transition diagram for cell based call admission control Probability of handover failure in a cell based technique is
Blocking probability of new arrival and handover failure of both cell and tree based admission is plotted against new call arrival rate taking number of allocated channel of new arrival call and guard channel of handover call as parameters shown in figure 6-9. Here handover arrival rate h=0.2 calls/min, handover termination rate [, =1.2 calls/min, total termination rate pL; = 2.6 calls/min and total number of channels C=8 taken for cell based call admission technique. For tree based admission, number of channels for new call N=14 and average number of channels per cell C=3. Both blocking probability of new arrival call and handover failure increase with increment of call arrival rate at the same time both probability decreases with increment of allocated channel of respective traffic. When large number of users shares a common string of channels usually show better performance than the situation when several oroun of channels are allocated for individual sroun. The situation is also visualized in two call admission schemes
Blocking probability of new arrival and handover failure of both cell and tree based admission is plotted against new call arrival rate taking number of allocated channel of new arrival call and guard channel of handover call as parameters shown in figure 6-9. Here handover arrival rate h=0.2 calls/min, handover termination rate [, =1.2 calls/min, total termination rate pL; = 2.6 calls/min and total number of channels C=8 taken for cell based call admission technique. For tree based admission, number of channels for new call N=14 and average number of channels per cell C=3. Both blocking probability of new arrival call and handover failure increase with increment of call arrival rate at the same time both probability decreases with increment of allocated channel of respective traffic. When large number of users shares a common string of channels usually show better performance than the situation when several oroun of channels are allocated for individual sroun. The situation is also visualized in two call admission schemes
Figure 6. Blocking probability against new call arrival rate for tree based call admission Figure 7. Probability of handover failure against new call arrival rate for tree based call admission
Figure 6. Blocking probability against new call arrival rate for tree based call admission Figure 7. Probability of handover failure against new call arrival rate for tree based call admission
Figure 8. Blocking probability against new call arrival rate for cell based call admission Figure 9. Probability of handover failure against new call arrival rate for cell based call admission
Figure 8. Blocking probability against new call arrival rate for cell based call admission Figure 9. Probability of handover failure against new call arrival rate for cell based call admission
Here D stands for the disease node, I, lb,..., Im for influence nodes and S;, So,..., S, for symptom nodes. To determine the network topology, we grouped the diseases characteristics into two- influence and symptom. First five of the above lists fall in the influence category and the rest fall into symptom category. Then the network for a particular disease can be expressed as in figure-2.
Here D stands for the disease node, I, lb,..., Im for influence nodes and S;, So,..., S, for symptom nodes. To determine the network topology, we grouped the diseases characteristics into two- influence and symptom. First five of the above lists fall in the influence category and the rest fall into symptom category. Then the network for a particular disease can be expressed as in figure-2.
Figure 2: Windows Message Processing System. This code essentially processes all messages at the application level and routes them to the appropriate window procedures. Code in each different window procedure is then responsible for taking action based on the messages they receive. Windows message processing system is depicted in figure 2. In order to programmatically incorporate a Unicode based keyboard in windows, a system wide message hook has to be established. A hook is a mechanism by which a function can intercept events (messages, mouse actions, keystrokes) before they reach an application. The function can act on events and, in some cases, modify or discard them. Functions that receive events are called filter functions and are classified according to the type of event they intercept. For example, a filter function might want to receive all keyboard or mouse events.
Figure 2: Windows Message Processing System. This code essentially processes all messages at the application level and routes them to the appropriate window procedures. Code in each different window procedure is then responsible for taking action based on the messages they receive. Windows message processing system is depicted in figure 2. In order to programmatically incorporate a Unicode based keyboard in windows, a system wide message hook has to be established. A hook is a mechanism by which a function can intercept events (messages, mouse actions, keystrokes) before they reach an application. The function can act on events and, in some cases, modify or discard them. Functions that receive events are called filter functions and are classified according to the type of event they intercept. For example, a filter function might want to receive all keyboard or mouse events.
Figure 3: The filter function chain in Windows [7]. HOOK=SetW indowsHookEx(WH_GETMESSAGE,(HOOKPROC)Key,hDLL,0); Here the WH_GETMESSAGE parameter installs a hook procedure that monitors messages posted to a message queue anc the parameter Key is a pointer to the hook procedure. The zero in the last parameter specifies that, the Key parameter mus‘ point to a hook procedure in a dynamic-link library (DLL). Otherwise, this parameter can point to a hook procedure in the code associated with the current process.
Figure 3: The filter function chain in Windows [7]. HOOK=SetW indowsHookEx(WH_GETMESSAGE,(HOOKPROC)Key,hDLL,0); Here the WH_GETMESSAGE parameter installs a hook procedure that monitors messages posted to a message queue anc the parameter Key is a pointer to the hook procedure. The zero in the last parameter specifies that, the Key parameter mus‘ point to a hook procedure in a dynamic-link library (DLL). Otherwise, this parameter can point to a hook procedure in the code associated with the current process.
Figure 2: Local database with assumed value A predefined time period t,, is set up and after the t,, time all entry of the local table will be deleted. A predefined threshold value Pihreshoid iS the determination parameter to detect a node as malicious. Our objective is to count the successful forwards by the target node. It can be easily computed by simply performing logical AND operation of the forward and reverse field of figure 2. Then the total number of 1s generates the desired successful packet forwards.
Figure 2: Local database with assumed value A predefined time period t,, is set up and after the t,, time all entry of the local table will be deleted. A predefined threshold value Pihreshoid iS the determination parameter to detect a node as malicious. Our objective is to count the successful forwards by the target node. It can be easily computed by simply performing logical AND operation of the forward and reverse field of figure 2. Then the total number of 1s generates the desired successful packet forwards.
Table 2: Combination Vectors for Arabic numeral: Journal of Computer Science, Volume1, Number 1, June 2007, ISSN : 1994-6244
Table 2: Combination Vectors for Arabic numeral: Journal of Computer Science, Volume1, Number 1, June 2007, ISSN : 1994-6244
In Table 1 shows the Segmented-Layout of the proposed model. Now we see the layout of Arabic Numerals formed by th« proposed model. Figure 2 shows the layout/pattern of the Arabic numerals designed by the proposed 9-Segment display model. It looks visible, accurate, and easily identifiable. This is the novel characteristics of the proposed model. Figure 2: Segments layout for Arabic numerals
In Table 1 shows the Segmented-Layout of the proposed model. Now we see the layout of Arabic Numerals formed by th« proposed model. Figure 2 shows the layout/pattern of the Arabic numerals designed by the proposed 9-Segment display model. It looks visible, accurate, and easily identifiable. This is the novel characteristics of the proposed model. Figure 2: Segments layout for Arabic numerals
Table 1: Representation of Arabic numerals
Table 1: Representation of Arabic numerals
Table 5: Minimized Boolean Expression for each Segment Now the required detail circuit diagram and block diagram are derived for the proposed 9-Segment model. Figure 3 and 4 has shown the circuit and block diagram of the proposed model respectively.
Table 5: Minimized Boolean Expression for each Segment Now the required detail circuit diagram and block diagram are derived for the proposed 9-Segment model. Figure 3 and 4 has shown the circuit and block diagram of the proposed model respectively.
Deriving SOPs it will be required to minimize the Boolean expression for each segment using Karnaugh-map (K-map) method. The K-map is a graphical tool used to simplify a logic equation or to convert a Truth Table to its corresponding logic circuit in a simple or dearly process. The expressions are shown in Table 5. Table 4: Sum of Product for each Segment
Deriving SOPs it will be required to minimize the Boolean expression for each segment using Karnaugh-map (K-map) method. The K-map is a graphical tool used to simplify a logic equation or to convert a Truth Table to its corresponding logic circuit in a simple or dearly process. The expressions are shown in Table 5. Table 4: Sum of Product for each Segment
Figure 3: Decoding Logic Circuits for different Segments
Figure 3: Decoding Logic Circuits for different Segments
Figure 4: Block Diagram of Proposed Model
Figure 4: Block Diagram of Proposed Model
J2ME is a highly optimized Java runtime environment. J2ME is aimed at the consumer and embedded devices market. his includes devices such as cellular telephones, Personal Digital Assistants (PDAs) and other small devices. Figure | shows the J2ME architecture. Java 2 Standard Edition (J2SE) developers should be familiar with Java Virtual Machines (JVMs) and at least one host Operating System (OS). The OS will vary on different mobile devices. Some devices run the Symbian OS, others run some other OS developed by the manufacturer.
J2ME is a highly optimized Java runtime environment. J2ME is aimed at the consumer and embedded devices market. his includes devices such as cellular telephones, Personal Digital Assistants (PDAs) and other small devices. Figure | shows the J2ME architecture. Java 2 Standard Edition (J2SE) developers should be familiar with Java Virtual Machines (JVMs) and at least one host Operating System (OS). The OS will vary on different mobile devices. Some devices run the Symbian OS, others run some other OS developed by the manufacturer.
Divisibility means the ability to make change. A “divisible” coin worth some amount money, say $x, is a coin that can be divided in several small value and that can be spent several times as long as the sum total of all it’s the transactions does not exceed $x. Te aaa | ae Dae CA laxal Q Figure: 2 Divisibility of electronic coin 2. Withdrawal of E-cash by user Up
Divisibility means the ability to make change. A “divisible” coin worth some amount money, say $x, is a coin that can be divided in several small value and that can be spent several times as long as the sum total of all it’s the transactions does not exceed $x. Te aaa | ae Dae CA laxal Q Figure: 2 Divisibility of electronic coin 2. Withdrawal of E-cash by user Up
Recent developments in the Java programming language make it possible for Java developers to write applications for wireless devices such as cell phones and personal digital assistants. In 2000, the Java programming community [6] recognized the importance of creating a standard extension to the Java programming language for use with Bluetooth devices. A standard application programming interface (API) for Bluetooth was needed because each Bluetooth software protocol stack had its own API for application programmers. These proprietary APIs meant that a Bluetooth application had to be ported to different Bluetooth stacks to run on different devices.
Recent developments in the Java programming language make it possible for Java developers to write applications for wireless devices such as cell phones and personal digital assistants. In 2000, the Java programming community [6] recognized the importance of creating a standard extension to the Java programming language for use with Bluetooth devices. A standard application programming interface (API) for Bluetooth was needed because each Bluetooth software protocol stack had its own API for application programmers. These proprietary APIs meant that a Bluetooth application had to be ported to different Bluetooth stacks to run on different devices.
While we have considered all the best scores in our computation, still there can be efficiency loss. There can be subtle scores that is very closer to the minimum score and that can become the best alignment. That score alignment passes from the lef corner or right corner pockets. and j =hB,. At next wavelevel, computational nodes will be from/B; +/ ,/B; to hB;,hB, +/.
While we have considered all the best scores in our computation, still there can be efficiency loss. There can be subtle scores that is very closer to the minimum score and that can become the best alignment. That score alignment passes from the lef corner or right corner pockets. and j =hB,. At next wavelevel, computational nodes will be from/B; +/ ,/B; to hB;,hB, +/.
Table 1: comparative time for different sequence lengths “A COMparative study OF ume 1s gone with the tui /; x/5 CaiCuration version OF INWs and the tinal view. rere tw same length sequences are used. Optimal score alignment time is only considered at our final proposal code and corresponding wavelevel is noted down. The results were found in Pentium 2 350MHz single processor. Here the time shown is only for generating the distance matrix. IV. RESULT
Table 1: comparative time for different sequence lengths “A COMparative study OF ume 1s gone with the tui /; x/5 CaiCuration version OF INWs and the tinal view. rere tw same length sequences are used. Optimal score alignment time is only considered at our final proposal code and corresponding wavelevel is noted down. The results were found in Pentium 2 350MHz single processor. Here the time shown is only for generating the distance matrix. IV. RESULT
Figure 6: A time comparison among NWS and third view In the above figure, time needed in full matrix computation grew exponentially with the increase in length of sequences while time needed reduced dramatically and showed a steady growth in time with sequence lengths. V. CONCLUSION AND FUTURE WORKS
Figure 6: A time comparison among NWS and third view In the above figure, time needed in full matrix computation grew exponentially with the increase in length of sequences while time needed reduced dramatically and showed a steady growth in time with sequence lengths. V. CONCLUSION AND FUTURE WORKS
eS eee a ge ee ee ——E——e—e eee eee eee OE Bluetooth units that share it. A temporary key lasts only until the current session is terminated and it cannot be reused. Temporary keys are commonly used in point-to-multipoint connections, where the same information is transmitted to several recipients. There are several different types of keys defined in Bluetooth. Link keys can be combination keys, unit keys, master keys or initialization keys, depending on the type of application. In addition to link keys, there is the encryption key. The unit key is generated in a single device when it is installed. The combination key is derived from information from two devices and it is generated for each new pair of Bluetooth devices.
eS eee a ge ee ee ——E——e—e eee eee eee OE Bluetooth units that share it. A temporary key lasts only until the current session is terminated and it cannot be reused. Temporary keys are commonly used in point-to-multipoint connections, where the same information is transmitted to several recipients. There are several different types of keys defined in Bluetooth. Link keys can be combination keys, unit keys, master keys or initialization keys, depending on the type of application. In addition to link keys, there is the encryption key. The unit key is generated in a single device when it is installed. The combination key is derived from information from two devices and it is generated for each new pair of Bluetooth devices.
The initialization key is needed when two devices with no prior engagements need to communicate. During the initialization process, the PIN code is entered to both devices. The initialization key itself is generated by the E22 algorithm, which uses the PIN code, the Bluetooth Device Address of the claimant device and a 128-bit random number generated by the verifier device as inputs. The resulting 128-bit initialization key is used for key exchange during the generation of a link key. After the key exchange the initialization key is discarded. The Key generation algorithm E22 is depicted in Figure 3. Figure 3: Key generating algorithm E22 for master and initialization keys
The initialization key is needed when two devices with no prior engagements need to communicate. During the initialization process, the PIN code is entered to both devices. The initialization key itself is generated by the E22 algorithm, which uses the PIN code, the Bluetooth Device Address of the claimant device and a 128-bit random number generated by the verifier device as inputs. The resulting 128-bit initialization key is used for key exchange during the generation of a link key. After the key exchange the initialization key is discarded. The Key generation algorithm E22 is depicted in Figure 3. Figure 3: Key generating algorithm E22 for master and initialization keys
The combination key is generated during the initialization process if the devices have decided to use one. It is generated by both devices at the same time. First, both of the units generate a random number. With the key generating algorithm E21, both devices generate a key, combining the random number and their Bluetooth device addresses. After that, the devices exchange securely their random numbers and calculate the combination key to be used between them. The master key is the only temporary key of the link keys described above. It is generated by the master device by using the key generating algorithm E22 with two 128-bit random numbers. As all the link keys are 128 bits in length, the output of the E22 algorithm is 128 bits, too. The reason for using the key generating algorithm in the first place is just to make sure the resulting random number is random enough. A third random number is then transmitted to the slave and with the key generating algorithm and the current link key an overlay is computed by both the master and the slave. The new link key (the master key) is then sent to the slave, bitwise XORed with the overlay. With this, the slave can calculate the master key. This procedure must be performed with each slave the master wants to use the master key with. Figure 5: Key generating algorithm E3 for the encryption key The encryption key is generated from the current link key, a 96-bit Ciphering Offset Number (COF) and a 128-bit random number. The COF is based on the Authenticated Ciphering Offset (ACO), which is generated during the authentication process. This process is depicted in Figure 5. When the Link Manager (LM) activates the encryption, the encryption key is generated. It is automatically changed every time the Bluetooth device enters the encryption mode.
The combination key is generated during the initialization process if the devices have decided to use one. It is generated by both devices at the same time. First, both of the units generate a random number. With the key generating algorithm E21, both devices generate a key, combining the random number and their Bluetooth device addresses. After that, the devices exchange securely their random numbers and calculate the combination key to be used between them. The master key is the only temporary key of the link keys described above. It is generated by the master device by using the key generating algorithm E22 with two 128-bit random numbers. As all the link keys are 128 bits in length, the output of the E22 algorithm is 128 bits, too. The reason for using the key generating algorithm in the first place is just to make sure the resulting random number is random enough. A third random number is then transmitted to the slave and with the key generating algorithm and the current link key an overlay is computed by both the master and the slave. The new link key (the master key) is then sent to the slave, bitwise XORed with the overlay. With this, the slave can calculate the master key. This procedure must be performed with each slave the master wants to use the master key with. Figure 5: Key generating algorithm E3 for the encryption key The encryption key is generated from the current link key, a 96-bit Ciphering Offset Number (COF) and a 128-bit random number. The COF is based on the Authenticated Ciphering Offset (ACO), which is generated during the authentication process. This process is depicted in Figure 5. When the Link Manager (LM) activates the encryption, the encryption key is generated. It is automatically changed every time the Bluetooth device enters the encryption mode.
time. This is depicted in Figure 4. After it has been created, it will be stored in the non-volatile memory of the device and i: rarely changed. Another device can use the other device's unit key as a link key between these devices. During th« initialization process, the application decides which party should provide its unit key as the link key. If one of the devices i: of restricted memory capabilities (i.e. cannot remember any extra keys), its link key is to be used.
time. This is depicted in Figure 4. After it has been created, it will be stored in the non-volatile memory of the device and i: rarely changed. Another device can use the other device's unit key as a link key between these devices. During th« initialization process, the application decides which party should provide its unit key as the link key. If one of the devices i: of restricted memory capabilities (i.e. cannot remember any extra keys), its link key is to be used.
Depending on whether a device uses a semi-permanent link key or a master key, there are several encryption modes available. If a unit key or a combination key is used, broadcast traffic is not encrypted. Individually addressed traffic can be either encrypted or not. If a master key is used, there are three possible modes. In encryption mode 1, nothing is encrypted. In encryption mode 2, broadcast traffic is not encrypted, but the individually addressed traffic is encrypted with the master key. And in encryption mode 3, all traffic is encrypted with the master key. Figure 6: Description of the encryption process
Depending on whether a device uses a semi-permanent link key or a master key, there are several encryption modes available. If a unit key or a combination key is used, broadcast traffic is not encrypted. Individually addressed traffic can be either encrypted or not. If a master key is used, there are three possible modes. In encryption mode 1, nothing is encrypted. In encryption mode 2, broadcast traffic is not encrypted, but the individually addressed traffic is encrypted with the master key. And in encryption mode 3, all traffic is encrypted with the master key. Figure 6: Description of the encryption process
Apart from the transmission speed, the USB Specification also standardizes the electrical and mechanical characteristics of the device connection (figure 1). In figure 1 the signals on lines D+ and D- are differential signals with voltage levels of OV and 3.3V. These two lines transmit the USB data. Additionally, an operating voltage of 5V is made available for low-end devices, which only draw a current of up to 100mA. Figure 1: Cross section of a USB cable and different USB plugs Most 8-bit microcontrollers with integrated USB functionality use the Low Speed implementation. Typical Low Speed applications are PC peripherals such as keyboards, mice and similar input devices. Motorola’s innovative MC68HC908JB8 is a good example of a microcontroller with integrated USB functionality *. This component contains the HCO8-CPU clocked with 6MHz and the Low Speed USB interface as well as 8K Flash memory. The on-chip programming and debugging interface makes this MCU ideal for use in Low Speed applications and the development of USB applications in the laboratory.
Apart from the transmission speed, the USB Specification also standardizes the electrical and mechanical characteristics of the device connection (figure 1). In figure 1 the signals on lines D+ and D- are differential signals with voltage levels of OV and 3.3V. These two lines transmit the USB data. Additionally, an operating voltage of 5V is made available for low-end devices, which only draw a current of up to 100mA. Figure 1: Cross section of a USB cable and different USB plugs Most 8-bit microcontrollers with integrated USB functionality use the Low Speed implementation. Typical Low Speed applications are PC peripherals such as keyboards, mice and similar input devices. Motorola’s innovative MC68HC908JB8 is a good example of a microcontroller with integrated USB functionality *. This component contains the HCO8-CPU clocked with 6MHz and the Low Speed USB interface as well as 8K Flash memory. The on-chip programming and debugging interface makes this MCU ideal for use in Low Speed applications and the development of USB applications in the laboratory.
However, USB token has come to be a better choice to reinforce the existing security solution mechanism due to its extreme portability and low cost issues. Anyone can be able to represent his digital signature through USB token from any corner of the world. The future probability and public acceptability of USB token-based identification mechanism ° can be illustrated through the following data collected from online poll presented in figure 3.
However, USB token has come to be a better choice to reinforce the existing security solution mechanism due to its extreme portability and low cost issues. Anyone can be able to represent his digital signature through USB token from any corner of the world. The future probability and public acceptability of USB token-based identification mechanism ° can be illustrated through the following data collected from online poll presented in figure 3.
Figure 4: Flowchart of authenticating a new USB device The system is able to register new USB tokens by detecting new USB devices when plugged in by extracting token from the USB controller and looking up the system database. Administrators can plug in new USB devices for registering it for authenticity and configure the system for the newly registered USB token. The procedure of new USB device detection is illustrated in figure 4.
Figure 4: Flowchart of authenticating a new USB device The system is able to register new USB tokens by detecting new USB devices when plugged in by extracting token from the USB controller and looking up the system database. Administrators can plug in new USB devices for registering it for authenticity and configure the system for the newly registered USB token. The procedure of new USB device detection is illustrated in figure 4.
On being triggered the mail system sends predefined mail to the administrator or system authority. The workflow of the security warning system is shown in figure 7. Security warning mail system is an essential part of the security system implemented. It runs in the background at the server layer as a mailing daemon and is another micro module of the authentication server. The logic or program access controller triggers the security warning mail system after certain number of attempts of illegal access trial as set by the administrator.
On being triggered the mail system sends predefined mail to the administrator or system authority. The workflow of the security warning system is shown in figure 7. Security warning mail system is an essential part of the security system implemented. It runs in the background at the server layer as a mailing daemon and is another micro module of the authentication server. The logic or program access controller triggers the security warning mail system after certain number of attempts of illegal access trial as set by the administrator.
The security warning mail system can be used with any other authentication services that can be added to the security system according to requirement, for example, the security system can be used to monitor presence of a number of people during a certain period of time. Appropriate monitoring service module can be implemented to monitor the USB tokens requested for login access during a certain period of time and thus can identify people who have not requested any login in time and can trigger the mail daemon to send notification messages to the appropriate authority mentioning about the absent ones. The system overview is shown in the block diagram presented in figure 8.
The security warning mail system can be used with any other authentication services that can be added to the security system according to requirement, for example, the security system can be used to monitor presence of a number of people during a certain period of time. Appropriate monitoring service module can be implemented to monitor the USB tokens requested for login access during a certain period of time and thus can identify people who have not requested any login in time and can trigger the mail daemon to send notification messages to the appropriate authority mentioning about the absent ones. The system overview is shown in the block diagram presented in figure 8.
Nothing unusual will happen to the coordinates, but we will want to keep careful track of the ranges of the other two coordinates. In this case, of course we have—00<t<+00, Q<r<+o. Technically, the world line r = 0 represents a coordinate singularity and should be covered by a different patch, but we all know what is going on so we will just act like r = 0 is well behaved. Our task is made somewhat easier if we switch to null coordinates: The metric in these coordinates is given by,
Nothing unusual will happen to the coordinates, but we will want to keep careful track of the ranges of the other two coordinates. In this case, of course we have—00<t<+00, Q<r<+o. Technically, the world line r = 0 represents a coordinate singularity and should be covered by a different patch, but we all know what is going on so we will just act like r = 0 is well behaved. Our task is made somewhat easier if we switch to null coordinates: The metric in these coordinates is given by,
The ranges are now,
The ranges are now,
Therefore, the Minkowski metric finally takes form, This has a certain appeal, since the metric appears as a fairly simple expression multiplied by an overall factor. We can make it even better by transforming back to a time like coordinate 7 and space like (radial) coordinate y , via,
Therefore, the Minkowski metric finally takes form, This has a certain appeal, since the metric appears as a fairly simple expression multiplied by an overall factor. We can make it even better by transforming back to a time like coordinate 7 and space like (radial) coordinate y , via,
Figure-3 : Co-ordinate system for a linear arrangement of current-sources Figure-1: Arrangement of a four-point probe on a rectangular sample for the measurement of Sheet Resistivities From expression (5), the present problem can be reduced to a summation of lines of current sources with alternating sign in only one direction. In the coordinate
Figure-3 : Co-ordinate system for a linear arrangement of current-sources Figure-1: Arrangement of a four-point probe on a rectangular sample for the measurement of Sheet Resistivities From expression (5), the present problem can be reduced to a summation of lines of current sources with alternating sign in only one direction. In the coordinate
Let us consider a _ rectangular sample with the dimensions ad and d. Apply four- point probe method as shown in figure-1. The probe is arranged symmetrically with point spacingS. To obtain the voltage between the two center points marked 1 and 2, an infinite arrangement of dipoles must be considered, as shown in figure-2. All these contribute to the voltages between points marked 1 and 2. F. Ollendroff et al [5] gives the potential distribution for an infinite number of current sources, arranged in a line and equally spaced. With a coordinate system as in Figure-3 the potential is given by
Let us consider a _ rectangular sample with the dimensions ad and d. Apply four- point probe method as shown in figure-1. The probe is arranged symmetrically with point spacingS. To obtain the voltage between the two center points marked 1 and 2, an infinite arrangement of dipoles must be considered, as shown in figure-2. All these contribute to the voltages between points marked 1 and 2. F. Ollendroff et al [5] gives the potential distribution for an infinite number of current sources, arranged in a line and equally spaced. With a coordinate system as in Figure-3 the potential is given by
Table-1: Calculated correction Factor C for the Measurement of Sheet Resistivities using the Four-Point Probe Method. RMrnal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Table-1: Calculated correction Factor C for the Measurement of Sheet Resistivities using the Four-Point Probe Method. RMrnal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
The table —II may be used to determine the error on¢ makes by just approximating with C'=1. In this case of circular sample only one image, it is necessary to fulfill the boundary conditions. The image is obtained by “reflecting” the dipole on the circle [5] For a four- point probe centered in the sample the voltage becomes:
The table —II may be used to determine the error on¢ makes by just approximating with C'=1. In this case of circular sample only one image, it is necessary to fulfill the boundary conditions. The image is obtained by “reflecting” the dipole on the circle [5] For a four- point probe centered in the sample the voltage becomes:
source in the lower half. Thus only the sources in the lower half are to be considered and the result must be multiplied by 2. Ss From symmetry reasons, it follows that each source in the upper half of the plane (as shown in figure-2) contributes the same Av, as does the corresponding source in the lower half. Thus only the sources in the lower half are to be considered and the result must be multiplied by 2. Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6264 contributes the same Av, as does the corresponding
source in the lower half. Thus only the sources in the lower half are to be considered and the result must be multiplied by 2. Ss From symmetry reasons, it follows that each source in the upper half of the plane (as shown in figure-2) contributes the same Av, as does the corresponding source in the lower half. Thus only the sources in the lower half are to be considered and the result must be multiplied by 2. Journal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6264 contributes the same Av, as does the corresponding
where d is the diameter of the circle. The correction factor is also given in table I.
where d is the diameter of the circle. The correction factor is also given in table I.
Numerical Solution of one Dimensional Heat Conduction Equation by Finite Difference Method. M. Mostafizur Rahman? Pournal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Numerical Solution of one Dimensional Heat Conduction Equation by Finite Difference Method. M. Mostafizur Rahman? Pournal of Computer Science, Volume1, Number 1, June 2007, ISSN: 1994-6244
Il. CRANK-NICOLSON METHOD In this work, the above equation is taken as test equation and its exact solution is known. Here it is solved to get numerical solution by Crank-Nicolson method, explicit method and fully implicit method and after that all the values are compared with the exact solution to put forward the batter methodology to solve heat conduction equation.
Il. CRANK-NICOLSON METHOD In this work, the above equation is taken as test equation and its exact solution is known. Here it is solved to get numerical solution by Crank-Nicolson method, explicit method and fully implicit method and after that all the values are compared with the exact solution to put forward the batter methodology to solve heat conduction equation.
Figure 2: Graphical representation of the exact solution and the numerical solution by Crank- a aT ee; es ea oe ae ae Se ee DN EOE Figure 2 is the Graphical representation of the exact solution and numerical solution by Crank-Nicolson method at h =.05, k=.0005 at =.5 with an accuracy up to three decimal. Where we see that there is a little gaze at the middle of the graph.
Figure 2: Graphical representation of the exact solution and the numerical solution by Crank- a aT ee; es ea oe ae ae Se ee DN EOE Figure 2 is the Graphical representation of the exact solution and numerical solution by Crank-Nicolson method at h =.05, k=.0005 at =.5 with an accuracy up to three decimal. Where we see that there is a little gaze at the middle of the graph.
Figure 1: Graphical representation of the exact solution and numerical solution by explicit method at h=.05, k=.0005 at t=.5 Figure | is the Graphical representation of the exact solution and numerical solution by the Explicit method at h=.05, k=.0005 at t =.5. Where both the graphs coincide with an accuracy up to four decimal.
Figure 1: Graphical representation of the exact solution and numerical solution by explicit method at h=.05, k=.0005 at t=.5 Figure | is the Graphical representation of the exact solution and numerical solution by the Explicit method at h=.05, k=.0005 at t =.5. Where both the graphs coincide with an accuracy up to four decimal.
Figure 3 is the Graphical representation of the exact solution and numerical solution by the Implicit method at h=.05, k=.0005 at t=.5 with an accuracy up to three decimal. Where we see that there is aloofness between the graphs of the numerical result.
Figure 3 is the Graphical representation of the exact solution and numerical solution by the Implicit method at h=.05, k=.0005 at t=.5 with an accuracy up to three decimal. Where we see that there is aloofness between the graphs of the numerical result.
In figure 4 we give the Graphical representation of the solution given by Explicit, Crank-Nicolson and fully implicit method at h=.05, k=.0005 at t=.5. Journal of Computer Science, Volume1, Number 1, June 2007, ISSN : 1994-6244
In figure 4 we give the Graphical representation of the solution given by Explicit, Crank-Nicolson and fully implicit method at h=.05, k=.0005 at t=.5. Journal of Computer Science, Volume1, Number 1, June 2007, ISSN : 1994-6244
Figure 2. Interface of SCDB of Web Data Administrator After running Web Data Administrator one can open the home page of administrator in the browser by indicating appropriat address and port. After passing the authorization at the home page, an access to the own interface of administrator wil appear. Here points out that “interface” it is simple and visible for users (administers of SQL server) so that they do not hav to break their heads for any exercise (Picture-2). In the enlisted functions of Web Data Administrator present the controls of data base (Create and delete the data base, edit the tables structure and saving procedures, export and import data base from the users of SQL scripts, control the records of encountered users and groups (create, delete, edit). Except these Web Data Administrator includes SQL-client with the abilities to save the command texts in the file (This client is loaded when it crosses the foot-notes of query of objects in the tables of data base or in the control panel).
Figure 2. Interface of SCDB of Web Data Administrator After running Web Data Administrator one can open the home page of administrator in the browser by indicating appropriat address and port. After passing the authorization at the home page, an access to the own interface of administrator wil appear. Here points out that “interface” it is simple and visible for users (administers of SQL server) so that they do not hav to break their heads for any exercise (Picture-2). In the enlisted functions of Web Data Administrator present the controls of data base (Create and delete the data base, edit the tables structure and saving procedures, export and import data base from the users of SQL scripts, control the records of encountered users and groups (create, delete, edit). Except these Web Data Administrator includes SQL-client with the abilities to save the command texts in the file (This client is loaded when it crosses the foot-notes of query of objects in the tables of data base or in the control panel).
Figure 1. Running window of Web Data Administrator
Figure 1. Running window of Web Data Administrator
In this paper, we have discussed a mechanism for web-administering of databases. We proposed a tool ‘Microsoft SQL Web Data Administrator’ to be used for this purpose which is helpful for SCBD. Cassini is a web server written in C#. It can act as web server where IIS are not present. We have also provided the necessary code written in Delphi 8 for web-administering using Web Data Administrator. V. CONCLUSION
In this paper, we have discussed a mechanism for web-administering of databases. We proposed a tool ‘Microsoft SQL Web Data Administrator’ to be used for this purpose which is helpful for SCBD. Cassini is a web server written in C#. It can act as web server where IIS are not present. We have also provided the necessary code written in Delphi 8 for web-administering using Web Data Administrator. V. CONCLUSION
Table 1. 3*3 Reversible logic function A generalization of CNOT is a 3-input 3-output Toffoli gate [4]. The Toffoli gate negates the third bit iff the first two bits are 1. Figure 1 shows both gates as they are commonly drawn. A generalized n*n Toffoli gate changes one bit, called the target, if some of the & bits are 1 which is shown in Figure 2. The changing bit, also called target, may also be in any position. The gate will be defined as follows T(xi1, Xiz, ...,Xik : Xn) where x, is the target and Xi, Xi2, ...,Xix are the control bits.
Table 1. 3*3 Reversible logic function A generalization of CNOT is a 3-input 3-output Toffoli gate [4]. The Toffoli gate negates the third bit iff the first two bits are 1. Figure 1 shows both gates as they are commonly drawn. A generalized n*n Toffoli gate changes one bit, called the target, if some of the & bits are 1 which is shown in Figure 2. The changing bit, also called target, may also be in any position. The gate will be defined as follows T(xi1, Xiz, ...,Xik : Xn) where x, is the target and Xi, Xi2, ...,Xix are the control bits.
Example 2. In Figure 3, bit strings (1,1,1) and (1,1,0) have been swapped using T(b, c: a). Since the Hamming distance between them is one, this swapping can be carried out without affecting others. UselessGate: A pair of gates in a network is considered to be useless if it has no effect in the circuit, i.e., when it is identified and removed from the network it will have no effect in the final output produced by the circuit.
Example 2. In Figure 3, bit strings (1,1,1) and (1,1,0) have been swapped using T(b, c: a). Since the Hamming distance between them is one, this swapping can be carried out without affecting others. UselessGate: A pair of gates in a network is considered to be useless if it has no effect in the circuit, i.e., when it is identified and removed from the network it will have no effect in the final output produced by the circuit.
Fig 4: Example of Use less Gate produced by the new circuit will be the same as the previous ome
Fig 4: Example of Use less Gate produced by the new circuit will be the same as the previous ome
Example 4: In the example below let we want to swap (1,1,0) and (1,0,1). But we cannot do it directly since the Hamming distance between them is greater than one. This can be carried out by a sequence of swap operations: first (1,0,1) and (1,1,1), then (1,1,0) and (1,1,1). Finally (1,1,1) and (1,0,1).
Example 4: In the example below let we want to swap (1,1,0) and (1,0,1). But we cannot do it directly since the Hamming distance between them is greater than one. This can be carried out by a sequence of swap operations: first (1,0,1) and (1,1,1), then (1,1,0) and (1,1,1). Finally (1,1,1) and (1,0,1).
Fig 10. Reverse Specification control lines to each Toffoli gate. For larger problems with up to 8 or 9 inputs this may not be a practical one. Selective use of control inputs can be used to swap elements. This can be carried out safely as long as it will not affect bit strings that are already in its intended place. We should choose a subset of the control inputs that will minimize the C(/) of the resulting specification. For example, we can select control inputs that will drive a Toffoli gate to bring more than one element at a time to their intended place.
Fig 10. Reverse Specification control lines to each Toffoli gate. For larger problems with up to 8 or 9 inputs this may not be a practical one. Selective use of control inputs can be used to swap elements. This can be carried out safely as long as it will not affect bit strings that are already in its intended place. We should choose a subset of the control inputs that will minimize the C(/) of the resulting specification. For example, we can select control inputs that will drive a Toffoli gate to bring more than one element at a time to their intended place.
Fig 8. Constructing network using variant of BSSSN Algorithm BSSSN is straightforward. It is greedy in the sense it hopes that a bit string can be swapped by the one that is in its intended place. Because of Lemma | and 2, it is always possible to find two bit strings for Steps 2 that can be swapped. Therefore, it will always terminate successfully with a circuit for a given specification. The best case occurs when a bit string can always be swapped by the bit string placed in its intended position. A variant of BSSSN takes the bit string in the set whose integer representation is low and brings it to its intended place. Figures 8 and 9 illustrate the application of the variant of BSSSN and the sequence of gates that form the network is: T(b’,c':a)T(b.c':a)T(b’,c:a)T(a.c:b) T(b,c:a).
Fig 8. Constructing network using variant of BSSSN Algorithm BSSSN is straightforward. It is greedy in the sense it hopes that a bit string can be swapped by the one that is in its intended place. Because of Lemma | and 2, it is always possible to find two bit strings for Steps 2 that can be swapped. Therefore, it will always terminate successfully with a circuit for a given specification. The best case occurs when a bit string can always be swapped by the bit string placed in its intended position. A variant of BSSSN takes the bit string in the set whose integer representation is low and brings it to its intended place. Figures 8 and 9 illustrate the application of the variant of BSSSN and the sequence of gates that form the network is: T(b’,c':a)T(b.c':a)T(b’,c:a)T(a.c:b) T(b,c:a).
Fig 9. Circuit for the network constructed by variant of BSSSN
Fig 9. Circuit for the network constructed by variant of BSSSN
Related topics:
Network Planning
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved