{"title":"Voltage stability and reactive power compensation on the T&TEC system","authors":"F. Castellanos, A. Mohammed","doi":"10.1109/SECON.2003.1268443","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268443","url":null,"abstract":"Voltage stability can be defined as the ability of a power system to maintain steady acceptable voltages at all buses in the system under normal operating conditions and after being subjected to a disturbance [P. Kundar (1994)]. We describe the methodology used to study the voltage stability on the T&TEC (Trinidad and Tobago Electricity Commission) system and its propensity to voltage collapse. A post-contingency power flow technique was used to construct the V-P (voltage versus power) curves for different buses in the system. Once susceptibility to voltage collapse was found in any area, the severity was ranked using the V-P curves, and a load margin index. The most severe cases were then analysed for reactive power compensation as a mitigation technique for any voltage instability. Finally, the reactive power compensation was then taken a step further to obtain an \"optimal\" location of the reactive power sources using V-Q sensitivity techniques.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131093000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance measurements of Web applications","authors":"J. Cane","doi":"10.1109/SECON.2003.1268435","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268435","url":null,"abstract":"The goal of this research is to produce objective data comparing the performance of the most widely utilized Web application classes in an invariant laboratory environment. Efficient Web applications lead to faster response to user requests and to more efficient utilization of server resources. Commercial tests utilize aggregated load-test benchmarks to obtain outcomes usually intended to promote proprietary products. In this research, various Web applications are tested on the same system with homogeneous page requests having known content that produces a known response from the application. The laboratory LAN environment ensures repeatability of test conditions and avoids problems such as multipath effects on the Internet. The test environment and testing protocol are described. Results of the first round of performance testing are summarized.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"61 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123273215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel method for arithmetic operations using complex binary number system and the reconversion of the result to the decimal complex number system","authors":"H. Zaini, R. G. Deshmukh","doi":"10.1109/SECON.2003.1268427","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268427","url":null,"abstract":"Walter Penney defined a complex number system first by using a base of -4 and later by using (-1+j) [W. Penney, (1964), (1956)]. Other researchers have been working on the representation of complex binary numbers as one unit and perform arithmetic operations [(T.Jamil et al., (2000)]. We discuss a complex binary number system (CBNS) for high-speed arithmetic operations. An algorithm that performs the conversion of the decimal complex numbers to the binary complex number system that treats the complex number as one unit is represented [(T.Jamil (Dec2001)/Jan2002)]. A lookup table is generated to store their equivalent values in the CBNS form. We also present a new method to perform arithmetic operations (+, - , *, /) on operands in the CBNS form. A new algorithm is developed to add two complex numbers (CBNS form) using a modified carry look ahead principle. A block diagram for the adder that uses a new algorithm is presented. The results of the arithmetic operations in the CBNS form are reconverted back to the binary complex number using a new lookup table. This lookup table presents a new method for the reconversion of the CBNS numbers to the complex numbers.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129716512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fuzzy recognition of cricket batting strokes based on sequences of body and bat postures","authors":"M. Kelly, K. M. Curtis, M. Craven","doi":"10.1109/SECON.2003.1268444","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268444","url":null,"abstract":"A mathematical classification of two cricket batting strokes, using fuzzy set theory, is presented. A system is proposed, to capture the motion of a batsman/batswoman whilst playing a stroke. This is then compared to known strokes, provided by the classification and feedback is provided which outlines how well the selected stroke was played. This proposed expert system uses motion sensors in the classification process.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A transformation from an object database to an object relational database","authors":"K. Niyomthum, S. Chittayasothorn","doi":"10.1109/SECON.2003.1268424","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268424","url":null,"abstract":"Object databases and object relational databases are both widely used in industries. The major differences are mainly the level of encapsulation and the language supported by individual DBMSs. Object databases are fully encapsulated and allows only the use of methods to communicate with the objects. Object relational database, on the other hand allows the use of object-oriented SQL on open attributes. Both databases support the use of reference pointers and subtype hierarchies. Major software tools such as information warehouse software are now available commercially in the form of object relational representation. The purpose of this research project is to transform production-level systems on object database to object relational information warehouses.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122476968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Complex number representation in RCBNS form for arithmetic operations and conversion of the result into standard binary form","authors":"H. Zaini, R. G. Deshmukh","doi":"10.1109/SECON.2003.1268439","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268439","url":null,"abstract":"We introduce a novel method for complex number representation. The proposed, redundant complex binary number system (RCBNS) is developed by combining a redundant binary number and a complex number in base (-1+j). Donald (1960) and Walter Penny (1964, 1965) represented complex numbers using base -j and (-1+j) in the classified algorithmic models. A redundant complex binary number system consists of both real and imaginary-radix number systems that form a redundant integer digit set. This system is formed by using complex radix of (-1+j) and a digit set of /spl alpha/=3, where /spl alpha/ assumes a value of -3, -2, -1, 0, 1, 2, 3. The arithmetic operations of complex numbers with this system treat the real and imaginary parts as one unit. The carry-free addition has the advantage of redundancy in number representation in the arithmetic operations. Results of the arithmetic operations are in the RCBNS form. The two methods for conversion from the RCBNS form to the standard binary number form have been presented. The RCBNS reduces the number of steps required to perform complex number arithmetic operations, thus enhancing the speed.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128102205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A quality of service management scheme over GPRS","authors":"A. Kochem, E. Bodanese","doi":"10.1109/SECON.2003.1268433","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268433","url":null,"abstract":"A key problem in supporting applications like voice, video and data across wireless networks is managing their different requirements of quality of service (QoS) and the scarce shared bandwidth. QoS mechanisms can provide a differentiated treatment to applications running in different media. We present a QoS management scheme over general packet radio service (GPRS) networks by combining call admission control (CAC), radio resource reservation and scheduling. The simulation results show the effects of the proposed scheme on delay, delay variation and throughput of multimedia traffic while meeting the diversity of QoS requirements of an applications set.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127722486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A probabilistic multidimensional data model and algebra for OLAP in decision support systems","authors":"B. R. Moole","doi":"10.1109/SECON.2003.1268426","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268426","url":null,"abstract":"Although there are models defined for multidimensional data, they lack a comprehensive way to handle uncertain data. Uncertainty is pervasive over the real world and any model to represent real world data that ignores uncertainty imposes unacceptable limitations on the decision support systems in which it is used. No methods were proposed so far to incorporate uncertainty into multidimensional data models. We propose a probabilistic multidimensional data model and an associated algebra to handle uncertainty.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114443431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Functional verification of SMP, MPP, and vector-register supercomputers through controlled randomness","authors":"J. Wunderlich","doi":"10.1109/SECON.2003.1268440","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268440","url":null,"abstract":"Prototype supercomputer functionality can be verified by comparing simulated hardware execution with actual hardware test-program runs where each successive test-program run includes randomly changing machine-states, operating scenarios, and data. Increased verification is achieved through repeated program execution. In both multiprocessor and vector-register systems, a \"controlled randomness\" can be used to verify the functionality of simultaneously executing processors or functional units. We discuss the selection and combining of random number generators such that a \"degree-of-randomness\" between successive or parallel program runs is controlled. This allows computer engineers to simulate the execution of actual software (application or system-level) in which successive or parallel program runs may or may not involve uncorrelated tasks. Additionally, random number generators are selected to maximize execution speed and cycle-length, ensure reproducibility, and when desired, best produce a random source of numbers (i.e., to better approximate an independent, identically-distributed source). Generators can also be chosen for ease of implementation, the ability to run backwards, and the ability to split the generator's cycle into uncorrelated segments. \"Backward multipliers\" to allow generators to be run in reverse can also be easily found for some types of generators; reversibility is critical for functional verification so that code execution can be traced backwards to find scenarios that led to detected hardware failures. When generators are carefully selected and combined, the verification process can be optimized. By using this methodology, functional verification of SMP, MPP and vector-register supercomputers can be achieved.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124696690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributing incomplete trust in wireless ad hoc networks","authors":"C. Candolin, H. Kari","doi":"10.1109/SECON.2003.1268432","DOIUrl":"https://doi.org/10.1109/SECON.2003.1268432","url":null,"abstract":"The main objective is to present a method for distributing information regarding the trustworthiness of other nodes in the network. The process of managing incomplete trust in ad hoc networks is described. A protocol for distributing incomplete trust as rumors in an ad hoc network is described. The protocol is adapted to the CAM architecture, which is implemented in all network nodes. The CAM architecture provides the protocols and applications with an interface, through which they may store and retrieve values from a common database. The Rumor protocol thus uses this interface to retrieve trust values from the common database and broadcast them to the environment and to update trust values received from the environment.","PeriodicalId":241763,"journal":{"name":"IEEE SoutheastCon, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129630916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}