197,718 research outputs found
The tree model of a meromorphic plane curve
No full textWe associate with a plane meromorphic curve f a tree model T(f) based on its contact structure. Then we give a description of the y-derivative of f (resp. the Jacobian J(f, g)) in terms of T(f) (resp. T(f, g)). We also characterize the regularity of f in terms of its tree. © 2013 Springer-Verlag Italia.Abhyankar S. S., 1977, P INT S ALG GEOM KYO, P240; Abhyankar SS, 1999, P INDIAN AS-MATH SCI, V109, P117, DOI 10.1007-BF02841532; Assi A., 1999, MATH Z, V230, P16; Assi A, 1999, CR ACAD SCI I-MATH, V329, P625, DOI 10.1016-S0764-4442(00)80013-0; Barroso ERG, 2000, P LOND MATH SOC, V81, P1, DOI 10.1112-S0024611500012430; DELAMATA FD, 1994, COMPOS MATH, V92, P327; DELAMATA FD, 1994, LOND MATH S, V201, P61; KUO TC, 1977, TOPOLOGY, V16, P299, DOI 10.1016-0040-9383(77)90037-4; Maugendre H, 1998, ANN FS TOULOUSE, V7, P497; Maugendre H., J LONDON MATH SOC, V59, P207; Merle M., 1977, INVENT MATH, V41, P299; Wall C.T.C., 2004, LMS STUDENT TEXTS, V63; Zariski O., 1973, LECT CTR MATH ECOLE0
Analisi CFD in autoclave di sezioni di fusoliera 46-8 nuova generazione del velivolo B787
No full textReport of Depart. of Aerospace Eng. of Pisa, DDIA 2009-16, Sept. 2009
La costruzione degli assi principali delle superfici quadriche
No full textQuesto studio propone un metodo sintetico per la costruzione degli assi principali di una superficie quadrica, a partire da una sua generica porzione. La costruzione degli assi di una quadrica fa parte dei problemi del repertorio classico della geometria descrittiva, ed è particolarmente complessa se affrontata con i metodi grafici della rappresentazione. Il metodo proposto, sintetico e cioè grafico, è elaborato attraverso il disegno digitale tridimensionale. La costruzione descritta, applicata al caso di un cono quadrico, è generalizzata ed estesa a tutte le altre superfici quadriche.The study proposes a concise method to construct the principal axes of a quadric surface, starting with a generic segment. The construction of the axes of a quadric is part of a classical problems of descriptive geometry, and is particularly complex if tackled using graphic representation methods. The proposed method, concise and therefore graphic, is elaborated using three-dimensional digital drawing. The descriptive construction, applied to a quadric cone, is generalized and extended to all other quadric surfaces
Dr. Duane M. Jackson, Morehouse College, July 2011
No full textThis video is a conversation with Dr. Duane M. Jackson. Dr. Jackson talks about his paper, "Recall and the Serial Position Effect: The Role of Primacy and Recency on Accounting Students' Performance." Jackie Daniel, AUC Woodruff Library, is the interviewer
"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States" By M. Carey.
No full text"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States: containing bried sketches of the moral and political character of those states.
By M. Carey, member of the American philosophical, and of the American Antiquarian Society, and author of The Olive Branch, Cindiciae Hibernicae, essays on banking, on political economy, and on internal improvement.
To which are now added the English editor's comments on the subject; together with Important Advice to Emigrants, and Cautions Against Impositions Practiced in the Outports
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Generating profile-based signatures for online intrusion and failure detection
No full textContext Program execution profiles have been extensively and successfully used in several dynamic analysis fields such as software testing and fault localization. Objective This paper presents a pattern-matching approach implemented as an application-based intrusion (and failure) detection system that operates on signatures generated from execution profiles. Such signatures are not descriptions of exploits, i.e. they do not depend on the syntax or semantics of the exploits, but instead are descriptions of program events that correlate with the exploitation of program vulnerabilities. Method A vulnerability exploit is generally correlated with the execution of a combination of program elements, such as statements, branches, and definition-use pairs. In this work we first analyze the execution profiles of a vulnerable application in order to identify such suspicious combinations, define signatures that describe them, and consequently deploy these signatures within an intrusion detection system that performs online signature matching. Results To evaluate our approach, which is also applicable to online failure detection, we implemented it for the Java platform and applied it onto seven open-source applications containing 30 vulnerabilities-defects for the purpose of the online detection of attacks- failures. Our results showed that our approach worked very well for 26 vulnerabilities-defects (86.67percent) and the overhead imposed by the system is somewhat acceptable as it varied from 46percent to 102percent. The exhibited average rates of false negatives and false positives were 0.43percent and 1.03percent, respectively. Conclusion Using profile-based signatures for online intrusion and failure detection was shown to be effective. © 2013 Elsevier B.V. All rights reserved.Abou-Assi R., 2011, 1 INT WORKSH TEST DE; Agrawal R., 1993, ACM SIGMOD RECORD, V22, P207, DOI DOI 10.1145-170035.170072; Apiwattanapong T, 2005, PROC INT CONF SOFTW, P432; Bodik P., 2005, Proceedings. Second International Conference on Autonomic Computing; Brumley D., 2007, P 20 IEEE COMP SECUR; Brumley D, 2006, P IEEE S SECUR PRIV, P2, DOI 10.1109-SP.2006.41; Chaturvedi A., 2005, P IEEE S SEC PRIV; Chen HF, 2007, IEEE T SYST MAN CY C, V37, P644, DOI 10.1109-TSMCC.2007.897496; Cohen W.W., 1995, MACH LEARN 12 INT C; DENNING DE, 1976, COMMUN ACM, V19, P236, DOI 10.1145-360051.360056; Do HS, 2005, EMPIR SOFTW ENG, V10, P405, DOI 10.1007-s10664-005-3861-2; El-Ghali M., 2009, 5 INT WORKSH SOFTW E; Ernst MD, 2001, IEEE T SOFTWARE ENG, V27, P99, DOI 10.1109-32.908957; Feng HHP, 2003, P IEEE S SECUR PRIV, P62, DOI 10.1109-SECPRI.2003.1199328; Forrest S, 1996, P IEEE S SECUR PRIV, P120, DOI 10.1109-SECPRI.1996.502675; Giffin JT, 2006, LECT NOTES COMPUT SC, V4219, P41; Graves TL, 2001, ACM T SOFTW ENG METH, V10, P184, DOI 10.1145-367008.367020; Jackson D., 1994, P 2 ACM SIGSOFT S FD; Jones J. A., 2002, Proceedings of the 24th International Conference on Software Engineering. ICSE 2002, DOI 10.1109-ICSE.2002.1007991; Kang D.-K., 2005, P 6 IEEE SYST MAN CY; Kim H.-A., 2004, Proceedings of the 13th USENIX Security Symposium; Kruegel C, 2003, LECT NOTES COMPUT SC, V2808, P326; Lee W, 1998, P 7 USENIX SEC S SAN; Lee W, 1999, IEEE S SECUR PRIV, V7, P120; Leon D., 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium, DOI 10.1109-ICSE.2000.870403; Li Z, 2007, IEEE T SOFTWARE ENG, V33, P225, DOI 10.1109-TSE.2007.38; Liepins G., 1989, 12 NAT COMP SEC C BA, P495; Lippmann R, 2000, LECT NOTES COMPUT SC, V1907, P162; Lorenzoli D., 2007, P 18 IEEE INT S SOFT; Mannila H., 1995, P 1 INT C KNOWL DISC; Martin M, 2005, ACM SIGPLAN NOTICES, V40, P365, DOI 10.1145-1103845.1094840; Masri W., 2009, 7 INT WORKSH DYN AN; Masri W., 2012, ENHANCING FAULT LOCA; Masri W, 2008, EMPIR SOFTW ENG, V13, P369, DOI 10.1007-s10664-008-9071-y; Masri W, 2009, INFORM SOFTWARE TECH, V51, P385, DOI 10.1016-j.infsof.2008.05.008; Masri W., 2009, ACM T SOFTWARE ENG M, V19; Masri W, 2007, IEEE T SOFTWARE ENG, V33, P454, DOI 10.1109-TSE.2007.1020; Masri W, 2010, SOFTW TEST VERIF REL, V20, P121, DOI 10.1002-stvr.409; Masri W., 2009, INT WORKSH DEF LARG; Masri W., 2010, 3 INT C SOFTW TEST V; Masri W., 2006, 4 INT WORKSH DYN AN; Masri W, 2008, COMPUT SECUR, V27, P176, DOI 10.1016-j.cose.2008.06.002; Masri W, 2011, J SYST SOFTWARE, V84, P1171, DOI 10.1016-j.jss.2011.02.007; McConnell S., 2004, CODE COMPLETE; Miller Frederic P., 2009, ABANDONWARE COMPUTER; Mutz D., 2006, ACM Transactions on Information and Systems Security, V9, DOI 10.1145-1127345.1127348; Newsome J., 2005, P 12 ANN NETW DISTR; Newsome James, 2006, P 13 S NETW DISTR SY; Nusayr Amjad, 2009, USING AOP DET RUNT M, P8; Parnin C., ISSTA 2011, P199; Portnoy L., 2001, ACM CSS WORKSH DAT M; Sabelfeld A., 2003, IEEE J SEL AREA COMM, V21, P1; Sen K., 2005, 10 EUR SOFTW ENG C; Shull Forrest, 2002, P 8 INT S SOFTW METR; Singh A, 2006, J HEURISTICS, V12, P5, DOI 10.1007-s10732-006-3750-x; Steven S., 2000, 2000 INT S SOFTW TES, P158; Wagner D., 2002, P 9 ACM C COMP COMM, P255; Wagner D, 2001, P IEEE S SECUR PRIV, P156, DOI 10.1109-SECPRI.2001.924296; Xu HZ, 2004, LECT NOTES COMPUT SC, V3224, P21; Yin H, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P11620
Dr. Glendon Swarthout
No full textHosted by Roger M. Busfield, MSU Assistant Professor of Speech and Theater, Meet the Author is designed to introduce a general audience to a contemporary author and their work through in-depth interviews. This episode features a conversation between Dr. Glendon Swarthout, prolific author and English professor at MSU, and assistant professors Sam S. Baskett and Theodore B. Strandness
Prevalence of coincidental correctness and mitigation of its impact on fault localization
No full textThe article examines the prevalence of coincidental correctness and mitigation of its impact on fault localization. Coverage-Based Fault Localization (CBFL) techniques seek to identify failure correlated program elements using test suites in which tests are tagged as failing or passing, that is, elements that are induced by all (or most) failing runs and not induced by any (or most) passing runs; and locate the faulty code using some examination strategy. To evaluate the effectiveness of research techniques, researchers empirically quantified their accuracy in identifying CC tests in test suites involving programs with seeded faults as well as real faults. The results were promising, for example, the better performing technique, using 105 test suites and statement coverage, exhibited 9percent false negatives, 30percent false positives, and no false negatives nor false positives in 14.3percent of the test suites.Abou-Assi R., 2011, P 1 INT WORKSH TEST; Abreu R, 2009, IEEE INT CONF AUTOM, P88, DOI 10.1109-ASE.2009.25; Abreu R, 2009, J SYST SOFTWARE, V82, P1780, DOI 10.1016-j.jss.2009.06.035; Abreu R., 2006, P 12 PAC RIM INT S D, P39, DOI DOI 10.1109-PRDC.2006.18; Agrawal H., 1995, Proceedings. The Sixth International Symposium on Software Reliability Engineering (Cat. No.95TB8129), DOI 10.1109-ISSRE.1995.497652; Ammann P., 2008, INTRO SOFTWARE TESTI; Baudry B., 2006, P 28 INT C SOFTW ENG, P82, DOI 10.1145-1134285.1134299; Cadar C., 2008, P 8 USENIX C OP SYST, P209; Chen M. Y., 2002, Proceedings International Conference on Dependable Systems and Networks, DOI 10.1109-DSN.2002.1029005; Dallmeier V., 2005, P 6 INT S AUT AN DRI, P99, DOI 10.1145-1085130.1085143; Dallmeier V, 2005, LECT NOTES COMPUT SC, V3586, P528; Dickinson W, 2001, PROC INT CONF SOFTW, P339, DOI 10.1109-ICSE.2001.919107; Do HS, 2005, EMPIR SOFTW ENG, V10, P405, DOI 10.1007-s10664-005-3861-2; Han J., 2001, DATA MINING CONCEPTS, P335; Harman M, 2006, INFORM SOFTWARE TECH, V48, P549, DOI 10.1016-j.infsof.2005.06.001; Hierons RM, 2006, ACM T SOFTW ENG METH, V15, P227, DOI 10.1145-1151695.1151696; HOWDEN WE, 1982, IEEE T SOFTWARE ENG, V8, P371, DOI 10.1109-TSE.1982.235571; Jiawei H. M. K., 2001, DATA MINING CONCEPTS, P335; Jones J., 2001, P 24 INT C SOFTW ENG, P467; Jones J., 2007, P 2007 ACM SIGSOFT I, P16, DOI 10.1145-1273463.1273468; Jones J. A., 2005, P 20 IEEE ACM INT C, P273, DOI 10.1145-1101908.1101949; Korels B, 1994, P INT S SOFTW TEST A, P66, DOI 10.1145-186258.186514; Leon D., 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium, DOI 10.1109-ICSE.2000.870403; Leon D., 2005, P 16 IEEE INT S SOFT, P311; Liblit B, 2003, ACM SIGPLAN NOTICES, V38, P141, DOI 10.1145-780822.781148; Liblit B, 2005, ACM SIGPLAN NOTICES, V40, P15, DOI 10.1145-1064978.1065014; Liu CJ, 2006, PME CONFERENCE PROCE, P286; Liu C, 2005, SIAM PROC S, P286, DOI 10.1145-1081706.1081753; Liu C, 2006, IEEE T SOFTWARE ENG, V32, P831; Marick B., 1991, P 4 S SOFTW TEST AN, P190, DOI 10.1145-120807.120825; Masri W, 2008, EMPIR SOFTW ENG, V13, P369, DOI 10.1007-s10664-008-9071-y; Masri W, 2007, IEEE T SOFTWARE ENG, V33, P454, DOI 10.1109-TSE.2007.1020; Masri W., 2009, ACM T SOFTW ENG METH, V19, P2; Masri W, 2010, SOFTW TEST VERIF REL, V20, P121, DOI 10.1002-stvr.409; Masri W., 2009, INT WORKSH DEF LARG; Masri W., 2006, P 4 INT WORKSH DYN A; Masri W, 2008, COMPUT SECUR, V27, P176, DOI 10.1016-j.cose.2008.06.002; Masri W, 2011, J SYST SOFTWARE, V84, P1171, DOI 10.1016-j.jss.2011.02.007; Masri W., 2009, INFORM SOFTWARE TECH, V51, P395; Masri W., 2010, P 3 INT C SOFTW TEST; Masri W., 2012, P IEEE 5 INT C SOFTW, P737; Parnin C., 2011, P INT S SOFTW TEST A, P199; Podgurski A, 2003, PROC INT CONF SOFTW, P465, DOI 10.1109-ICSE.2003.1201224; Renieres M., 2003, Proceedings 18th IEEE International Conference on Automated Software Engineering; RICHARDSON DJ, 1993, IEEE T SOFTWARE ENG, V19, P533, DOI 10.1109-32.232020; Santelices R, 2009, PROC INT CONF SOFTW, P56, DOI 10.1109-ICSE.2009.5070508; Singh S., 2011, P NAT C REC TRENDS E; VOAS JM, 1993, J SYST SOFTWARE, V20, P207, DOI 10.1016-0164-1212(93)90064-5; VOAS JM, 1992, IEEE T SOFTWARE ENG, V18, P717, DOI 10.1109-32.153381; Wang X., 2009, P 31 IEEE INT C SOFT, P45; WEISER M, 1984, IEEE T SOFTWARE ENG, V10, P352; Wong E, 2008, P 1 INT C SOFTW TEST, P42; ZADEH LA, 1965, INFORM CONTROL, V8, P338, DOI 10.1016-S0019-9958(65)90241-X; Zheng A. X., 2006, P 23 INT C MACH LEAR, P1105, DOI 10.1145-1143844.1143983; Zoeteweij P., 2007, P TEST AC IND C PRAC, P89; Zoeteweij P., 2007, P 14 C WORKSH ENG CO0
- …
