Search is not available for this dataset
query
stringlengths 1
13.4k
| pos
stringlengths 1
61k
| neg
stringlengths 1
63.9k
| query_lang
stringclasses 147
values | __index_level_0__
int64 0
3.11M
|
|---|---|---|---|---|
For cosmic jets produced in gamma ray bursts or quasars, I've read that you have to assume a "Force-free magnetosphere" in order to explain these phenomena through electromagnetism. From my understanding, force-free means that the particles from the accretion disk have velocity along the lines of the magnetic field, but my question is how did the particles get velocity in that direction in the first place? | Related: I have put a bit of commentary enumerating my confusions in parentheses I read in Black Holes and Time Warps (Kip Thorne), that quasars can generate their jets from four different processes. These all involved the accretion disk, but there was one which doesn't make quite as much sense. It was called the Blandford-Znajek process, and it involved magnetic field lines carrying current. The process was visualized in two ways. A black hole, with magnetic field lines, is spinning. In the first visualisation (viewpoint actually), the magnetic field lines 'spin' along with the black hole, and nearby plasma is anchored onto the field lines by electrical forces (where did the electrical fields come from?). The plasma can slide along the field lines but not across them (why?). Since the field lines are spinning, centrifugal forces will fling them up and down the field lines, forming jets. The other viewpoint is this, and it makes even less sense (to me that is, I haven't had a formal education in GR): The magnetic fields and the swirl of space generate a voltage difference across the field lines (Why? How?). The voltage carries current across the magnetic field lines (why are the field lines behaving like wires?). This current travels across plasma, which accelerates it, creating the jets. Now the main thing that doesn't make sense, is that magnetic field lines are behaving like wires. Why would they? I suspect the answer lies hidden somewhere in the equivalence of EM waves in different frames, but I can't think up any convincing argument from that side. If the answer involves GR equations, you don't need to solve it here (wouldn't make sense to me), but if you have to, just refer to the equation and what you did to it, along with the final result. Thanks! | Take a sponge ball and compress it. The net force acting on the body is zero and the body isn't displaced. So can we conclude that there is no work done on the ball? | eng_Latn | 4,400 |
If we had a radio antenna produce visible light? If we had a radio antenna produce visible light would it degrade the quality of the antenna due to the light production. How fast would be the degradation? | Radio antenna producing waves in the visible spectrum If a radio could produce waves in the visible light spectrum, what would the result be? This is a thought experiment that I've pondered for a few years now. I realize there are a few/many real-world constraints, but if we lifted these constraints for the sake of thought, what could we expect? Personally, I don't see why we wouldn't observe visible light emitting from the antenna, disregarding any light from Blackbody Radiation. | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,401 |
Did Palpatine have the very same powers as Darth Plagueis? In the Senate, and later again in his office, chancellor Palpatine tells Anakin how Darth Plagueis taught him everything before being slain by Palpatine. Does this include the power to save lives and to make midi-chlorians create life? Palpatine later tells Anakin (now Darth Vader) that only Plagueis was capable of this, which is a contradiction to his former statements, but that when working together they can lift the veil. How much power did Palpatine / Darth Sidious have over the midi-chlorians? | Did Sidious know the secret of cheating death? In Star Wars: Revenge of the Sith, Chancellor Palpatine tells Anakin the tale of Darth Plagueis the Wise. He told Anakin that if he joined the dark side he could save the people he loved from death by extending their midichlorian count, just as Darth Plagueis had done (obviously more subtly than that). When Anakin asked what had happened to Plagueis, Palpatine says: Unfortunately, he taught his apprentice everything he knew. Then his apprentice...killed him in his sleep. It is revealed (not in the movie) that it was Palpatine himself that was Plagueis' apprentice After Anakin and Palpatine kill Mace Windu, Palpatine says, To cheat death is a power only one has achieved, but if we work together I know we can discover the secret. This implies that Palpatine doesn't already know the secrets but if Plagueis taught him "everything he knew" then surely he would have. So did Sidious know the entire time or was "everything he knew" an exaggeration? Just to be clear when I say "cheat death" I only mean extending someone's midichlorian count, not "transfer essence" or anything else like that. | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,402 |
is it possible to use AAG with two 2-Node Clusters across two datacenters? Is the following scenario possible? 2-Node Automatic Failover Cluster in DC1, shared disk 2-Node Automatic Failover Cluster in DC2, shared disk employ a 'Node and Disk Majority' employ AAG across datacenters failover will be manual; availability mode asynchronous The datacenters are up to 15.5-miles apart. Thanks for the help! | is it problematic to cluster across two datacenters w/aag? In general is it problematic to cluster across two datacenters that are up to 15-miles apart? For this one particular project the approach is the following? 2-Node Failover Cluster across two datacenters, one node per datacenter local SAN disks, no shared disks 'Node and FileShare Majority' at third location on-campus employ AAG, failover will be manual; asynchronous mode Is anyone implementing something like this with success??!? Thanks so much for the help!! | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,403 |
Capacitor connected across two isolated sources Lets say there are two isolated sources of positive charges $q_1$ and $q_2$ $(q_1>q_2)$ located sufficiently far apart. If the two are connected to the two plates of a capacitor, then what is the resulting charge distribution across each capacitor plate? | Capacitor with different charges on each plate I am confused as to whether/how capacitance changes when each plate has a different charge. For example, consider a coaxial cable and put $20Q$ on the outer cable, and $-Q$ on the inner. Or how about concentric spheres, grounding either the inner or the outer? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,404 |
Do Photons interfere when it passes through a slit (one)? When a light (photons) goes through two slits it creates interference patterns. if the light goes through a "single" slit, does it create interference patterns or does it behave like particles (photons)? is the pattern same for both particles and light waves if it is a "single slit"? In the double slit experiment, if you close one slit (or observe) it is said that light behave as particles (bullets) which means that through one slit light exactly behaves as stream of particles?? | How can a single slit diffraction produce an interference pattern? How can a light passed though a single slit produce a similar interference pattern to the double-slit experiment? How does the diffracted wave produce the points of cancellation and reinforcement, if there is only one wave? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,405 |
Derivation of the compensating resistor in integrator with DC gain control Hi all in EE stackchange, I wonder how the compensating resistor (\$R_3\$) in integrator with DC gain control equals \$R_3 = R_1 || R_2\$, which is to offset effect by the input bias current. I was trying to derive it by same way in Razavi's textbook but I can’t reach the result of compensating resistor \$R_3=R_1 || R_2\$ (As depicted in below Figure) It would be very appreciated if someone let me understand this. Thank you in advance! | Reason behind choosing the compensating resistor for input bias current in op amps I found the following explanation online on determining the values used for the compensating resistor: In either case, the compensating resistor value is determined by calculating the parallel resistance value of R1 and R2. Why is the value equal to the parallel equivalent of R1 and R2? When using the Superposition Theorem to figure how much voltage drop will be produced by the inverting (-) input's bias current, we treat the bias current as though it were coming from a current source inside the op-amp and short-circuit all voltage sources (Vin and Vout). This gives two parallel paths for bias current (through R1 and through R2, both to ground). We want to duplicate the bias current's effect on the noninverting (+) input, so the resistor value we choose to insert in series with that input needs to be equal to R1 in parallel with R2. Although it is a 'crisp' and simple explanation, I don't understand how it is true, since the current flowing through R2 won't directly go to the ground, but will probably enter the op-amp at the output (op-amp as a current sink). Also, it might go through a few more resistances before going to the ground, since Vout isn't directly connected to the ground. | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,406 |
How we can detect a magnetic monopole? How we can detect magnet monopole? How we can distinguish it from electric monopole? If we change E to B and B to -E in Maxwell's equations we get proper equations for charge and current density which we can call them magnetic charge and magnetic current. Even if magnetic monopole exits there is no distinction with electric monopole! | How would I go about detecting monopoles? A question needed for a "solid" sci-fi author: How to detect a strong magnetic monopole? (yes, I know no such thing is to be found on Earth). Think of basic construction details, principles of operation and necessary components of a device capable of detecting/recognizing a macroscopic object emitting magnetic field of equivalent of order ~0.1-10 Tesla near its surface, but with only one pole, reliably distinguishing it from normal (2-pole) magnets, preferably at a distance. Preferably a robust method, not involving extremely advanced technology. Detect the presence, possibly distance (or field strength) and direction. I know of SQUIDs, but these concentrate on extreme sensitivity. I'm thinking of something less sensitive but more robust (like, no need for the monopole to fall through the loop) and still able to recognize a monopole against a magnet. Also, how would such a macroscopic object behave practically? Such a "one-pole magnet" about the size and strength of a refrigerator magnets - how would it behave around ferromagnetics, normal magnets and so on? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,407 |
Bloom Hulk and Kronch Wrangler When you have a on the battlefield Whenever a creature with power 4 or greater enters the battlefield under your control, put a +1/+1 counter on Kronch Wrangler. and a enters the battlefield When Bloom Hulk enters the battlefield, proliferate. which ETB effect goes onto the stack first? Are the triggers simultaneous, so I as an active player can choose to give my Kronch Wrangler a counter, and then proliferate it? | What order do triggered abilities happen in if multiple things trigger at the same time? I had several humans on the battlefield. On turn three, I played . On turn four, I played . On turn five, during my upkeep, this question came up. At this point, I need to draw/reveal three cards. If I reveal a human, Descendants' Path will allow me to cast it without paying its mana cost. So, does it matter when I draw the human? The static abilities state "at the beginning up your upkeep..." which leads me to believe that those two draws/reveals would happen before my normal draw. If that's the case, does the draw order happen in the same order that I played the enchantments? In the end, that's how we decided to do it. I drew first for Triumph of Ferocity, then I revealed for Descendants' Path, then I drew for my turn. Did we do it right? | How quickly is the desired state of curl of the Electric Field around a point achieved where a Magnetic Field Vector has just begun changing? My question and context with explanation are given below. Thank you in advance. Faraday’s Law () states that a time-changing magnetic field vector induces a curl of the Electric field around that point. However it does not specify how quickly the necessary spatial gradient is developed in the Electric Field to satisfy that curl. Of course, the Electric Field vectors around that point cannot just jump to the required values instantaneously in accompaniment as soon as the magnetic field starts changing at a fixed rate, since it is required that the Electric Field has a sensible rate of change to in turn induce a curl of the magnetic Field and continue the propagation of the wave. It would seem the exact rates at which the Electric and Magnetic Fields are changing is critical in the mechanism of an EM wave’s propagation. How would I then calculate the rate of change of E somewhere along the wave given I know the rate of change of the B vector that began it, and given the wave is restricted to one dimension for simplicity? There should after all be some delay in how the EM wave moves from point to point in space, seeing as it moves at the finite speed of causality (3*10^8 m/s), as shown in the first image: Some of my ideas so far have been that perhaps the rate of change of E is determined such that it exactly cancels the growth of the time-changing E vector that gave rise to a curl of B before, which developed at such a rate to induce a curl of E, which demands this rate of change of E which I am talking about now. In this way the wave might level out the growth of the fields in its wake and spread the change further outwards, in the same way smoothening out a crease spreads it elsewhere. However I am stuck on how to show this rigorously. I am open to any difficulty of maths, so long as the answer provides the explanation. Below are some diagrams to help visualize what I am talking about: Faraday's Law requires that a curl of E is developed, which under these restrictions requires a spatial gradient of E to appear across that point. Since the field across that point was previously in some other state, it is required that the Electric Field vectors that are infinitesimally close to that point undergo a rate of change through time to achieve the desired state of curl. The question is, how quickly is this desired state of curl achieved? | eng_Latn | 4,408 |
What is the total propagation delay of the ripple adder? Assume 4 full adders are cascaded. Propagation delay of XOR gate = 20 ns, AND gate = 15 ns and OR gate = 10 ns. What is the total propagation delay of the ripple adder, if the output is stabilized ? My try : When 4 full adders are cascaded, then carry has to ripple upto the last adder. After the output is stabilized, I can say total propagation delay = 3*45 + 40 = 175 ns. My try is based on the assumption of below circuits. Here, 1st XOR and 1st AND gate can be done parallely and 2nd XOR and 2nd AND gate can be done parallely. | Delay in 4-bit ripple carry adder? In pic below I have drawn a full adder and mentioned their delays, please help me to verify my answer. | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,409 |
Does finishing normal mode on the Cayo Perico Heist give you hard mode? I missed the chance to get the hard mode on the Cayo Perico heist on GTA Online, so if I complete the normal one again can I get the hard mode again? | After finishing The Cayo Perico Heist, how long will it be set in hard mode? After I finished The Cayo Perico Heist, I tried setting up another heist in the Kosatka, and got this message : The setup cost for The Cayo Perico Heist is $25000. Setting up now will set the heist to Hard Mode. Do you wish to proceed? It seems that there is a cooldown period before the heist reverts to normal mode from hard mode. How long will it take before it reverts to normal mode? Also, does the cooldown timer run even if you're logged out of GTA Online? E.g., if I quit GTA Online just after finishing the heist, the next time I log back in, will I have to wait for the cooldown period to finish before it reverts to normal mode? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,410 |
If oil starts to smoke, does that mean it's already gone toxic? When heating oil sometimes I notice smoke comes out and this sets home smoke detector off. At this point I lower the fire or just add food. Does this mean that it's already hit the smoking point and the oil should no longer be used? If it hits smoking point and we lower the temperature is it still ok to use or is it only a problem with reuse? | Is it safe to use oil at its smoking point? Teflon toxicity and second degree burns aside, are there any health issues related to cooking with oil at or past its smoking point? Googling a bit I found one article that went so far as to say you should always "discard oil that's reached its smoke point, along with any food with which it had contact". Other searches showed pages suggesting cancer risks. I've never given it a thought before and I often use peanut oil at smoking point to brown meat. | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,411 |
Is the current in a resistor different from that in a circuit? My understanding is that since Current = Charges/Time. If there exists a resistance to the flow of charges, then that must mean the charges slow down, meaning that more time is required to pass through a point. So, the current should then decrease. But, since this opposition to the flow of charges doesn't exist in the ENTIRE circuit, it should really only decrease the current in the resistor, right? | Is the current obtained using Ohm's law that which passes through the resistor or that which passes through the circuit? Shouldn't the current passing through a resistor be lesser than that which passes through a circuit? My understanding is that since Current = Charges/Time. If there exists a resistance to the flow of charges, then that must mean the charges slow down, meaning that more time is required to pass through a point. So, the current should then decrease. But, since this opposition to the flow of charges doesn't exist in the ENTIRE circuit, it should really only decrease the current in the resistor, right? Am I confusing the resistance of the resistor with the resistance of the wire? Any help will be appreciated! Thanks a bunch for lending me some of your time :D | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,412 |
Transformers - Why more coils in second coil causes more voltage | Why do we multiply the magnetic flux by the winding number? | Java Thread priority has no effect | eng_Latn | 4,413 |
Does a bulb offer still offer resistance even after it gets fused? Sorry, for my naivety this is my first time posting here. But, my question is that will the bulb offer any resistance after it's fused? I know that no current can flow though the fused bulb i.e. $I=0$. That makes $R = V/0$ undefined. And voltage and total resistance stay the same, right? So, shouldn't the rest of the bulbs in the circuit get brighter? But that isn't the case and it turns out that the potential difference of the circuit decreases (to nullify the voltage increase on the other bulbs). I'm very confused here, please help. Thank you. | Does a filament of lamp still have resistance when no current flows, and if yes, why? Does a filament lamp still have resistance when no current flows? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | eng_Latn | 4,414 |
How does a CM choke reject common-mode noise while allowing the signal of interest? As far as I know a CM choke is nothing but a transformer(?). How does it block common-mode noise and pass the signal of interest? Should we think of it as an LR filter? And how to size it if we know the signal of interest? A pictorial explanation with a circuit diagram ect helps to understand. Edit: Below are two scenarios where an isolated(floating/battery powered) sensor S signal is measured by an ADC device and the system is single ended. The coaxial cable’s two wires somehow are victim of CM noise. As you see the CM noise is the spike superimposed on the half sine wave desired signal: So in the first scenario(upper diagram) I can see how the CM blocks this spike now. But in the bottom diagram there is an attempt to remove the same spike with a LPF where the LPF’s ground is the signal ground as usual. Will this attempt also remove the spike or not? | What exactly happens to the signals hitting a common mode choke? I'm trying to better understand the principles behind the common mode choke. I made a few drawings to clarify. Differential Mode Signals Differential currents (driven by differential voltages) create equal but opposite magnetic fields B in the inductor core: These magnetic fields cancel each other out, so the net flux in the core is zero. As such, these differential currents don't "feel" any impedance. Common Mode Signals In contrast, common mode currents generate equal and additive magnetic fields in the core. That's why they "feel" a high impedance, and cannot get through (or getting through means they are highly attenuated). But what exactly happens? I have several theories, which I will describe below. Common Mode Signals - Theory 1 My first thought would be that the common mode signal hits the choke and creates a magnetic flux inside. By doing this, lots of energy is lost (hysteresis and perhaps other effects) as heat. Only a small part gets through: What kind of common mode choke would behave in this particular way? "Burning up" the voltage spike seems a very desirable effect to me. Common Mode Signals - Theory 2 Perhaps the voltage spike doesn't really get the chance to build up much magnetic flux in the core, or maybe the core is simply not "lossy" enough. The voltage spike bounces off the core and turns back. Only small part gets through: Although the system on the right side of the choke is protected, the system on the left has to deal with reflected signals. Nasty things like standing waves might appear. My questions I've got a few questions for you: Do you think theory 1 or theory 2 is most plausible? Do you think certain types of common mode chokes tend to behave as described in theory 1, others like in theory 2? Perhaps both of my theories are just plain wrong. If so, what actually does happen? Please enlighten me. | How can PCB trace have 50 ohm impedance regardless of length and signal frequency? Hmm, this seems to be just another question on line impedances. I understand that when we say "transmission line" effects we talk about things like cross talk, reflections and ringing (I guess that is just about it). These effects are not present at low frequencies where the PCB trace behaves like an "ideal" transmission medium, more like we expect a wire to behave in our early school days. I also understand that the 50 ohm value comes not from the line resistance which is going to be very small and less than 1 ohm. This value comes from the ratio of L and C on the line. Changing C by changing the trace height above ground plane or changing L by changing the trace width shall change the impedance of the line. We all know that the reactance of L and C is dependant on the signal frequency as well. Now my questions: Why should we not call this as line reactance only rather than line impedance? How can it be just 50 ohm? It has to be signal frequency dependent right? E.g 50 ohm at 1 MHz Will the world end if I chose to do a 100 ohm or 25 ohm trace instead? I know that while we like to say 50 ohm as a magic number, it will be within some range around 50 ohm and not 50.0000 ohm exactly. Is there any time when the actual resistance of a PCB trace may matter? | eng_Latn | 4,415 |
Event Pulse Classification with Multi-Voltage Threshold samples for scatter rejection in PET | Quadratic programming time pickoff method for multi-voltage threshold digitizer in PET | Completely Stale Transmitter Channel State Information is Still Very Useful | eng_Latn | 4,416 |
Reliability improvement of embedded train anti-collision system by multi-processor technology | C ASE S TUDY : 16-CHANNEL DAQ DEVICE AND ITS APPLICATION TO P LANT | Path collective variables without paths | eng_Latn | 4,417 |
In this paper, we propose a low computational equalization method for capsule endoscope (CE) system. In CE system, low power transmission and reception is essential because the devices which are transplanted or patched on human body should be small and durable to allow the patient to move freely. Also, the pace of change in channel between CE and receiver is quite variable due to the bowel movements. Therefore, it is necessary to design a low computational equalizer structure for CE system, because there are difficulties in practical application of the conventional equalization due to its high computational complexity. Therefore, we propose an equalization method that focuses on reducing computational complexity. The proposed method adaptively decides the requirement of filter update with simple operation, and we verified that the proposed method improves the performance versus computational complexity trade-offs efficiently compared to the conventional method. | Partial-update adaptive filtering algorithms only update part of the filter coefficients at each time instant, leading to reduced computational complexity as compared with their conventional counterparts. In this paper, the ideas of the partial-update NLMS-type algorithms found in the literature are extended to the framework of set-membership filtering, from which data-selective NLMS type of algorithms with partial update are derived. The new algorithms combine data-selective updating from set-membership filtering with the reduced computational complexity from partial updating. Simulation results verify the good performance of the new algorithms in terms of convergence speed, final misadjustment, and reduced computational complexity. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,418 |
A fast-matched filter algorithm in time domain is presented to correlate signals for optimal detection of signals in noise, to extract ranging measurements, for synchronisation, and so on. The matched filters are discussed in the context of global positioning system receivers, but the algorithms presented here can be directly used for other direct sequence spread spectrum receivers as no constraining assumptions are made in the derivations. The method proposed here outperforms the conventional time-domain method several times in arithmetic complexity. It is also competitive with transform-domain techniques based on fast Fourier transform (FFT). Unlike FFT-based methods, however, this approach is accurate and does not use rounding or scaling operations. | Correlators for pseudorandom sequences are used in direct sequence spread spectrum communication systems for signal synchronization and identification of transmitters. Implementation aspects of these correlators are critical for real-time processing of signals. This paper presents fast correlator structures in time domain which significantly reduce redundant operations using time-recursive and block processing. The approach can be extended to other applications which use correlations with both binary and non-binary sequences. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,419 |
System and method for protecting a power consuming circuit | A system for protecting a power consuming circuit, the system comprising two terminals for receiving power and two terminals for providing received power. Between one of the receiving terminals and a providing terminal, a transistor is provided which is controlled by a Zener diode and to break the connection between one of the receiving terminals and a providing terminal, if a voltage over the providing terminals or the receiving terminals exceeds the breakdown voltage of the Zener diode. | One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the past fifteen years considerable complexity progress in effective polynomial equation solving. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibit a class of simple elimination problems which require exponential size circuits to be solved in this model. This implies that the known, circuit based elimination algorithms are already optimal. | eng_Latn | 4,420 |
Constrained space-time zero-forcing pre-equalizer for the downlink channel of UMTS-TDD | The great diversity of services expected to be delivered by third generation mobile radio systems will impose severe operating conditions on the mobile terminal in terms of computational requirements and power consumption. Therefore, we propose to move the most demanding signal processing tasks, usually performed by the mobile unit, to the base station. This technique is developed for a UMTS-TDD downlink scenario through an equalizer synthesis method based on the redundancy between non-overlapping bands of a direct sequence spread spectrum (DS-SS) signal, with the design optimised for minimum power transmission under the zero-forcing criterion. | Abstract In this paper, we study the long-time behavior of solutions for a non-autonomous strongly damped wave equation. We first prove the existence of a uniform attractor for the equation with a translation compact driving force and then obtain an upper estimate for the Kolmogorov e -entropy of the uniform attractor. Finally we obtain an upper bound of the fractal dimension of the uniform attractor with quasiperiodic force. | eng_Latn | 4,421 |
Non-Guard Interval based and Genetic Algorithm Assisted Frequency Domain Equalization for DS-UWB Systems | A genetic algorithm (GA) based frequency domain equalization (FDE) scheme referred to as FDE-GA, which does not require a guard interval (GI), is proposed for direct sequence ultra wideband (DS-UWB) wireless communication systems and is shown to significantly outperform the RAKE receiver and the RAKE-GA receiver proposed in a previous work, in terms of bit error rate (BER) at a similar complexity. The FDE-GA structure achieves much higher bandwidth efficiency than conventional FDE methods, because the interblock-interference (IBI), as a result of the absence of GI, is removed effectively within each block before the GA. The effect of pilot symbols on the BER performance of the FDE-GA receiver is also investigated and presented in this work. | A common approach to define convolutions on meshes is to interpret them as a graph and apply graph convolutional networks (GCNs). Such GCNs utilize isotropic kernels and are therefore insensitive to the relative orientation of vertices and thus to the geometry of the mesh as a whole. We propose Gauge Equivariant Mesh CNNs which generalize GCNs to apply anisotropic gauge equivariant kernels. Since the resulting features carry orientation information, we introduce a geometric message passing scheme defined by parallel transporting features over mesh edges. Our experiments validate the significantly improved expressivity of the proposed model over conventional GCNs and other methods. | eng_Latn | 4,422 |
A power penalty method for linear complementarity problems | We propose a power penalty approach to a linear complementarity problem (LCP) in R^n based on approximating the LCP by a nonlinear equation. We prove that the solution to this equation converges to that of the LCP at an exponential rate when the penalty parameter tends to infinity. | Summary form only given, as follows. A study is presented of precision constraints imposed by a hybrid chip architecture with analog neurons and digital backpropagation calculations. Conversions between the analog and digital domains and weight storage restrictions impose precision limits on both analog and digital calculations. It is shown through simulations that a learning system of this nature can be implemented in spite of limited resolution in the analog circuits and using fixed-point arithmetic to implement the backpropagation algorithm. > | eng_Latn | 4,423 |
Information Aggregation in Probabilistic Prediction | Probabilistic prediction generally involves the consideration of information from many different sources, and this information must be aggregated to determine a single probability (or probability distribution). This paper is concerned with the aggregation process, and although some aspects of the paper are new, much of the paper is tutorial in nature. Models of the aggregation process are discussed, with particular emphasis on the question of the conditional dependence of information, and measures of the redundancy of information are developed. In addition, a review of previous experiments concerning the aggregation process is given, along with suggestions for experiments that should provide additional insight into the nature and ``efficiency'' of this process. In view of the importance of probabilistic prediction in inferential and decision-making situations, additional investigation and experimentation concerning the aggregation process should be of considerable value. | Summary form only given, as follows. A study is presented of precision constraints imposed by a hybrid chip architecture with analog neurons and digital backpropagation calculations. Conversions between the analog and digital domains and weight storage restrictions impose precision limits on both analog and digital calculations. It is shown through simulations that a learning system of this nature can be implemented in spite of limited resolution in the analog circuits and using fixed-point arithmetic to implement the backpropagation algorithm. > | eng_Latn | 4,424 |
Sequential Attribute Reduction Algorithm Based on Discernibility Matrix | This paper proposes sequential attribute reduction algorithm,which is based on combination of decision table information system's discernibility matrix and sequential idea,this method generates increasing discernibility function series,and branch operation is implemented using successive increase attribute core,to build up the attribute reduction tree,thereby all reductions are obtained.Plenty of logical calculus is protected in this algorithm,realize highly active attribute reduction for high dimension data.Theory analysis and the experimental results show this algorithm costs less time than other algorithms. | The great diversity of services expected to be delivered by third generation mobile radio systems will impose severe operating conditions on the mobile terminal in terms of computational requirements and power consumption. Therefore, we propose to move the most demanding signal processing tasks, usually performed by the mobile unit, to the base station. This technique is developed for a UMTS-TDD downlink scenario through an equalizer synthesis method based on the redundancy between non-overlapping bands of a direct sequence spread spectrum (DS-SS) signal, with the design optimised for minimum power transmission under the zero-forcing criterion. | eng_Latn | 4,425 |
Electromigration unidirectional osmosis method for desalination of water | The present invention is electrical monoway migrating and permeating process of desalting water in water desalting technology. The water desalting apparatus includes positive electrode, negative electrode, watertight diaphragms closing the electrodes separately, and cationic exchange film and anionic ion exchange film set between the diaphragms. The desalting process includes: for salt-containing water to enter to the fresh water channel between the cationic exchange film and the anionic ion exchange film, for cations in water to migrate toward the negative electrode via the cationic exchange film, for anions in water to migrate toward the positive electrode via the anionic exchange film, for fresh water to flow out of the fresh water outlet, and for the cation-containing water and the anion-containing water to mix fast after flowing out of the electric field for neutralization. The present invention has the advantages of no electrode reaction, no disturbance on the ion migration, etc. | This paper addresses the problem of channel and propagation delay estimation in asynchronous DS/CDMA systems. We consider the uplink connection in DS/CDMA with long spreading codes. The MIMO stochastic gradient algorithm proposed in [6] is estimating a linear combination of the channel impulse responses and the propagation delays. This estimate suffices for the equalization purposes. The propagation delays are estimated with a simple matching scheme. | eng_Latn | 4,426 |
Analysis of a microwave amplifier using the electrooptic junction modulator | Analysis of a proposed amplifier using the electro-optic junction modulator combined with an efficient photodetector shows that gain can be expected at microwave frequencies. The power gain-band product is found to increase linearly with light source power. Calculated gain-band products G_{p}^{1/2}f , for a light power of one watt at the modulator input, a modulator length of one cm and a width of 10 microns are: for a GaAs modulator-2.6 GHz and for a GaP modulator-710 MHz. A traveling wave design shows gain proportional to the number of segments. For the same conditions as above, and using one thousand segments each 10 microns long, calculated gain-frequency products are: GaAs-820 GHz and GaP-130 GHz. An elementary noise calculation for the traveling wave design indicates that the amplifier is potentially capable of low noise operation. | Often, the exact model of industrial processes turns out to be too complex for simulation and controller design. It is therefore mandatory to simplify the mathematical description of the process and/or the one of the controller. A particularly attractive simplification criterion is related to the minimization of the L 2 norm of the approximation error. This paper presents an algorithm for solving the L 2-optimal MIMO model reduction problem. It is shown that its convergence to the minima of the approximation error norm is guaranteed. The algorithm proves to be fast and efficient compared to other algorithms suggested in the literature to the same purpose. | eng_Latn | 4,427 |
An equalizer-adaptation logic for a 25-Gb/s wireline receiver in 28-nm CMOS | A 4-Channel 1.25–10.3 Gb/s Backplane Transceiver Macro With 35 dB Equalizer and Sign-Based Zero-Forcing Adaptive Control | Minimally Supervised Number Normalization | eng_Latn | 4,428 |
Improved receivers for digital high frequency waveforms using turbo equalization | Minimum mean squared error equalization using a priori information | Foreground object detection from videos containing complex background | eng_Latn | 4,429 |
Performance and design of SIC receiver for downlink NOMA with open-loop SU-MIMO | System-level performance of downlink NOMA combined with SU-MIMO for future LTE enhancements | Intelligent obstacle avoidance control strategy for wheeled mobile robot | eng_Latn | 4,430 |
Representing layered monads | A generalization of exceptions and control in ML-like languages | Equalization and clock recovery for a 2.5-10Gb/s 2-PAM/4-PAM backplane transceiver cell | eng_Latn | 4,431 |
Incentivize crowd labeling under budget constraint | Learning From Crowds | Design Techniques for a 60-Gb/s 288-mW NRZ Transceiver With Adaptive Equalization and Baud-Rate Clock and Data Recovery in 65-nm CMOS Technology | eng_Latn | 4,432 |
Uplink PHY Design with Shortened TTI for Latency Reduction | Radio access for ultra-reliable and low-latency 5G communications | Hardware-Based Trusted Computing Architectures for Isolation and Attestation | eng_Latn | 4,433 |
Hardware-efficient belief propagation | Fast approximate energy minimization via graph cuts | basic principles of information protection a . considerations surrounding the study of . | eng_Latn | 4,434 |
System-level throughput of NOMA with SIC in cellular downlink under FTP traffic model | On the achievable throughput of a multiantenna Gaussian broadcast channel | Efficient Relative Attribute Learning Using Graph Neural Networks | eng_Latn | 4,435 |
Stochastic alternating direction method of multipliers | proximal splitting methods in signal processing ∗ . | Ant Lion Optimizer for Solving Unit Commitment Problem in Smart Grid System | eng_Latn | 4,436 |
Mixed-integer quadrangulation | Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate | Unsupervised Disaggregation of Low Frequency Power Measurements | eng_Latn | 4,437 |
An improved symbol timing error detector for QPSK signals | Extended Gardner Detector for Improved Symbol-Timing Recovery of $M$-PSK Signals | A Logical Approach to Discrete Math | eng_Latn | 4,438 |
Near-Optimal Equalizer and Timing Adaptation for I/O Links Using a BER-Based Metric | Equalization and clock recovery for a 2.5-10Gb/s 2-PAM/4-PAM backplane transceiver cell | Deep Adversarial Metric Learning | eng_Latn | 4,439 |
Design and Evaluation of an Ultra-Low Power Successive Approximation ADC Master thesis performed in Electronic Devices | Dual Time-Interleaved Successive Approximation Register ADCs for an Ultra-Wideband Receiver | Agglomerative clustering using the concept of mutual nearest neighbourhood | eng_Latn | 4,440 |
Shadow Enhancement in Synthetic Aperture Sonar Using Fixed Focusing | Signal processing for AUV based interferometric synthetic aperture sonar | Learning-Based Uplink Interference Management in 4G LTE Cellular Systems | eng_Latn | 4,441 |
Preamble-based frequency-domain joint CFO and STO estimation for OQAM-based filter bank multicarrier | A technique for orthogonal frequency division multiplexing frequency offset correction | Semantic Indexing Using WordNet Senses | eng_Latn | 4,442 |
Design Methods For Digital Systems | Thank you very much for downloading design methods for digital systems. Maybe you have knowledge that, people have search hundreds times for their favorite readings like this design methods for digital systems, but end up in infectious downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they juggled with some infectious bugs inside their desktop computer. design methods for digital systems is available in our book collection an online access to it is set as public so you can download it instantly. Our digital library spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the design methods for digital systems is universally compatible with any devices to read. | One may represent polynomials not only by their coefficients but also by arithmetic circuits which evaluate them. This idea allowed in the past fifteen years considerable complexity progress in effective polynomial equation solving. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective Algebraic Geometry and exhibit a class of simple elimination problems which require exponential size circuits to be solved in this model. This implies that the known, circuit based elimination algorithms are already optimal. | eng_Latn | 4,443 |
SNS shielding analyses overview | This paper gives an overview on on-going shielding analyses for Spallation Neutron Source. Presently, the most of the shielding work is concentrated on the beam lines and instrument enclosures to prepare for commissioning, save operation and adequate radiation background in the future. There is on-going work for the accelerator facility. This includes radiation-protection analyses for radiation monitors placement, designing shielding for additional facilities to test accelerator structures, redesigning some parts of the facility, and designing test facilities to the main accelerator structure for component testing. Neutronics analyses are required as well to support spent structure management, including waste characterisation analyses, choice of proper transport/storage package and shielding enhancement for the package if required. | The great diversity of services expected to be delivered by third generation mobile radio systems will impose severe operating conditions on the mobile terminal in terms of computational requirements and power consumption. Therefore, we propose to move the most demanding signal processing tasks, usually performed by the mobile unit, to the base station. This technique is developed for a UMTS-TDD downlink scenario through an equalizer synthesis method based on the redundancy between non-overlapping bands of a direct sequence spread spectrum (DS-SS) signal, with the design optimised for minimum power transmission under the zero-forcing criterion. | eng_Latn | 4,444 |
Importance sampling evaluation of digital phase detectors based on extended Kalman-Bucy filters | This paper proposes an importance sampling methodology for the performance evaluation of a class of open-loop receivers with random carrier phase tracking in additive white Gaussian noise channels. The receivers, consisting of a bank of extended Kalman-Bucy filters and a decision algorithm based on the filters' innovations processes, perform symbol-by-symbol phase detection while kepping track of the random phase process within the symbol interval. We use a large deviations approach to start a stochastic importance sampling optimization, both for the irreducible error floor and for the general noisy operation of the receiver. Our simulations show a practical coincidence with conventional Monte Carlo results, with considerable simulation time gains. | The generation and behavior of the fractal Koch array factor from a Kaiser window generator is studied. The main advantage of using Kaiser windows is that pattern parameters become much more flexible through altering the Kaiser window. The mainlobe width, current distribution, side-lobe ratio are now adjustable. Different reduced array structures can be obtained by using different threshold levels. Higher threshold values result in a highly reduced number of elements but they may highly distort the pattern and, hence, the multiband behavior. Finally, we study the effect of quantization of the feeding values. Quantization is necessary for implementation and simplification purposes. Several configurations of current distributions with the corresponding patterns are illustrated for different quantization levels. It is shown that moderate quantization keeps the same interesting similarity properties at several bands. | eng_Latn | 4,445 |
When Gaussian Process Meets Big Data: A Review of Scalable GPs | Sparse Gaussian Processes using Pseudo-inputs | Tuning software phase-locked loop for series-connected converters | kor_Hang | 4,446 |
Joint A* CCG Parsing and Semantic Role Labelling | A* Parsing: Fast Exact Viterbi Parse Selection | Design of WLAN/LTE/UWB Antenna with Improved Pattern Uniformity Using Ground-Cooperative Radiating Structure | eng_Latn | 4,447 |
Using Neural Network Rule Extraction and Decision Tables for Credit-Risk Evaluation | Extracting Tree-Structured Representations of Trained Networks | A low-power high-speed charge-steering ADC-based equalizer for serial links | eng_Latn | 4,448 |
What is the least number of 8 Ω resistors you can arrange to have a total resistance of 5 Ω and how do you do it? Is there a mathematical way to know the answer? (or you can do it only by trial and error). Could you prove that it is possible or impossible mathematically? | Does anyone remember this article about the Euclidean Algorithm? In the 70's I had a stack of old Amateur Radio magazines (50s-60s), and for a long time I saved an article about using the to combine a number of resistors to achieve a specific value. Does anyone recall and have a copy of this article, or know how the Euclidean algorithm is applied to solve this problem? | How much does it cost to have a custom ASIC made? I have browsed several ASIC manufacturer's webs, but I haven't found an actual number. I assume there would be a fixed cost associated with creating masks and such and then there will be a cost per unit. Note: that I don't actually want to have an ASIC made, I'm just curious. | eng_Latn | 4,449 |
Softwarization and virtualization in 5G mobile networks: Benefits, trends and challenges | software - defined control of the virtualized mobile packet core . | Look-up table (LUT) method for inverse halftoning | eng_Latn | 4,450 |
DSM resolution reduction in QGIS | Reducing resolution of huge categorical raster in QGIS? | Every principal ideal domain satisfies ACCP. | eng_Latn | 4,451 |
Active User-Side Evil Twin Access Point Detection Using Statistical Techniques | Passive online rogue access point detection using sequential hypothesis testing with TCP ACK-pairs | Compressive depth map acquisition using a single photon-counting detector: Parametric signal processing meets sparsity | kor_Hang | 4,452 |
Speedup for European epassport authentication | sigma : the ' sign - and - mac ' approach to authenticated diffie - hellman and its use in the ike - protocols . | Broadside-coupled multi-octave impedance transformer | eng_Latn | 4,453 |
You Can Jam But You Cannot Hide: Defending Against Jamming Attacks for Geo-Location Database Driven Spectrum Sharing | Location Privacy Preservation in Collaborative Spectrum Sensing | Optimal ZVS Modulation of Single-Phase Single-Stage Bidirectional DAB AC–DC Converters | eng_Latn | 4,454 |
Channelized and Signal Detection Technique for Intercept Receiver | Double Precision Hybrid-Mode Floating-Point FPGA CORDIC Co-processor | Are Mobile Payment and Banking the Killer Apps for Mobile Commerce? | eng_Latn | 4,455 |
UNIQUE constraint on a specific pairing | Custom unique constraint, only enforced if one column has a specific value | How does an accelerating charge radiate electromagnetic waves? | eng_Latn | 4,456 |
On obfuscating compilation for encrypted computing | Reduced instruction set computers | Eosinophilia in pediatric uncomplicated appendicitis is a time stable pattern | eng_Latn | 4,457 |
But like a brick wall, some of these programs have holes. | There are some holes in a few of these programs. | There are no holes in any of the programs. | eng_Latn | 4,458 |
Slicing Guarantees Information Flow Noninterference | Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs | Divided attention and memory: Evidence of substantial interference effects at retrieval and encoding. | deu_Latn | 4,459 |
A survivability-based testbed for comparing threat evaluation algorithms | A testbed based on survivability for comparing threat evaluation algorithms | A testbed based on survivability for comparing threat evaluation algorithms | eng_Latn | 4,460 |
Summary ::: Programs such as VMD and PyMOL are excellent tools for analyzing macromolecular structures, but they do not implement many of the advanced rendering techniques common in the film and video-game industries. In contrast, the open-source program Blender is a general-purpose tool for industry-standard rendering/visualization, but its user interface is poorly suited for rigorous scientific analysis. We present BlendMol, a Blender plugin that imports VMD or PyMOL scenes into Blender. BlendMol-generated images are well-suited for use in manuscripts, outreach programs, websites, and classes. ::: ::: ::: Availability and Implementation ::: BlendMol is available free of charge from http://durrantlab.com/blendmol/. It is written in Python. ::: ::: ::: Supplementary information ::: Supplementary data are available at Bioinformatics online. | VMD is a molecular graphics program designed for the display and analysis of molecular assemblies, in particular biopolymers such as proteins and nucleic acids. VMD can simultaneously display any number of structures using a wide variety of rendering styles and coloring methods. Molecules are displayed as one or more “representations,” in which each representation embodies a particular rendering method and coloring scheme for a selected subset of atoms. The atoms displayed in each representation are chosen using an extensive atom selection syntax, which includes Boolean operators and regular expressions. VMD provides a complete graphical user interface for program control, as well as a text interface using the Tcl embeddable parser to allow for complex scripts with variable substitution, control loops, and function calls. Full session logging is supported, which produces a VMD command script for later playback. High-resolution raster images of displayed molecules may be produced by generating input scripts for use by a number of photorealistic image-rendering applications. VMD has also been expressly designed with the ability to animate molecular dynamics (MD) simulation trajectories, imported either from files or from a direct connection to a running MD simulation. VMD is the visualization component of MDScope, a set of tools for interactive problem solving in structural biology, which also includes the parallel MD program NAMD, and the MDCOMM software used to connect the visualization and simulation programs. VMD is written in C++, using an object-oriented design; the program, including source code and extensive documentation, is freely available via anonymous ftp and through the World Wide Web. | To determine the security impact software vulnerabilities have on a particular network, one must consider interactions among multiple network elements. For a vulnerability analysis tool to be useful in practice, two features are crucial. First, the model used in the analysis must be able to automatically integrate formal vulnerability specifications from the bug-reporting community. Second, the analysis must be able to scale to networks with thousands of machines. ::: ::: We show how to achieve these two goals by presenting MulVAL, an end-to-end framework and reasoning system that conducts multihost, multistage vulnerability analysis on a network. MulVAL adopts Datalog as the modeling language for the elements in the analysis (bug specification, configuration description, reasoning rules, operating-system permission and privilege model, etc.). We easily leverage existing vulnerability-database and scanning tools by expressing their output in Datalog and feeding it to our MulVAL reasoning engine. Once the information is collected, the analysis can be performed in seconds for networks with thousands of machines. ::: ::: We implemented our framework on the Red Hat Linux platform. Our framework can reason about 84% of the Red Hat bugs reported in OVAL, a formal vulnerability definition language. We tested our tool on a real network with hundreds of users. The tool detected a policy violation caused by software vulnerabilities and the system administrators took remediation measures. | eng_Latn | 4,461 |
This paper considers an algorithm for scalable automatic static analysis to detect defects in programs written in C. We propose a criterion for emitting warnings based on reach ability of function statements. Main advantages of the proposed approach are scalability, high true positive rate and ability to perform library analysis. | The problem of constructing full call graph of a program can be complicated by absence of indirect calls in the graph. It may happen when a developer decides to invoke a function by pointer. The appearance of functions like dlsym makes it possible. Such functions allows to obtain an address of a function from a library at runtime. The paper suggests two step static analysis for revealing symbols loaded at runtime. The first step collects auxiliary information about a program between translation units, the second applies collected information to analyze individual translation units. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,462 |
Parichayana: An Eclipse Plugin for Detecting Exception Handling Anti-Patterns and Code Smells in Java Programs | A Comparative Study on Code Smell Detection Tools | Artificial incubation does not affect the post-hatch development, health, or survival of the Lance-tailed Manakin (Chiroxiphia lanceolata), a tropical passerine | kor_Hang | 4,463 |
Genetic Vector Quantizer Design on Reconfigurable Hardware | A Superior Vector Quantization Based on Steady-State Memetic Algorithm | Zoonotic Genotype of Giardia intestinalis Detected in a Ferret | eng_Latn | 4,464 |
Software security has become more important than ever. Unfortunately, still now, the security of a software system is almost always retrofitted to an afterthought. When security problems arise, understanding and correcting them can be very challenging. On the one hand, the program analysis research community has created numerous static and dynamic analysis tools for performance optimization and bug detection in object-oriented programs. On the other hand, the security and privacy research community has been looking for solutions to automatically detect security problems, privacy violations, and access-control requirements of object-oriented programs. The purpose of the First Program Analysis for Security and Safety Workshop Discussion (PASSWORD 2006), co-located with the Twentieth European Conference on ObjectOriented Programming (ECOOP 2006), was to bring together members of the academic and industrial communities interested in applying analysis, testing, and verification to security and privacy problems, and to encourage program analysis researchers to see the applicability of their work to security and privacy—an area of research that still needs a lot of exploration. This paper summarizes the discussions and contributions of the PASSWORD workshop. | Open distributed systems are becoming increasingly popular. Such systems include components that may be obtained from a number of different sources. For example, Java allows run-time loading of software components residing on remote machines. One unfortunate side-effect of this openness is the possibility that "hostile" software components may compromise the security of both the program and the system on which it runs. Java offers a built-in security mechanism, using which programmers can give permissions to distributed components and check these permissions at run-time. This security model is flexible, but using it is not straightforward, which may lead to insufficiently tight permission checking and therefore breaches of security.In this paper, we propose a data flow algorithm for automated analysis of the flow of permissions in Java programs. Our algorithm produces, for a given instruction in the program, a set of permissions that are checked on all possible executions up to this instruction. This information can be used in program understanding tools or directly for checking properties that assert what permissions must always be checked before access to certain functionality is allowed. The worst-case complexity of our algorithm is low-order polynomial in the number of program statements and permission types, while comparable previous approaches have exponential costs. | We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero. | eng_Latn | 4,465 |
The local time warp (LTW) model was one of the novel approaches to distributed simulation presented in early 90s. While several similar schemes had emerged afterwards, no implementation and performance analysis of LTW were offered. This paper provides an implementation and performance analysis of the Local Time Warp model on a Beowulf Cluster using Message Passing Interface (MPI). Cluster computing matches well with the Local Time Warp model due to its partitioning of the simulation entities and assigning them to clusters of processors. This paper presents a distributed simulation engine called BG-LTW which is a clustered-based implementation of the model. Further, the implementation features and its performance are provided. The obtained results suggest that for large-scale simulations local time warp outperforms its global counterpart. | Modern C++ Designis an important book. Fundamentally, it demonstrates 'generic patterns' or 'pattern templates' as a powerful new way of creating extensible designs in C++i??a new way to combine templates and patterns that you may never have dreamt was possible, but is. If your work involves C++ design and coding, you should read this book. Highly recommended. i??Herb SutterWhat's left to say about C++ that hasn't already been said? Plenty, it turns out. i??From the Foreword by John VlissidesIn Modern C++ Design, Andrei Alexandrescu opens new vistas for C++ programmers. Displaying extraordinary creativity and programming virtuosity, Alexandrescu offers a cutting-edge approach to design that unites design patterns, generic programming, and C++, enabling programmers to achieve expressive, flexible, and highly reusable code.This book introduces the concept of generic componentsi??reusable design templates that produce boilerplate code for compiler consumptioni??all within C++. Generic components enable an easier and more seamless transition from design to application code, generate code that better expresses the original design intention, and support the reuse of design structures with minimal recoding.The author describes the specific C++ techniques and features that are used in building generic components and goes on to implement industrial strength generic components for real-world applications. Recurring issues that C++ developers face in their day-to-day activity are discussed in depth and implemented in a generic way. These include: Policy-based design for flexibility Partial template specialization Typelistsi??powerful type manipulation structures Patterns such as Visitor, Singleton, Command, and Factories Multi-method enginesFor each generic component, the book presents the fundamental problems and design options, and finally implements a generic solution.In addition, an accompanying Web site, http://www.awl.com/cseng/titles/0-201-70431-5, makes the code implementations available for the generic components in the book and provides a free, downloadable C++ library, called Loki, created by the author. Loki provides out-of-the-box functionality for virtually any C++ project.Get a value-added service! Try out all the examples from this book at www.codesaw.com. CodeSaw is a free online learning tool that allows you to experiment with live code from your book right in your browser. 0201704315B11102003 | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,466 |
Malware is a serious threat that has been used to target mobile devices since its inception. Two types of mobile malware attacks are standalone: fraudulent mobile apps and injected malicious apps. Defending against the cyber threats of mobile malware requires a strong understanding of the permissions declared in applications and application programmeinterface (API) calls. In this paper, we propose an effective classification model that combines permission requests and API calls. As Android apps use a large number of APIs, we propose three different grouping strategies for choosing the most valuable API calls to maximize the likelihood of identifying Android malware apps: the ambiguous group, risky group, and disruptive group. The results demonstrate that compared with benign apps, malicious applications invoke a different set of API calls and that mobile malware often requests dangerous permissions to access sensitive data more often than benign apps. Empirical results obtained with a real malware dataset containing 27,891 Android apps suggest that our proposed method is effective at detecting mobile malware apps and achieves an F-measure of 94.3%. Our model can significantly assist in the process of malware forensic investigation and mobile application analysis. | One of the major and serious threats that the Internet faces today is the vast amounts of data and files which need to be evaluated for potential malicious intent. Malicious software, often referred to as a malware that are designed by attackers are polymorphic and metamorphic in nature which have the capability to change their code as they spread. Moreover, the diversity and volume of their variants severely undermine the effectiveness of traditional defenses which typically use signature based techniques and are unable to detect the previously unknown malicious executables. The variants of malware families share typical behavioral patterns reflecting their origin and purpose. The behavioral patterns obtained either statically or dynamically can be exploited to detect and classify unknown malware into their known families using machine learning techniques. This survey paper provides an overview of techniques and tools for detecting and analyzing the malware. | Blunt trauma abdomen rarely leads to gastrointestinal injury in children and isolated gastric rupture is even rarer presentation. We are reporting a case of isolated gastric rupture after fall from height in a three year old male child. | eng_Latn | 4,467 |
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pages. However, this interaction is commonly done through a low-level API by dynamically constructing query strings within a general-purpose programming language, such as Java. This low-level interaction is ad hoc because it does not take into account the structure of the output language. Accordingly, user inputs are treated as isolated lexical entities which, if not properly sanitized, can cause the web application to generate unintended output. This is called a command injection attack, which poses a serious threat to web application security. This paper presents the first formal definition of command injection attacks in the context of web applications, and gives a sound and complete algorithm for preventing them based on context-free grammars and compiler parsing techniques. Our key observation is that, for an attack to succeed, the input that gets propagated into the database query or the output document must change the intended syntactic structure of the query or document. Our definition and algorithm are general and apply to many forms of command injection attacks. We validate our approach with SqlCheckS , an implementation for the setting of SQL command injection attacks. We evaluated SqlCheckS on real-world web applications with systematically compiled real-world attack data as input. SqlCheckS produced no false positives or false negatives, incurred low runtime overhead, and applied straightforwardly to web applications written in different languages. | AutoRand automatically transforms Java applications to use SQL keyword randomization to defend against SQL injection vulnerabilities. AutoRand is completely automatic. Unlike previous approaches it requires no manual modifications to existing code and does not require source it works directly on Java bytecode. It can thus easily be applied to the large numbers of existing potentially insecure applications without developer assistance. Our key technical innovation is augmented strings. Augmented strings allow extra information such as random keys to be embedded within a string. AutoRand transforms string operations so that the extra information is transparent to the program, but is always propagated with each string operation. AutoRand checks each keyword at SQL statements for the random key. Experimental results on large, production Java applications and malicious inputs provided by an independent evaluation team hired by an agency of the United States government showed that AutoRand successfully blocked all SQL injection attacks and preserved transparent execution for benign inputs, all with low overhead. | ABSTRACTUNC-45A is an ubiquitously expressed protein highly conserved throughout evolution. Most of what we currently know about UNC-45A pertains to its role as a regulator of the actomyosin system... | eng_Latn | 4,468 |
With the recent dynamic growth of the mobile market, the problem of personal information leakage through mobile applications’ weaknesses has become a newly rising problem. Guaranteeing the reliability of input and output data is particularly difficult nowadays because software exchange data across the internet. There is also a risk of being the target of an arbitrary intruder’s malicious attack. Such weaknesses have been the root to software security violations that can cause some serious financial damages. Such weaknesses are the direct causes of software security incidents, which generate critical economic losses. Therefore it is important eliminate weaknesses in the software development stage and these areas such as the secure software development process model are being studied, recently. In this study, a compiler which can examine applications’ weaknesses at the software development stage has been designed and implemented based on existing weakness research. The proposed compiler analyzes the weaknesses within a program at the point of compilation, different to the existing development environments which separate compilers and weakness analysis tools. As a result, the new compiler enables mobile applications that are developed in rapid development cycles to be created safely from the very first stages of development. | Taxonomies can help software developers and security practitioners understand the common coding mistakes that affect security. The goal is to help developers avoid making these mistakes and more readily identify security problems whenever possible. Because developers today are by and large unaware of the security problems they can (unknowingly) introduce into code, a taxonomy of coding errors should provide a real tangible benefit to the software security community. Although the taxonomy proposed here is incomplete and imperfect, it provides an important first step. It focuses on collecting common errors and explaining them in a way that makes sense to programmers. This new taxonomy is made up of two distinct kinds of sets, which we're stealing from biology: a phylum (a type of coding error, such as illegal pointer value) and a kingdom (a collection of phyla that shares a common theme, such as input validation and representation). Both kingdoms and phyla naturally emerge from a soup of coding rules relevant to enterprise software, and it's for this reason that this taxonomy is likely to be incomplete and might lack certain coding errors. In some cases, it's easier and more effective to talk about a category of errors than to talk about any particular attack. Although categories are certainly related to attacks, they aren't the same as attack patterns. | We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero. | eng_Latn | 4,469 |
In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the property-related behavior differs along the arms of the branch, we can design an algorithm that is accurate enough to verify the program with respect to the given property, without paying the potentially exponential cost of full path-sensitive analysis.We have implemented this "property simulation" algorithm as part of a partial verification tool called ESP. We present the results of applying ESP to the problem of verifying the file I/O behavior of a version of the GNU C compiler (gcc, 140,000 LOC). We are able to prove that all of the 646 calls to .fprintf in the source code of gcc are guaranteed to print to valid, open files. Our results show that property simulation scales to large programs and is accurate enough to verify meaningful properties. | To efficiently prune infeasible program paths, path-sensitive static analysis based bug detectors may utilize light-weight imprecise methods to check the satisfiability of path constraints, which leads to redundant reports and falsepositives. Although the false-positives can be eliminated by the post-inspection process, which re-checks the feasibility of the paths of each bug report with precise methods, the redundant reports are inspected unnecessarily. In this paper, we discuss how to improve the efficiency of the post-inspection process. We categorize the uninspected reports into disjoint sets and sort the reports in each category, which helps to decrease the number of inspection attempts. Besides, we parallelize the inspection for further speedup. The experimental results indicate that about 65.20% of needless inspections are eliminated in total. With the sorted category sets, about 52.4% of attempts are additionally reduced. And compared with the sequential execution, the parallel approach further gains an average speedup of 5.74 under 8 threads. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,470 |
A lack of security metrics signifies that it is not possible to measure the success of security policies, mechanisms and implementations, and security cannot, in turn, be improved if it cannot be measured. The importance of the use of metrics to obtain security quality is thus widely accepted. However, the definition of security metrics concerns a discipline which is still in its first stages of development, meaning that few documented resources or works centring on this subject exist to date. In this paper we shall therefore study the latest existing models with which to define security metrics and their components as aspects that have a bearing on the quality of software products with the intention that this will serve as a basis for continued advancement in research into this area of knowledge. | Software security metrics are measurements to assess security related imperfections (or perfections) introduced during software development. A number of security metrics have been proposed. However, all the perspectives of a software system have not been provided specific attention. While most security metrics evaluate software from a system-level perspective, it can also be useful to analyze defects at a lower level, i.e., at the source code level. To address this issue, we propose some code-level security metrics which can be used to suggest the level of security of a code segment. We provide guidelines about where and how these metrics can be used to improve source code structures. We have also conducted two case studies to demonstrate the applicability of the proposed metrics. | Software security metrics are measurements to assess security related imperfections (or perfections) introduced during software development. A number of security metrics have been proposed. However, all the perspectives of a software system have not been provided specific attention. While most security metrics evaluate software from a system-level perspective, it can also be useful to analyze defects at a lower level, i.e., at the source code level. To address this issue, we propose some code-level security metrics which can be used to suggest the level of security of a code segment. We provide guidelines about where and how these metrics can be used to improve source code structures. We have also conducted two case studies to demonstrate the applicability of the proposed metrics. | eng_Latn | 4,471 |
Applications can be logically separated to parts that face different types of threats, or suffer dissimilar exposure to a particular threat because of external events or innate properties of the software. Based on this observation, we propose the virtual partitioning of applications that will allow the selective and targeted application of those protection mechanisms that are most needed on each partition, or manage an application's attack surface by protecting the most exposed partition. We demonstrate the value of our scheme by introducing a methodology to automatically partition software, based on the intrinsic property of user authentication. Our approach is able to automatically determine the point where users authenticate, without access to source code. At runtime, we employ a monitor that utilizes the identified authentication points, as well as events like accessing specific files, to partition execution and adapt defenses by switching between protection mechanisms of varied intensity, such as dynamic taint analysis and instruction-set randomization. We evaluate our approach using seven well-known network applications, including the MySQL database server. Our results indicate that our methodology can accurately discover authentication points. Furthermore, we show that using virtual partitioning to apply costly protection mechanisms can reduce performance overhead by up to 5x, depending on the nature of the application. | Backdoors in software systems probably exist since the very first access control mechanisms were implemented and they are a well-known security problem. Despite a wave of public discoveries of such backdoors over the last few years, this threat has only rarely been tackled so far. In this paper, we present an approach to reduce the attack surface for this kind of attacks and we strive for an automated identification and elimination of backdoors in binary applications. We limit our focus on the examination of server applications within a client-server model. At the core, we apply variations of the delta debugging technique and introduce several novel heuristics for the identification of those regions in binary application that backdoors are typically installed in (i.e., authentication and command processing functions). We demonstrate the practical feasibility of our approach on several real-world backdoors found in modified versions of the popular software tools ProFTPD and OpenSSH. Furthermore, we evaluate our implementation not only on common instruction set architectures such as x86-64, but also on commercial off-the-shelf embedded devices powered by a MIPS32 processor. | We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero. | eng_Latn | 4,472 |
Robust fingerprinting of executable code contained in a memory image is a prerequisite for a large number of security and forensic applications, especially in a cloud environment. Prior state of the art has focused specifically on identifying kernel versions by means of complex differential analysis of several aspects of the kernel code implementation. In this work, we present a novel technique that can identify any relocatable code, including the kernel, based on inherent patterns present in relocation tables. We show that such patterns are very distinct and can be used to accurately and efficiently identify known executables in a memory snapshot, including remnants of prior executions. We develop a research prototype, codeid, and evaluate its efficacy on more than 50,000 sample executables containing kernels, kernel modules, applications, dynamic link libraries, and malware. The empirical results show that our method achieves almost 100% accuracy with zero false negatives. | Cloud infrastructure commonly relies on virtualization. Customers provide their own VMs, and the cloud provider runs them often without knowledge of the guest OSes or their configurations. However, cloud customers also want effective and efficient security for their VMs. Cloud providers offering security-as-a-service based on VM introspection promise the best of both worlds: efficient centralization and effective protection. Since customers can move images from one cloud to another, an effective solution requires learning what guest OS runs in each VM and securing the guest OS without relying on the guest OS functionality or an initially secure guest VM state. We present a solution that is highly scalable in that it (i) centralizes guest protection into a security VM, (ii) supports Linux and Windows operating systems and can be easily extended to support new operating systems, (iii) does not assume any a-priori semantic knowledge of the guest, (iv) does not require any a-priori trust assumptions into any state of the guest VM. While other introspection monitoring solutions exist, to our knowledge none of them monitor guests on the semantic level required to effectively support both white- and black-listing of kernel functions, or allows to start monitoring VMs at any state during run-time, resumed from saved state, and cold-boot without the assumptions of a secure start state for monitoring. | The oxidative polymorphism of debrisoquine (DBQ) has been determined in 89 patients with colo-rectal cancer and in 556 normal control subjects. Four patients and 34 controls, with a metabolic ratio >12.6, were classified as poor metabolisers of DBQ (n.s.). | eng_Latn | 4,473 |
Obfuscation techniques degrade the n-gram features of binary form of the malware. In this study, methodology to classify malware instances by using n-gram features of its disassembled code is presented. The presented statistical method uses the n-gram features of the malware to classify its instance with respect to their families. n-gram is a fixed size sliding window of byte array, where n is the size of the window. The contribution of the presented method is capability of using only one vector to represent malware subfamily which is called subfamily centroid. Using only one vector for classification simply reduces the dimension of the n- gram space. Experimental results are performed over a fairly large data set, which is being collected through Computer Emergency Response Team (CERT) activities in the National Research Institute of Electronics and Cryptology, to illustrate the effectiveness of the proposed malware classification methodology. | New computer viruses are continually being generated and they cause damage all over the world. In general, current anti-virus software detects viruses by matching a pattern based on the signature; thus, unknown viruses without any signature cannot be detected. Although there are some static analysis technologies that do not depend on signatures, virus writers often use code obfuscation techniques, which make it difficult to execute a code analysis. As is generally known, unknown viruses and known viruses share a common feature. In this paper we propose a new static analysis technology that can circumvent code obfuscation to extract the common feature and detect unknown viruses based on similarity. The results of evaluation experiments demonstrated that this technique is able to detect unknown viruses without false positives. | We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero. | eng_Latn | 4,474 |
In recent years, hardware Trojans have become a research hotspot in security field, variety of detection methods have been proposed to resist this threat as a result. However, most of them are based on a standard template to detect a chip with specific functions. This may provide some help, but because of the weak adaptability, if the target chip is used for other functions, the attacker will have to rebuild a corresponding template. This paper proposed a new method of hardware Trojan detection based on power characteristics. Through a deep research of power consumption hardware Trojan detection theory, we developed an encryption algorithm experiment platform surrounding a FPGA board. We successfully reduced the dimensions of the data by principal component analysis (PCA) technology, and then based on the Mahalanobis distance weather the hardware Trojan is contained in the chip could be detected. In this paper, we take the RS232 serial port hardware Trojan implanted in DES and AES algorithm as examples to apply the verification experiments. Results show that our method could adapt to a variety of different function circuits of one same chip, while the successful detection rate is high, and the computational cost is low. | Editor's note:Today's integrated circuits are vulnerable to hardware Trojans, which are malicious alterations to the circuit, either during design or fabrication. This article presents a classification of hardware Trojans and a survey of published techniques for Trojan detection. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,475 |
With the development of information technology, e-mail has become a popular communication medium. It has great significant to determine the relationship between the two sides of the communication. Firstly, this paper analysed and processed the content and attachment of e-mail using the skill of steganalysis and malware analysis. And it also conducts the following feature extracting and behaviour model establishing which based on Naive Bayesian theory. Then a behaviour analysis method was employed to calculate and evaluate the communication security. Finally, some experiments about the accuracy of the behavioural relationship of communication identifying has been carried out. The result shows that this method has a great effects and correctness as eighty-four percent. | Data mining has a wide range of applications in the real world. However, it is possible to disclose the private information of users in the process of data mining. Therefore, it is of great significance to protect the users' privacy while mining the knowledge behind the data. In this paper, we propose a Naive Bayes classification method based on differential privacy. For nominal attributes, we add Laplace noise to the count. For numerical attributes, we add Laplace noise to the mean, standard deviation, and scale parameter, and then use the noisy parameters to calculate the prior probability and conditional probability. For numerical attributes, we assume that they follow Gaussian, Laplace, or lognormal distribution, and apply our algorithms to compare utilities. | Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights. | eng_Latn | 4,476 |
Research of Using Wrapper Functions to Detect and Prevent Stack-smashing Attack on Linux | This paper presents a method that statically detects C source code and substitutes bounds-checked wrapper functions for the functions that have buffer overflow vulnerabilities. In this way, it can prevent stack-smashing attack effectively. | Abstract A numerical scheme, based upon the Kobayashi-Tranter method with certain modifications, is given for axisymmetric punch and crack problems in elasticity. The problems are reduced to solving a system of linear algebraic equations instead of a Fredholm integral equation of the second kind. A standard program thus allows the treatment of a range of different cases. The indentation of a rigid punch on an elastic layer overlying an elastic foundation is formulated in this fashion and numerical results for various cases are presented. | eng_Latn | 4,477 |
[An obscure anomaly: regional odontodysplasia]. | In a 3-year-old child, acute dental abscesses in combination with clinical and radiographic impressions of a number of deciduous teeth indicated regional odontodysplasia as probable diagnosis. Histological examination of the removed deciduous teeth confirmed the diagnosis. Early determination of this regional developmental anomaly in the odontogenesis is of great importance for optimal guidance of the dental care of a patient with regional odontodysplasia. | As additive manufacturing (AM) becomes more pervasive, its supply chains shift towards distributed business models that heavily rely on cloud resources. Despite its countless benefits, this paradigm raises significant concerns about the trustworthiness of the globalized process, as there exist several classes of cybersecurity attacks that can undermine its security guarantees. In this work, we focus on the protection of the intellectual property (IP) of 3D designs, and introduce ObfusCADe, which is a novel protection method against counterfeiting, by embedding special features in CAD models. The introduced features interfere with the integrity of the design, effectively restricting high quality manufacturing to only a unique set of processing settings and conditions; under all other conditions, the printed artifact suffers from poor quality, premature failures and/or malfunctions. | nno_Latn | 4,478 |
Research on Software Anti-interference Methods of Singlechip MCS-51 Runaway | The authors discuss some software anti-interference methods of PC incontrollable.The methods help singlechip system to overcome every possible interferences and its own stoppage so that the singlechip system can be ensured to work efficiently. | Example embodiments relate to perform instrumentation enabling and disabling the runtime of the present invention. Fetch instructions executed in privileged state is small by a processor by the processor. The processor determines the runtime instrumentation allows instruction execution control and instrumentation runtime associated by small privileged state is valid. Based on the instruction of the detection instrument is turned off (RIOFF) instruction execution time, the runtime instrumentation disabled. The update processor includes a bit disabling program status word (PSW) to indicate that the data should not be run when the instrument is captured by the processor. Based on the instruction of the detection instrument is turned on (RION) instruction execution time, the runtime instrumentation enabled. Includes updating the enable bit in the PSW instrumentation data should be captured by the processor instructs the runtime. | eng_Latn | 4,479 |
Automatic generation of the C# code for security protocols verified with Casper/FDR | Formal methods technique offer a means of verifying the correctness of the design process used to create the security protocol. Notwithstanding the successful verification of the design of security protocols, the implementation code for them may contain security flaws, due to the mistakes made by the programmers or bugs in the programming language itself. We propose an ACG-C# tool, which can be used to generate automatically C# implementation code for the security protocol verified with Casper and FDR. The ACG-C# approach has several different features, namely automatic code generation, secure code, and high confidence. We conduct a case study on the Yahalom security protocol, using ACG-C# to generate the C# implementation code. | This paper particularly introduces the layout,design and realization.It is based on the structure of B/S,including browser,web server and database server.The key data are encrypted in order to ensure the security of the system.The user,who has logged on the system,can manipulate the database.All the operation will be noted.It also has powerful function,sustaining intellective and faintness demand.The function of data back-up and resume is self-contained. | eng_Latn | 4,480 |
ObfusCADe: Obfuscating Additive Manufacturing CAD Models Against Counterfeiting: Invited | As additive manufacturing (AM) becomes more pervasive, its supply chains shift towards distributed business models that heavily rely on cloud resources. Despite its countless benefits, this paradigm raises significant concerns about the trustworthiness of the globalized process, as there exist several classes of cybersecurity attacks that can undermine its security guarantees. In this work, we focus on the protection of the intellectual property (IP) of 3D designs, and introduce ObfusCADe, which is a novel protection method against counterfeiting, by embedding special features in CAD models. The introduced features interfere with the integrity of the design, effectively restricting high quality manufacturing to only a unique set of processing settings and conditions; under all other conditions, the printed artifact suffers from poor quality, premature failures and/or malfunctions. | Three design schemes of the runner system of an injection mould for an automobile panel were simulated and optimized based on CAE technology.The optimized gating system helps to increase the quality of product and shorten the development cycle. | eng_Latn | 4,481 |
Lightweight analysis of access control models with description logic | This paper presents a lightweight analysis approach to access control policies based on description logic (\({\mathcal{DL}}\)). After recalling the model-driven security (MDS) approach for the specification and lightweight analysis of role-based security policies using the SecureUML modeling language, we describe how such policies may be specified in \({\mathcal{DL}}\) and analyzed using \({\mathcal{DL}}\) tools. We conclude with a comparison between the MDS and \({\mathcal{DL}}\) -based approaches to the analysis of role-based access control security policies. | This paper analyses the causationes that influence the precision of the weighing system.Introduces the characteristics of the chip ADS1230 and designing of hardware circuit in weighing system.This design uses the most extensive and mature technology AT89C51 chip microcontroller and the resistance strain weighing sensor chip.The system has many characteristics-rapid weighing,exact and steady data,ease using,high anti-jamming ability etc. | eng_Latn | 4,482 |
Preventing developers from adding features is not as easy as it sounds. | Developers can add features. | Developers aren't capable of adding features. | eng_Latn | 4,483 |
Four Sentenced in Software Fraud Scheme | A plot to defraud Microsoft into getting academic rates brings fines and prison time. | Two months after hacker HD Moore publicly disclosed 22 bugs, only two have been fixed. | eng_Latn | 4,484 |
Microsoft to Share Office Software Code | Microsoft Corp. said on Sunday that it would share the underlying software code for its Office program as part of its efforts to make governments more confident in the security and compatibility | In a recent SEC filing, McAfee warns investors that it faces risks from the "ambiguous" nature of open source licensing. | eng_Latn | 4,485 |
Microsoft Developer: 'Fuzzing' key to Office Security | A wave of attacks targeting Microsoft Corp.'s Office 2003 last year taught the company some tough security lessons it's now aggressively applying, a Microsoft software engineer said Friday. | By Cathy Jett, The Free Lance-Star, Fredericksburg, Va. Sep. 3--Todd Fleming's first inkling that something was wrong with his new Dell laptop was when he heard an odd hissing sound. | eng_Latn | 4,486 |
Cobra language slithering to open source | InfoWorld - Cobra, a .Net-based programming language, is being readied for open source release as an all-in-one solution to address multiple needs in software development. | Arrays and other classes go into the basic Parrot PMC hierarchy, and Dan finally embraces Unicode while perl6-language ... doesn't. | eng_Latn | 4,487 |
lsmod outputs: Not tainted | What is a tainted kernel in Linux? | What is a tainted kernel in Linux? | eng_Latn | 4,488 |
Source code standoff in breathalyzer case | Minnesota officials haven't met a court-imposed deadline for turning over the source code to a breath-test device, which could lead to dropped DUI charges. | Blighty's cultural computing heritage safe at last Bletchley Park, where code breaking machines were developed during the Second World War, is to be home to a national museum of computing backed by the British Computer Society and the Codes and Ciphers Heritage Trust.⦠| eng_Latn | 4,489 |
Palindrome Detection Using On-line Position | The purpose of this study is to detect a reverse substring in any position i of the string y, uRru is a factor of y, uR is a reverse substring of u and r is a substring between uR and u. We develop an efficient algorithm to detect all reverse repetitions in a string and describe the algorithm for computing the Longest Previous reverse Factor (LPrF) table by using the on-line construction of position heap data structure. This algorithm runs in linear time on a fixed size alphabet. For the applications in bioinformatics field, LPrF table can use to detect palindrome and gapped palindrome. | In this paper, we have presented an effective yield improvement methodology that can help both manufacturing ::: foundries, fabless and fab-lite companies to identify systematic failures. It uses the physical addresses of failing bits ::: from wafer sort results to overlay to inline wafer defect inspection locations. The inline defect patterns or the design ::: patterns where overlay results showed matches were extracted and grouped by feature similarity or cell names. The potentially problematic design patterns can be obtained and used for design debug and process improvement. | eng_Latn | 4,490 |
In XCOM: Enemy Unknown, which types of scenery are destructible? | Is there a way to recognize destructible environment in XCOM:Enemy Unknown? | Is there a way to recognize destructible environment in XCOM:Enemy Unknown? | eng_Latn | 4,491 |
Context-Sensitive Fencing: Securing Speculative Execution via Microcode Customization | The M5 Simulator: Modeling Networked Systems | CHOPCHOP v2: a web tool for the next generation of CRISPR genome engineering | eng_Latn | 4,492 |
A survey of image retargeting techniques | A Shape-Preserving Approach to Image Resizing | Securing FPGA-based obsolete component replacement for legacy systems | eng_Latn | 4,493 |
Securing computer hardware using 3D integrated circuit (IC) technology and split manufacturing for obfuscation | Demystifying 3D ICs: the pros and cons of going vertical | Making Sense of Asynchrony in Interactive Data Visualizations | eng_Latn | 4,494 |
Good Signal Detection Practices: Evidence from IMI PROTECT | Improved Statistical Signal Detection in Pharmacovigilance by Combining Multiple Strength-of-Evidence Aspects in vigiRank | Essentials of Programming Languages | kor_Hang | 4,495 |
A Systematic Mapping Study on Software Reuse | Refactoring - improving coupling and cohesion of existing code | Cross-Sensor Fingerprint Matching Method Based on Orientation, Gradient, and Gabor-HoG Descriptors With Score Level Fusion | kor_Hang | 4,496 |
Unsafe Code and Interoperability | Few real-world applications are composed strictly of managed code. Instead, they frequently make use of in-house or 3rd party libraries implemented in native code. The .NET Framework offers several mechanisms to interoperate with native code that is implemented in a number of widespread technologies: ::: ::: ::: P/Invoke: enables interoperability with DLLs exporting C-style functions. ::: ::: ::: COM Interop: enables consumption of COM objects by managed code as well as exposing ::: ::: ::: .NET classes as COM objects to be consumed by native code. ::: ::: ::: C++/CLI language: enables interoperability with C and C++ via a hybrid programming language. | Summary form only given. This paper presents a user-friendly tool which allows automated sizing of IC cells. It comprises an open optimization-based sizing program, a database which allows knowledge re-use and also easy addition of new knowledge, and a powerful graphical user interface. | eng_Latn | 4,497 |
Directing the solid-state organization of racemates via structural mutation and solution-state assembly processes | Chirality plays a central role in biomolecular recognition and pharmacological activity of drugs and can even lead to new functions such as spin filters. Although there have been significant advances in understanding and controlling the helical organization of enantiopure synthetic molecular systems, rationally dictating the assembly of mixtures of enantiomer (including racemates) is nontrivial. Here we demonstrate that a subtle change in molecular structure coupled with the understanding of assembly processes of enantiomers and racemates, in both dilute solution and concentrated gels, acts as a stepping stone to rationally control the organization in the solid-state. We have studied trans-1,2-disubstituted cyclohexanes as model systems with carboxamide, thioamide, and their combination as functional groups. On comparing the gelation propensity of individual enantiomers and racemates, we find that racemates of carboxamide, thioamide, and their combination adopt self-sorting, coassembly, and mixed organiza... | In this paper, we have presented an effective yield improvement methodology that can help both manufacturing ::: foundries, fabless and fab-lite companies to identify systematic failures. It uses the physical addresses of failing bits ::: from wafer sort results to overlay to inline wafer defect inspection locations. The inline defect patterns or the design ::: patterns where overlay results showed matches were extracted and grouped by feature similarity or cell names. The potentially problematic design patterns can be obtained and used for design debug and process improvement. | eng_Latn | 4,498 |
Buffer Overflow Exploit and Defensive Techniques | Buffer overflow attack is most common and dangerous attack method at present. So the analysis is useful in studying the principle of buffer overflow and buffer overflow exploits. In the paper a didactic example is included to illustrate one method of buffer overflow exploits, and though adding a jmp esp instruction into the process space as a springboard, it makes the shell code successfully to be executed. Finally, an overview for protecting and defending against buffer overflow is summarized. | In this paper, we have presented an effective yield improvement methodology that can help both manufacturing ::: foundries, fabless and fab-lite companies to identify systematic failures. It uses the physical addresses of failing bits ::: from wafer sort results to overlay to inline wafer defect inspection locations. The inline defect patterns or the design ::: patterns where overlay results showed matches were extracted and grouped by feature similarity or cell names. The potentially problematic design patterns can be obtained and used for design debug and process improvement. | eng_Latn | 4,499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.