EXTENDED SVD FLATNESS CONTROL. Per Erik Modén and Markus Holm ABB AB, Västerås, Sweden
|
|
- Louisa Hicks
- 6 years ago
- Views:
Transcription
1 EXTENDED SVD FLATNESS CONTROL Per Erik Modén and Markus Hol ABB AB, Västerås, Sweden ABSTRACT Cold rolling ills soeties do not see able to control flatness as well as exected, taking into account the nuber of actuators they are equied with. This aer, however, resents a systeatic aroach to the question of how to achieve the accurate flatness control that you would exect to get in a well-actuated cluster ill. The key to understanding the restrictions and difficulties is singular value decoosition (SVD) of the atrix that describes the flatness resonses for all actuators. This decoosition clarifies which flatness error shaes are easy to counteract, in the sense that they require little actuator oveent, and which error shaes are difficult or even iossible to reduce, since they would require very large cobined actuator oveents. Having sorted this out, a control strategy that uses this knowledge is resented. Exerience and results are rovided fro its successful use in ractice. KEYWORDS Flatness control; Singular value decoosition; Cold rolling; Cluster ill; Robustness; Perforance; INTRODUCTION Flatness control in cold-rolling is a ultivariable control roble. Abstractly seaking, you can view flatness errors and actuator oveents as occurring in saces of high diension. Different shaes of the flatness error corresond to different directions in the sace of flatness errors, and the diension of this sace equals the nuber of sensors. Different cobinations of actuator oveent corresond to different directions in the sace of actuator oveents, and the diension of this sace equals the nuber of actuators. A cobined oveent of actuators in the actuator sace will influence the errors in a certain direction in the error sace and this with a certain gain. This gain will vary a lot with the direction of the oveent. Singular value decoosition (SVD) is the systeatic way to get insight into this. It orders the influence into orthogonal directions in the saces according to the gains, fro highest gain to lowest, often ending with soe directions having zero gain. Use of SVD in flatness control has reviously been described in [], [2], and [3]. You soeties see flatness errors being described using a basis of orthogonal olynoials. The SVD rovides another orthogonal basis, with the additional advantage that for each error basis vector you also get the corresonding actuator basis vector and the gain. The largest singular value and the corresonding basis vectors tell which shae of flatness error is the easiest to eliinate, in the sense that it takes the least actuator oveents. It also tells how the required cobined actuator oveent looks. This is continued for gradually ore difficult-toreduce flatness error shaes, corresonding to directions in error sace that are orthogonal to the ones already treated. If the sallest singular values are zero, then the corresonding actuator directions for a null sace, eaning that oveents of actuators in this sace cancel out the flatness effect of each other. In other words, when there is a null sace the flatness effect obtained
2 with one actuator can alternatively be obtained by a certain cobined oveent of the other actuators. It often turns out that a ill with ten actuators or ore can still not control ore than around five directions in ractice, since the reaining ones would require too large actuator oveents. The roble is not only the restricted actuator ranges. For a direction related to a very sall singular value, the resonses to the large oveents are suosed to cancel in all directions excet the intended one. But to achieve this recise cancellation, the odel would have to be unrealistically erfect. This does not ean that the extra actuators are useless. It just exoses the control challenge. The control solution should use all actuators and all degrees of freedo, but not nervously send large oveents on chasing errors that are too hard to counteract in ractice. In contrast to the solutions resented in [] and [2], all degrees of freedo are still available for control with the solution resented in this aer. The aer resents the atheatical background in section. The control solution and soe of its roerties are resented in section 2. A discussion of the tuning of this solution is given in section 3. Practical exerience is exelified in section 4, and soe concluding rearks are rovided in section 5.. THE MILL MATRIX AND ITS SINGULAR VALUE DECOMPOSITION The influence of the actuators on the flatness can be described by a atrix which we call the ill atrix. Its coluns are fored by the steady state flatness resonses fro all actuators, one colun er actuator. Each flatness resonse is a colun vector with one eleent er easureent roll sensor osition. So the diension of the ill atrix is (nuber of sensor ositions) ties (nuber of actuators). We denote it by G and sell out the steady state relation as () Here is a vector describing a change in actuator ositions fro a revious steady state, and is the resulting vector of steady state change in flatness easureent. The inus sign is just a choice of convention. Flatness control is a ultivariable control roble, and in ultivariable rocess control directionality lays an iortant role. You can talk about high gain directions and low gain directions, where the forer are easy to control and the latter are difficult. It is often hard to get a good enough odel to be able to control the low gain directions, and you ight need to give u control of the. To find out what high and low gain directions we have in our flatness control case, we ake a singular value decoosition of the ill atrix. This is the atheatic exression for it: T U U U U V (2) T T V G UV T V2 In this exression, the uer art of is a diagonal atrix holding the singular values {, 2, } in the diagonal, and they are ordered fro largest to sallest, and all are ositive or zero. The lower art of is fored by as any zero rows as there are ore sensor ositions than actuators. The atrix U is orthonoral and its coluns for a basis for the sace of flatness errors. In the sae way the atrix V is orthonoral and its coluns for a basis for the sace of actuators. We have assued that there are ore sensor ositions than actuators. The singular values are the gains fro
3 an actuator oveent along a colun of V to the resonse in flatness, which actually occurs along the corresonding colun of U. In the second equality in (2), we ake a artitioning of the atrices according to high gains and low gains (and those which are zero due to fewer actuators than sensor ositions). In the last equality in (2), it has been assued that all singular values in 2 are zero, or sall enough in coarison with the larger singular values to be aroxiated to zero. Now, we will try to exlain in sile words what the singular value decoosition (SVD in shor can tell about the roerties of the ill atrix and thus about the ultivariable flatness control roble. Suose we stand in the high diensional actuator sace and want to take a ste of size one, wondering what direction to choose in order to get the largest ossible flatness influence. The answer is: Choose the direction given by the first colun of V. The size of your flatness resonse to this articular cobined oveent of actuators will be, the largest singular value, and the shae of the steady state resonse will be given by the first colun of U. The singular value is the gain, and this was the high gain direction. If you then look for the highest gain aong reaining actuator directions orthogonal to that first one, you will find the second singular value. It is the gain fro actuator oveent along the second colun of V, which gives flatness resonse along the second colun of U. We can continue like this towards lower and lower singular values (gains), until we reach those which can be aroxiated to zero. We have then found also the low gain directions. What is it then that akes high gain directions easy to control and low gain directions hard? In the high gain direction, sall actuator oveents will be enough, and you ay disregard interference with other directions. Control in a low gain direction is troublesoe for at least two reasons: ) it will require large actuator oveents which ay cause rate saturation and even absolute saturation, which both have negative influence on erforance, 2) the effect of the large actuator oveents are suosed to cancel each other in the higher gain directions, and this uts hard deands on odel accuracy, often harder than ossible to fulfill. The nuber of non-zero singular values is what is called the rank of the ill atrix. We ay define the ractical rank as the nuber of singular values that we consider to be high enough gain to be addressed by the flatness control. The singular values that are saller define a (ractical) null sace of the ill atrix. Actuator oveents in the null sace have no (or insignifican influence on the flatness. The artitioning in (2) is such that the ractical rank is given by the size of, and 2 holds the singular values that are considered too sall. The null sace is sanned by the coluns of V 2. Another asect of this is that flatness errors that can be exressed as linear cobinations of the coluns in U 2 and U 3 cannot be counteracted at all. There are no cobinations of actuator oveents that influence errors of those shaes. All flatness errors that can be counteracted can be exressed as linear cobinations of the coluns of U. A recording fro a ill is shown in Figure, where the initial flatness and the final flatness are equal, but with quite different actuator ositions. It has been ascertained that this was not due to a changed disturbance situation. This illustrates the fact that the ill atrix for this ill has a null sace. The actuator oveent fro the initial ositions to the final ones did only cause a transient change of the flatness, but no change of steady state flatness, so the sae flatness effect fro the actuators was obtained with both final and initial ositions. Further, towards the end the actuators still ove without influencing the flatness, so this oveent also takes lace in the null sace. This ill has eleven actuators and the ill atrix has rank eight, so the null sace has diension three. The ractical rank is robably rather around five, leaving a ractical null sace of diension around six.
4 Figure. An actual recording fro a ill, illustrating that the sae flatness influence is obtained with quite different actuator ositions. The difference in initial and final ositions reresents a oveent in the null sace. In Figure 2 and Figure 3, an exale with seven actuators is used to illustrate the singular value decoosition of a ill atrix. This exale has five crown actuators and two side shifts. This exale does in fact not have an extreely high ratio between largest and sallest singular values. This ratio is called the condition nuber of the ill atrix. The largest singular value is in this case =3.6 and the sallest 7 =.86, giving a condition nuber of 42, which is not too bad. But if there is soe uncertainty in the resonse functions, one ight still want to treat actuator oveents along the last SVD direction as having no effect (i. e. as being in the null sace), since the effect of these oveents will be sall and uncertain. Total eliination of errors shaed according to the last SVD direction would in any case require very large actuator oveents, thereby easily causing the to reach their constraints. It is therefore wise to give u at least total eliination of such errors Flatness resonse functions Cr Cr2 Cr3 Cr4 Cr5 UerSS LowerSS Figure 2. Steady state flatness resonse function for each of the actuators
5 5 crown actuators 2 side shifts 2 Flatness resonses in SVD directions SVD SVD SVD SVD 2 SVD 3 SVD 4 SVD 5 SVD 6 SVD 7 SVD SVD 4 SVD 5 SVD SVD Figure 3. Flatness resonses along singular value directions. The left hand lot shows cobined actuator oveents that corresond to the resective singular value, and the right hand lot shows the flatness resonse for each of those cobined actuator oveents. Largest resonse is obtained when actuators are oved along the first SVD direction and sallest resonse when oved along the last. 2. CONTROL SOLUTION One coon control solution uses a araeterized flatness error obtained by iniizing a quadratic criterion while honoring actuator constraints. Based on SVD of the ill atrix, this solution can be extended to include weights on directions associated with sall singular values, thereby roviding the desired control erforance. This extended SVD control solution uses all actuators available. It can also ove the in the null sace, when needed due to constraints, but will not cause unnecessary oveent there. The standard control solution is illustrated in Figure 4. This standard control solution iniizes a criterion to find a lower diension araeterization e of the flatness error e. Each eleent of the araeterized error vector e is fed to one controller, for exale a PI controller, and the outut of each controller is fed to one of the actuators. In its basic original for the criterion to iniize could be exressed as W e 2 (, e( G e ( e( (3) The criterion (3) is to be iniized while taking constraints into account. Those constraints are the actuator constraints, including their rate and range constraints and for exale constraints on differences between adjacent crown actuators. Denoting the vector of actuator ositions at tie t by
6 Figure 4. Block schee showing the structure of a standard control solution u(, this u( which is subject to constraints will deend on the araeterized error e (, the revious ositions u(t-) and the controller states. In cases when the constraints do not becoe active, the solution to this sile iniization is given by the seudo-inverse G of the ill atrix G. Thus, for a case with non-singular ill atrix and no active constraints we get the araeterized error by the rojection T T G G G e( e ( G e( (4) This exression will however get very sensitive, if the ill atrix has any singular value that is sall in relation to the largest one. The inverse G T G will not even exist, if any singular value is zero. To ake this solution, relying on iniization of a criterion like (3), ractically usable for cases with a singular or near singular ill atrix, you need to either add soe kind of regularization to the criterion, or ake the ill atrix better conditioned for exale by gathering a nuber of actuators into fewer virtual actuators. The latter aroach will however reove soe degrees of freedo that the ill could have benefitted fro. Based on the singular value decoosition, we can introduce a systeatic regularization that enables the full use of all degrees of freedo while still avoiding the robles associated with a (near) singular ill atrix. A straightforward version of the extended criterion is 2 T T T T (, e(, u( G e ( e( e ( VQ V e ( u( VQ V u( W e (5) It is still to be iniized while taking constraints into account, just as with the original criterion (3). The idea here is that Q e and Q u are chosen as diagonal atrices. The entries in the diagonals ily certain weights in the criterion for araeterization of the error and the actuator ositions, resectively, along the directions sorted according to the singular values (or in other words sorted according to the gains). So, for exale, if we consider the gains to be too low fro the fifth singular value and on, then we should choose the fifth and further diagonal eleents of both Q e and Q u high enough. The first four diagonal eleents in these two atrices ay in this exale be set to zero, eaning that no extra weight is alied to araeterizations that give actuator oveents e u
7 in the first four directions. The choice of Q e will ainly influence the transient behavior, while the choice of Q u will ainly influence the steady state behavior. Assuing that, in the criterion (5), the non-zero weights in Q e and Q u corresond to the null sace, then oveent in the null sace will be avoided as long as no actuator gets saturated. But when any actuator hits a constraint, the control solution will use other actuators to accolish at least artially what the saturated one could not. This is ossible since oveent in the null sace is allowed. Such oveent is still avoided when not needed, since there is a enalty in the criterion for using it. 3. TUNING PARAMETERS AND TUNING TOOL It is aarent fro section 2 that the two atrices Q e and Q u are iortant for the control behavior in the extended SVD control solution. They are, however, not really the kind of intuitive tuning araeters that a coissioning engineer would require. What is needed in addition is a tuning tool that allows the tuning to be erfored on a higher level, roviding easily grased tuning knobs and clear resentations of what the exected results will be. In tuning, which is ade at coissioning, one consideration is the trade-off between robustness and noinal erforance. One easure of robustness is the eak of the sensitivity function. For rocess control it is often chosen to be between.2 and 2.. Lower values in this range ean higher robustness towards deviations between the odel used in tuning and the actual lant behavior, but also slower counteraction of disturbances and therefore lower noinal transient erforance. Only if you have a odel that you trust very well, you would tune the controller to get sensitivity eak values in the uer art of the suggested range. If you exect a need for very high robustness, due to an uncertain odel or varying actual behavior, you could very well tune for a sensitivity eak below.2 as well. The lower liit for what you can get at all is. With a tuning knob for the desired sensitivity eak value, the engineer doing the tuning will have good influence over the robustness to be obtained. This covers the ultivariable asect of robustness, as we consider the axiu singular value of the ultivariable sensitivity function. The sensitivity eak secification is an indirect secification of transient behavior, and it eventually leads to values of the diagonal of Q e, found to give the desired eak value. The user also has the freedo to select how any directions should be acted on with full force. Those will have zeros in the corresonding diagonal osition in Q e, and the reaining diagonal eleents will be used to get the secified sensitivity eak value. As a sanity check regarding ultivariable behavior, it is also ade sure that there is not too uch cross talk interference between different directions during transients. The user can secify an allowed ercentage for this cross talk. The tuning of the individual controllers (one er actuator) will actually also be art of the tuning of transient behavior. So beside soe eleents of Q e, also a araeter related to the settling tie for the individual control loos will be found autoatically to get the desired sensitivity eak, and cross talk below liits. An iortant art of any tuning tool is clear resentation of exected control erforance. The transient behavior can here be studied for a nuber of different disturbances, also with a validation odel that ay differ fro the noinal one used in the tuning. This way one ay check both the noinal erforance and the robustness. In addition to that, the actually obtained sensitivity eak value is resented, as well as the closed loo tie constant for the individual loos.
8 Figure 5. A tuning tool view. On to there are tuning inuts and soe resulting erforance easures. To the left there are siulation choices, in this case selecting a disturbance along the fourth SVD direction alied in closed loo with the noinal odel and ignoring actuator constraints. The grahs are divided as follows: The uer grahs show the flatness resonse and the lower grahs show the actuator ositions. The grahs to the left show the transient resonse while the grahs to the right shows the result at the end of the siulation. In the uer right grah only the initial errors are visible (white bars), since the final errors are zero in this siulation. An exale view fro the tuning tool can be seen in Figure 5. In this view, the evolution of the flatness error can be viewed in a 3D lot (like the figure), or exressed with either the SVD basis or a olynoial basis. The actuator oveents can be viewed as is (like the figure) or exressed with the SVD basis, and one can also choose to view their ossible oveent in the null sace. The steady state behavior with extended SVD control is ainly deterined by the choice of Q u. The concern of the tuning engineer is to avoid too high closed loo steady state gain fro disturbance to actuators, since that would too easily cause actuator saturation. For directions corresonding to large singular values of the ill atrix (high gain directions) this is no roble, but it ay be for low gain directions. So the Q u diagonal eleents corresonding to large singular values should be zero and the rest should be found based on the setting of a suitable intuitive tuning knob. This knob can be the highest allowed steady state gain fro disturbances to actuators. The tool can easily translate that to required values for the Q u diagonal eleents and calculate the resulting steady state attenuation of disturbances. In addition, it is ossible to let the engineer choose for how any SVD directions disturbances should be coletely eliinated in steady state, rovided the entioned gains do not exceed the secified liit. And it is ossible to state that if disturbances in any SVD direction cannot be attenuated ore than a certain ercentage, control of it should be given u totally. All these settings ay influence the finally obtained diagonal eleents of Q u.
9 To check the result of the steady state tuning a view is available in the tool, as exelified in Figure 6. In this exale, disturbances along the first six SVD directions are totally eliinated in steady state, but since a liit of 5 was secified for the steady state gain fro disturbance to actuators, disturbances along the last SVD direction will be attenuated only by 36%. The liit value is noralized with resect to the first SVD direction, which eans that a value of 5 allows 5 ties ore actuator oveents than the first SVD direction. This view will hel the tuning engineer check the exected behavior and select a suitable steady state tuning. Figure 6. A tuning tool view resenting the steady state resonses in closed loo. For each SVD direction, there is one lot showing an initial and final flatness error (white and blue bars resectively), when a disturbance of that shae occurs, and below that the final osition of the actuators (blue bars), assuing they were in zero osition before the disturbance occurred. Here, each disturbance has the sae nor, so the actuator oveents required to reach the resented final error can be directly coared. 4. PRACTICAL EXPERIENCE The resented control solution extended SVD has been coissioned in a cluster ill containing actuators with great results. The ill atrix in this ill has a theoretical rank of eight. The ractical rank, however, was considered to be four, leaving a ractical null sace of diension seven. The ratio between the largest (firs and sixth singular value was 3, which eans that it would require 3 ties larger actuator oveents to eliinate a disturbance according to the sixth SVD direction in coarison to a disturbance of the sae size for the first SVD direction. This is far too high to be ractically ossible. The corresonding ratios for the fourth and fifth singular values were 22 and 38. Both are lausible deending on the accuracy of the ill atrix. The better
10 the flatness resonse odels are, the ore SVD directions can be used in control. To deterine the odel accuracy, a syste identification exerient was erfored in the ill where the actuators were excited according to their SVD directions and the corresonding flatness resonses were recorded. Analysis showed that the recorded flatness resonses and the SVD directions fro the noinal ill atrix agreed very well u to the fourth direction. The fifth SVD direction, however, did not the atch the exected shae since the actuator oveents that were suosed to cancel each other out failed in doing so. Instead of a getting a low gain direction, the result was a quite high gain direction of a coletely different shae than exected. Of course, this direction could not be included in control, which resulted in a steady state tuning that included four SVD directions as can be seen in Figure 7. Figure 7. Steady state tuning used in control of the cluster ill. Four SVD directions were used in the control The forer flatness control solution ade the ill atrix better conditioned by aing actuators with siilar flatness resonses together, thereby reducing the nuber of control loos. In addition, the crown actuators were not used in the autoatic flatness control; they were only used for anual oeration by the ill oerators. Of course, this control solution has reoved valuable degrees of freedo. In Figure 8 below, a startu of a coil is lotted. The uer grah shows the actuators ositions, the iddle grah shows the flatness error (flatness target easured flatness) and the lower grah shows the ean flatness and the used control strategies. A thin blue line at the botto of the lower grah indicates the forer control solution and the thick blue line indicates the use of extended SVD control. As can be seen in both the 3D grah of the flatness error and the grah of the ean flatness, the forer control erfors oorly due to the fact that several actuators are saturated (as
11 can be seen in the uer grah as horizontal straight lines). When switching to extended SVD control, all actuators could be used in control and the full use of the available degrees of freedo resulted in a significant dro in flatness error and ean flatness. The average flatness was iroved fro a value of 7 to 4 I-units. Figure 8. A recording fro the startu of a coil, initially using the revious control solution and activating the extended SVD control after roughly two thirds of the recording (thick line in the botto grah). Both rocess engineers and oerators at the cluster ill were leased with the extended SVD control. First of all, all actuators were individually used in the autoatic control and thereby using all degrees of freedo. Secondly, the actuators were ore centered within their working ranges, which iniized saturation liit situations and thereby could reduce wear and aintenance of the actuators. 5. CONCLUSIONS We can conclude that the systeatic way of treating the ill atrix using singular value decoosition is an efficient way for understanding the ultivariable control roble inherent in flatness control for cases with any actuators. The extended SVD control solution that is based on it has also roved to give the desired control accuracy. It retains all degrees of freedo and uses all actuators available. In articular it handles actuator constraints efficiently, since it can use other actuators to rovide the sae effect, when one actuator has becoe saturated. REFERENCES [] J.V. Ringwood, Shae Control Systes for Sendziir Steel Mills, IEEE Trans. Control Syst. Technol. Vol. 8, No., (2), 7-86, [2] P. Bergsten, Method and device for otiization of flatness control in the rolling of a stri, EP89985, (28) [3] P.E. Modén and M. Hol, Method of flatness control for rolling a stri and control therefor, EP255276, (22)
I n many cases, the SPRT will come to a decision with fewer samples than would have been required for a fixed size test.
STATGRAPHICS Rev. 9/6/3 Sequential Saling Suary... Data Inut... 3 Analysis Otions... 3 Analysis Suary... 5 Cuulative Plot... 6 Decision Nubers... 9 Test Perforance... O. C. Curve... ASN Function... Forulas...
More informationA Fail-Aware Datagram Service
A Fail-Aware Datagra Service Christof Fetzer and Flaviu Cristian christof@research.att.co, htt://www.christof.org Abstract In distributed real-tie systes it is often useful for a rocess to know that another
More informationRecap Consistent cuts. CS514: Intermediate Course in Operating Systems. What time is it? But what does time mean? Drawing time-line pictures:
CS514: Interediate Course in Oerating Systes Professor Ken iran Vivek Vishnuurthy: T Reca Consistent cuts On Monday we saw that sily gathering the state of a syste isn t enough Often the state includes
More informationNew method of angle error measurement in angular artifacts using minimum zone flatness plane
Alied Mechanics and Materials Subitted: 04-05-4 ISSN: 66-748, Vols. 599-60, 997-004 Acceted: 04-06-05 doi:0.408/www.scientific.net/amm.599-60.997 Online: 04-08- 04 Trans Tech Publications, Switzerland
More informationA Fail-Aware Datagram Service
A Fail-Aware Datagra Service Christof Fetzer and Flaviu Cristian christof@research.att.co, htt://www.christof.org Abstract In distributed real-tie systes it is often useful for a rocess Ô to know that
More informationSpatial interference encoding patterns based super resolved photoacoustic microscopy
Satial interference encoding atterns based suer resolved hotoacoustic icroscoy Aihai Meiri 1, Eric M. Stroh 2, Michael C. Kolios 2 and Zeev Zalevsky 1 1 Faculty of Engineering and the Nano Technology Center,
More informationA Preliminary Study of Maximum System-level Crosstalk at High Frequencies for Coupled Transmission Lines
A Preliinary tudy of Maxiu yste-leel Crosstalk at High Frequencies for Couled Transission Lines iaoeng Dong, Haixiao Weng, Daryl G Beetner Todd Hubing Electroagnetic Coatibility Laboratory Uniersity of
More informationInteractive Fuzzy Modeling by Evolutionary Multiobjective Optimization with User Preference
Interactive Fuzzy Modeling by Evolutionary Multiobjective Otiization with User Preference Yusue ojia, Hisao Ishibuchi Deartent of Couter Science and Intelligent Systes, Osaa Prefecture University - Gauen-cho,
More informationAnalysis of a Biologically-Inspired System for Real-time Object Recognition
Cognitive Science Online, Vol.3.,.-4, 5 htt://cogsci-online.ucsd.edu Analysis of a Biologically-Insired Syste for Real-tie Object Recognition Erik Murhy-Chutorian,*, Sarah Aboutalib & Jochen Triesch,3
More informationMarkov Analysis for Optimum Caching as an Alternative to Belady s Algorithm
arov Analysis for Otiu Caching as an Alternative to Belady s Algorith, Deutsche Teleo, Darstadt, Gerany gerhard.hasslinger@teleo.de Analytic Results on LRU, LFU, Otiu Caching Belady s Princile for Otiu
More informationCOMP 250. Lecture 4. Array lists. Sept. 15, 2017
COMP 25 Lecture 4 Arra lists Set. 5, 27 Arras in Java int[ ] Ints = new int[5]; Ints[3] = -732; Arra whose eleents have a riitive te 2 Ints int[ ] Ints = new int[5]; Ints[3] = -732; 2 3 : 4-732 : Arras
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationNear Light Correction for Image Relighting and 3D Shape Recovery
Near Light Correction for Iage Relighting and 3D Shae Recovery Anonyous for Review Abstract In this aer, we roose a near-light illuination odel for iage relighting and 3D shae recovery Classic ethods such
More informationDynamics of Machines. Part 1: Getting started (1) Introduction SPACAR. Part 1: Getting started (2) Mass-spring model
Part : Getting started () Lecturer: Dnaics of Machines Introduction SPACAR Universit of Twente / acult of Engineering Technolog (CTW) Mechanical Autoation (Wa) Horstring (building ) Z 9 Phone: (053) 489
More informationMeasuring Bottleneck Bandwidth of Targeted Path Segments
Measuring Bottleneck Bandwidth of Targeted Path Segents Khaled Harfoush Deartent of Couter Science North Carolina State University Raleigh, NC 27695 harfoush@cs.ncsu.edu Azer Bestavros Couter Science Deartent
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationAn Ensemble of Adaptive Neuro-Fuzzy Kohonen Networks for Online Data Stream Fuzzy Clustering
An Enseble of Adative euro-fuzzy Kohonen etworks for Online Data Strea Fuzzy Clustering Zhengbing Hu School of Educational Inforation Technology Central China oral University Wuhan China Eail: hzb@ail.ccnu.edu.cn
More informationOn-Chip Interconnect Implications of Shared Memory Multicores
On-Chi Interconnect Ilications of Shared Meory Multicores Srini Devadas Couter Science and Artificial Intelligence Laboratory (CSAIL) Massachusetts Institute of Technology 1 Prograing 1000 cores MPI has
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More informationReal Time Displacement Measurement of an image in a 2D Plane
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant
More informationpart 3 Martin Samuelčík Room I4
art 3 Martin Sauelčík htt://www.sccg.sk/~sauelcik Roo I4 Vertex coordinates Fro inut coordinates to window coordinates Coordinates are always related to coordinates syste, sace, frae Transforing vertex
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationcmd p p p cmd cmd ... cmd p p p command 1 command 2 command 3 cmd cmd ... cmd S M T W T F S command n cmd ... cmdn p p p cmd ...
The Trials and Tribulations of Building an Adative User Interface Benjain Korveaker & Russell Greiner fbenjain, greinerg@cs.ualberta.ca Deartent of Couter Science University of Alberta Edonton, Canada
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationTrigonometric Functions
Similar Right-Angled Triangles Trigonometric Functions We lan to introduce trigonometric functions as certain ratios determined by similar right-angled triangles. By de nition, two given geometric gures
More informationEquality-Based Translation Validator for LLVM
Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented
More informationRandomized algorithms: Two examples and Yao s Minimax Principle
Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum
More informationA Novel Architecture for Compiled-type Software CNC System
Key Engineering Materials Online: 2007-05-15 ISSN: 1662-9795, ol. 339, 442-446 doi:10.4028/.scientific.net/kem.339.442 2007 rans ech Pulications, Sitzerland A Novel Architecture for Coiled-tye Softare
More informationCLOUD computing is quickly becoming an effective and
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 6, JUNE 203 087 Otial Multiserver Configuration for Profit Maxiization in Cloud Couting Junwei Cao, Senior Meber, IEEE, Kai Hwang, Fellow,
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationDKD-R 4-2 Calibration of Devices and Standards for Roughness Metrology Sheet 2: Calibration of the vertical measuring system of stylus instruments
DKD-R 4- Calibration of Devices and Standards for Roughness Metrology Sheet : Calibration of the vertical easuring syste of stylus instruents DKD-R 4- Sheet.7 DKD-R 4- Calibration of Devices and Standards
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationOn the Computation and Application of Prototype Point Patterns
On the Coputation and Application of Prototype Point Patterns Katherine E. Tranbarger Freier 1 and Frederic Paik Schoenberg 2 Abstract This work addresses coputational probles related to the ipleentation
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationSource Coding and express these numbers in a binary system using M log
Source Coding 30.1 Source Coding Introduction We have studied how to transmit digital bits over a radio channel. We also saw ways that we could code those bits to achieve error correction. Bandwidth is
More informationAn energy-efficient random verification protocol for the detection of node clone attacks in wireless sensor networks
Zhou et al. EURASIP Journal on Wireless Counications and Networking 2014, 2014:163 htt://jwcn.eurasijournals.co/content/2014/1/163 RESEARCH Oen Access An energy-efficient rando verification rotocol for
More informationProcess and Measurement System Capability Analysis
Process and Measurement System aability Analysis Process caability is the uniformity of the rocess. Variability is a measure of the uniformity of outut. Assume that a rocess involves a quality characteristic
More informationSpace-efficient Region Filling in Raster Graphics
"The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More informationTOLLY. Premise: Buyers of multi-port. BayStack T Switch Fast Ethernet Switch Competitive Evaluation Backplane Capacity.
Preise: Buyers of ulti-port switches need to know the actual capacity of the backplane (switching fabric) used to interconnect ports. To assure a non-blocking environent i.e., all ports can run at wire-speed
More informationELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH
ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.
More informationCS 1110 Final, December 7th, 2017
CS 1110 Final, December 7th, 2017 This 150-minute exam has 8 questions worth a total of 100 oints. Scan the whole test before starting. Budget your time wisely. Use the back of the ages if you need more
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More information12) United States Patent 10) Patent No.: US 6,321,328 B1
USOO6321328B1 12) United States Patent 10) Patent No.: 9 9 Kar et al. (45) Date of Patent: Nov. 20, 2001 (54) PROCESSOR HAVING DATA FOR 5,961,615 10/1999 Zaid... 710/54 SPECULATIVE LOADS 6,006,317 * 12/1999
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationSingle Degree-of-Freedom Rigidly Foldable Cut Origami Flashers
Robert J. Lang Lang Origai, Alao, CA 9507 e-ail: robert@langorigai.co Sencer Magleby Deartent of Mechanical Engineering, Brigha Young University, Provo, UT 860 e-ail: agleby@byu.edu Larry Howell Deartent
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationAn Efficient Coding Method for Coding Region-of-Interest Locations in AVS2
An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China
More informationTALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE
7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,
More informationResearch on Inverse Dynamics and Trajectory Planning for the 3-PTT Parallel Machine Tool
06 International Conference on aterials, Information, echanical, Electronic and Comuter Engineering (IECE 06 ISBN: 978--60595-40- Research on Inverse Dynamics and rajectory Planning for the 3-P Parallel
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationSwinburne Research Bank
Powered by TCPDF (www.tcdf.org) Swinburne Research Bank htt://researchbank.swinburne.edu.au Author: Isla, Md. Saiful; Liu, Chengfei; Rahayu, Wenny; Anwar, Tariue Title: Q lus Tree: An efficient Quad Tree
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationImproved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties
Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationSensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network
1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann
More informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationImage hiding with an improved genetic algorithm and an optimal pixel adjustment process
Eighth International Conference on Intelligent Systes Design and Applications Iage hiding with an iproved genetic algorith and an optial pixel adjustent process Lin-Yu Tseng Yung-Kuan Chan Yu-An Ho Yen-Ping
More informationData pre-processing framework in SPM. Bogdan Draganski
Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason
More informationANALYSIS AND RECOVERY OF SYSTEMATIC ERRORS IN AIRBORNE LASER SYSTEM
ANALYSIS AND RECOVERY OF SYSTEMATIC ERRORS IN AIRBORNE LASER SYSTEM Zhihe Wang*, Rong Shu,Weiing Xu, Hongyi Pu, Bo Yao Shanghai Institute of Technical Physics, CAS, 500 Yutian Road, Shanghai 200083, P.
More informationMedical Biophysics 302E/335G/ st1-07 page 1
Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative
More informationModal Masses Estimation in OMA by a Consecutive Mass Change Method.
Modal Masses Estiation in OMA by a Consecutive Mass Change Method. F. Pelayo University of Oviedo, Departent of Construction and Manufacturing Engineering, Gijón, Spain M. López-Aenlle University of Oviedo,
More informationShape Optimization of Quad Mesh Elements
Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face
More informationGrouping of Patches in Progressive Radiosity
Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate
More information6.1 Topological relations between two simple geometric objects
Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying
More informationShuigeng Zhou. May 18, 2016 School of Computer Science Fudan University
Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationMiniaturized Spectrometers Chapter 1. 1 Miniaturized Spectrometers. 1.1 General Set-up
Miniaturized Spectroeters Chapter 1 1 Miniaturized Spectroeters 1.1 General Set-up The classical spectroeter consists of an input slit, a rotating dispersive eleent (pris or grating), an output slit and
More informationDepth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method
Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationAn Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints
519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationBrian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi
A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationFlucs: Artificial Lighting & Daylighting. IES Virtual Environment
Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...
More informationSubmission. Verifying Properties Using Sequential ATPG
Verifying Proerties Using Sequential ATPG Jacob A. Abraham and Vivekananda M. Vedula Comuter Engineering Research Center The University of Texas at Austin Austin, TX 78712 jaa, vivek @cerc.utexas.edu Daniel
More informationKnowledge Discovery Applied to Agriculture Economy Planning
Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationEfficient Processing of Top-k Dominating Queries on Multi-Dimensional Data
Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of
More informationWeighted Page Rank Algorithm based on In-Out Weight of Webpages
Indian Journal of Science and Technology, Vol 8(34), DOI: 10.17485/ijst/2015/v8i34/86120, December 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 eighted Page Rank Algorithm based on In-Out eight
More informationVerdict Accuracy of Quick Reduct Algorithm using Clustering, Classification Techniques for Gene Expression Data
Verdict Accuracy of Quick Reduct Algorith using Clustering, Classification Techniques for Gene Expression Data T.Chandrasekhar 1, K.Thangavel 2 and E.N.Sathishkuar 3 1 Departent of Coputer Science, eriyar
More informationImage Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.
Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions
More informationDistributed Estimation from Relative Measurements in Sensor Networks
Distributed Estimation from Relative Measurements in Sensor Networks #Prabir Barooah and João P. Hesanha Abstract We consider the roblem of estimating vectorvalued variables from noisy relative measurements.
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationPerformance analysis of hybrid (M/M/1 and M/M/m) client server model using Queuing theory
International Journal of Electronic and Couter cience Engineering vailable Online at wwwijeceorg IN- 77-9 erforance analyi of hybrid M/M/ and M/M/ client erver odel uing ueuing theory atarhi Guta, Dr Rajan
More informationInternational Journal of Scientific & Engineering Research, Volume 6, Issue 9, September ISSN
International Journal of Scientific & Engineering Research, Volue 6, Issue 9, Seteber-05 9 ISSN 9-558 Doinating Sets Of Divisor Cayley Grahs G. Mirona, Prof. B. Maheswari Abstract Let n be an integer and
More information