Engineering optimization problems usually contain multifaceted performance requirements that can be riddled with unquantifiable specifications and incompatible performance objectives. Such problems typically possess competing design requirements which are very difficult – if not impossible – to quantify and capture at the time of model formulation. There are invariably unmodelled design issues, not apparent at the time of model construction, which can greatly impact the acceptability of the model’s solutions. Consequently, when solving many “real life” mathematical programming applications, it is generally preferable to formulate several quantifiably good alternatives that provide very different perspectives to the problem. These alternatives should possess near-optimal objective measures with respect to all known modelled objective(s), but be fundamentally different from each other in terms of the system structures characterized by their decision variables. This solution approach is referred to as modelling-to-generate-alternatives (MGA). This study demonstrates how the nature-inspired, Firefly Algorithm can be used to concurrently create multiple solution alternatives that both satisfy required system performance criteria and yet are maximally different in their decision spaces. This new co-evolutionary approach is very computationally efficient, since it permits the concurrent generation of multiple, good solution alternatives in a single computational run rather than the multiple implementations required in previous MGA procedures.
{"title":"A Co-evolutionary, Nature-Inspired Algorithm for the Concurrent Generation of Alternatives","authors":"Raha Imanirad, Xin-She Yang, S. Yeomans","doi":"10.1037/e525192013-018","DOIUrl":"https://doi.org/10.1037/e525192013-018","url":null,"abstract":"Engineering optimization problems usually contain multifaceted performance requirements that can be riddled with unquantifiable specifications and incompatible performance objectives. Such problems typically possess competing design requirements which are very difficult – if not impossible – to quantify and capture at the time of model formulation. There are invariably unmodelled design issues, not apparent at the time of model construction, which can greatly impact the acceptability of the model’s solutions. Consequently, when solving many “real life” mathematical programming applications, it is generally preferable to formulate several quantifiably good alternatives that provide very different perspectives to the problem. These alternatives should possess near-optimal objective measures with respect to all known modelled objective(s), but be fundamentally different from each other in terms of the system structures characterized by their decision variables. This solution approach is referred to as modelling-to-generate-alternatives (MGA). This study demonstrates how the nature-inspired, Firefly Algorithm can be used to concurrently create multiple solution alternatives that both satisfy required system performance criteria and yet are maximally different in their decision spaces. This new co-evolutionary approach is very computationally efficient, since it permits the concurrent generation of multiple, good solution alternatives in a single computational run rather than the multiple implementations required in previous MGA procedures.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"180 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89070994","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}
Brain damage resulting from acquired brain injury is a leading cause of long term disability. The damage ranges from cognitive impairments such as attention, concentration, memory, and executive function deficits, to motor disabilities that can significantly affect survivors’ quality of life and limit their ability to perform everyday tasks. The use of serious games to augment cognitive and/or physical rehabilitation offers benefits that are not generally available in conventional rehabilitation methods. In this paper we discussed game design principles which are relevant to brain damage rehabilitation and presented several prototypes used for cognitive rehabilitation. We conducted a four-week study using these games in one of the Gaza, Palestine rehabilitation centers. The objective was to identify the potentials and requirements for using serious games as a solution to the conventional rehabilitation problems. Problems with conventional rehabilitation include boredom due to its repetitive nature and insufficiency due to limited human resources and facilities. We designed and evaluated our game prototypes and presented results which are the requirements of game-based therapeutic system or what makes games useful from a therapeutic view.
{"title":"Requirements for Game Based Cognitive Intervention System for Acquired Brain Injury","authors":"M. A. Elaklouk, N. Zin","doi":"10.1037/e525192013-006","DOIUrl":"https://doi.org/10.1037/e525192013-006","url":null,"abstract":"Brain damage resulting from acquired brain injury is a leading cause of long term disability. The damage ranges from cognitive impairments such as attention, concentration, memory, and executive function deficits, to motor disabilities that can significantly affect survivors’ quality of life and limit their ability to perform everyday tasks. The use of serious games to augment cognitive and/or physical rehabilitation offers benefits that are not generally available in conventional rehabilitation methods. In this paper we discussed game design principles which are relevant to brain damage rehabilitation and presented several prototypes used for cognitive rehabilitation. We conducted a four-week study using these games in one of the Gaza, Palestine rehabilitation centers. The objective was to identify the potentials and requirements for using serious games as a solution to the conventional rehabilitation problems. Problems with conventional rehabilitation include boredom due to its repetitive nature and insufficiency due to limited human resources and facilities. We designed and evaluated our game prototypes and presented results which are the requirements of game-based therapeutic system or what makes games useful from a therapeutic view.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89422715","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}
There exist different traditional methods which can help in aligning the entire ontology. The ontology can be aligned either with the comparison of matching two similar ontologies, or by comparing classes with the globally published class or the class which has been reused within the same ontology. However, traditional methods are ineffective as being dependent on either the attributes defined within the class or by checking their semantics and therefore providing attribute to segregate classes of same nature. We adopted the idea of Rely/Guarantee from distributed systems area, while proposed the same to align Ontology, which can actually align the class more efficiently, making the Ontology the effective one.
{"title":"Applying Rely/Guarantee in Compositional Ontology Alignment","authors":"S. Azzam, Shikun Zhou","doi":"10.1037/e525192013-017","DOIUrl":"https://doi.org/10.1037/e525192013-017","url":null,"abstract":"There exist different traditional methods which can help in aligning the entire ontology. The ontology can be aligned either with the comparison of matching two similar ontologies, or by comparing classes with the globally published class or the class which has been reused within the same ontology. However, traditional methods are ineffective as being dependent on either the attributes defined within the class or by checking their semantics and therefore providing attribute to segregate classes of same nature. We adopted the idea of Rely/Guarantee from distributed systems area, while proposed the same to align Ontology, which can actually align the class more efficiently, making the Ontology the effective one.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78790124","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}
Conventional smart antennas create flexible beam patterns using weights that have both magnitude and phase. This requires expensive hardware in the form of individual receivers and transmitters, high-speed D/A and A/D converters and capable DSP or FPGA processors. This paper looks at the use of low-complexity spatial antenna arrays that can create reasonably complex antenna patterns using a phased array approach. Convex optimization is applied to solve the highly non-linear optimization problem. Square array geometries were studied in depth by applying various penalty functions. We found that convex optimization is a novel and effective way to compute the complex antenna weights, and that this low-complexity approach is an interesting alternative to more expensive smart antennas
{"title":"Convex Optimization for Low-Complexity Spatial Antenna Arrays","authors":"S. Y. S. Bhamidipati, F. R. Kubichek","doi":"10.1037/e525192013-020","DOIUrl":"https://doi.org/10.1037/e525192013-020","url":null,"abstract":"Conventional smart antennas create flexible beam patterns using weights that have both magnitude and phase. This requires expensive hardware in the form of individual receivers and transmitters, high-speed D/A and A/D converters and capable DSP or FPGA processors. This paper looks at the use of low-complexity spatial antenna arrays that can create reasonably complex antenna patterns using a phased array approach. Convex optimization is applied to solve the highly non-linear optimization problem. Square array geometries were studied in depth by applying various penalty functions. We found that convex optimization is a novel and effective way to compute the complex antenna weights, and that this low-complexity approach is an interesting alternative to more expensive smart antennas","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"133 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76746649","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}
In project management, an important means to reduce risks is to provide adequate quantities of contingency reserve in terms of capital (fund), person, time (person hours), in the estimate of required project resources. Experienced project managers usually provide more accurate estimate of these quantities. The traditional project management methodologies, such as System Development Life Cycle (SDLC), were developed to handle software and information engineering projects of longer duration and larger number of project members. Many projects in modern days have short duration and smaller number of project members. They tend to follow newer methodologies, such as Agile Development, to adapt to the faster changes of modern technologies, processes, and user requirements. For a project manager, gathering information to properly create an effective project plan is like identifying a collection of problems and solving them. Solving problems needs supporting resources, which is analogous to the fact that projects need adequate supporting resources. This paper proposes an approach that applies combined efforts of the resource capabilities of project teams for planning and managing contingency reserves of a modern-day project in software or information engineering.
{"title":"Applying Combined Efforts of Resource Capability of Project Teams for Planning and Managing Contingency Reserves for Software and Information Engineering Projects","authors":"M. I. Peter H. Chang","doi":"10.1037/e525192013-022","DOIUrl":"https://doi.org/10.1037/e525192013-022","url":null,"abstract":"In project management, an important means to reduce risks is to provide adequate quantities of contingency reserve in terms of capital (fund), person, time (person hours), in the estimate of required project resources. Experienced project managers usually provide more accurate estimate of these quantities. The traditional project management methodologies, such as System Development Life Cycle (SDLC), were developed to handle software and information engineering projects of longer duration and larger number of project members. Many projects in modern days have short duration and smaller number of project members. They tend to follow newer methodologies, such as Agile Development, to adapt to the faster changes of modern technologies, processes, and user requirements. For a project manager, gathering information to properly create an effective project plan is like identifying a collection of problems and solving them. Solving problems needs supporting resources, which is analogous to the fact that projects need adequate supporting resources. This paper proposes an approach that applies combined efforts of the resource capabilities of project teams for planning and managing contingency reserves of a modern-day project in software or information engineering.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82839000","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}
Web browser has become a widely used platform for connecting and interacting people or organization with cyberspace. By using the web browser, we can share all the information, and now we can make transaction and pay our bills online. To users, they have to be careful when using internet and web browser to make all the transactions involved money as we know there are some vulnerabilities appear in web browser. This paper provides the discussion of the vulnerabilities appear in Firefox and Internet Explorer browser. It begins by providing an overview of web browser and describes what it is, how it is works, most popular web browser and common vulnerabilities found in web browser that can be used by hackers to attack the system. The paper then proposes some countermeasures to prevent the web browser from cyber attack.
{"title":"Preventing Web Browser From Cyber Attack","authors":"N. Awang, Arniyati Ahmad, Siti Rohaidah Ahmad","doi":"10.1037/e605222012-017","DOIUrl":"https://doi.org/10.1037/e605222012-017","url":null,"abstract":"Web browser has become a widely used platform for connecting and interacting people or organization with cyberspace. By using the web browser, we can share all the information, and now we can make transaction and pay our bills online. To users, they have to be careful when using internet and web browser to make all the transactions involved money as we know there are some vulnerabilities appear in web browser. This paper provides the discussion of the vulnerabilities appear in Firefox and Internet Explorer browser. It begins by providing an overview of web browser and describes what it is, how it is works, most popular web browser and common vulnerabilities found in web browser that can be used by hackers to attack the system. The paper then proposes some countermeasures to prevent the web browser from cyber attack.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80894180","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}
Smart homes of the future will have a number of different types of sensors. What types of sensors and how they will be used depends on the behaviour needed from the smart home. Using the sensors to automatically determine if a home is occupied can lead to a wide range of benefits. For example, it could trigger a change in the thermostat setting to save money, or even a change in security monitoring systems. Our prototype Home Occupancy Agent (HOA), which we present in this paper, uses a rule based system that monitors power consumption from meters and ambient light sensor readings in order to determine occupancy. The agent is also able to determine when the occupants are asleep, and thus provide the potential for further energy saving opportunities.
{"title":"Home Occupancy Agent: Occupancy and Sleep Detection","authors":"S. Makonin, F. Popowich","doi":"10.1037/e527372013-021","DOIUrl":"https://doi.org/10.1037/e527372013-021","url":null,"abstract":"Smart homes of the future will have a number of different types of sensors. What types of sensors and how they will be used depends on the behaviour needed from the smart home. Using the sensors to automatically determine if a home is occupied can lead to a wide range of benefits. For example, it could trigger a change in the thermostat setting to save money, or even a change in security monitoring systems. Our prototype Home Occupancy Agent (HOA), which we present in this paper, uses a rule based system that monitors power consumption from meters and ambient light sensor readings in order to determine occupancy. The agent is also able to determine when the occupants are asleep, and thus provide the potential for further energy saving opportunities.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81098056","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}
This paper presents two different approaches to provide an efficient multimedia interface for the visually challenged people. The first approach is the tree structured web contents, which integrates many different web pages into a single page. The second approach is the XML metadata for dynamically changing multimedia contents. This paper demonstrates how this combined approach of tree structure and metadata can help visually challenged users accessing multimedia data on the web.
{"title":"Accessibility of Website for Visually Challenged: Combined Tree Structure and XML Metadata","authors":"Young Lee, V. Rajasekar, Prawanth Reddy Kasula","doi":"10.1037/e527372013-003","DOIUrl":"https://doi.org/10.1037/e527372013-003","url":null,"abstract":"This paper presents two different approaches to provide an efficient multimedia interface for the visually challenged people. The first approach is the tree structured web contents, which integrates many different web pages into a single page. The second approach is the XML metadata for dynamically changing multimedia contents. This paper demonstrates how this combined approach of tree structure and metadata can help visually challenged users accessing multimedia data on the web.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75349633","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}
Ravonimanantsoa N.M, Randriamitantsoa A.A, R. T.E.
The use of VoIP is becoming more common in the world of the Internet Modeling of voice over IP at the server is an interesting work for future uses of this technology. The reason for this mathematical modeling is to forecast or predict the levels of bandwidth allocated for a number of user. While using different parameters assumed to be used according to their use in the server ie CPU, NIC, memory. The allocation of new parameters, such as the protocol and are used logiciles recently studied. In this paper, we propose a new mathematical model polynomial models to predict the use of the network interfaces using the SIP protocol. Our method aims to determine the number of clients possible for a mini VoIP server. It has several advantages such as the definition of a minimum required for the deployment of a VoIP family and also the limited number of clients using the server capacity. For our experiment we conducted a simulation of SIP call and deduce the mathematical model by interpolation. Voip,Sip,Asterisk,polynom
{"title":"Mathematical Modeling of The SIP Call","authors":"Ravonimanantsoa N.M, Randriamitantsoa A.A, R. T.E.","doi":"10.1037/e527372013-009","DOIUrl":"https://doi.org/10.1037/e527372013-009","url":null,"abstract":"The use of VoIP is becoming more common in the world of the Internet Modeling of voice over IP at the server is an interesting work for future uses of this technology. The reason for this mathematical modeling is to forecast or predict the levels of bandwidth allocated for a number of user. While using different parameters assumed to be used according to their use in the server ie CPU, NIC, memory. The allocation of new parameters, such as the protocol and are used logiciles recently studied. In this paper, we propose a new mathematical model polynomial models to predict the use of the network interfaces using the SIP protocol. Our method aims to determine the number of clients possible for a mini VoIP server. It has several advantages such as the definition of a minimum required for the deployment of a VoIP family and also the limited number of clients using the server capacity. For our experiment we conducted a simulation of SIP call and deduce the mathematical model by interpolation. Voip,Sip,Asterisk,polynom","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"128 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79636947","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}
J. Brandão, Alessandra Martins Coelho, F. Carmo, João Flávio Vasconcelos
This paper presents the application of new costs for one recent approach, called SingleGA, in solving One-Dimensional cutting stock problem. The cutting problem basically consists in finding the best way to obtain parts of distinct sizes (items) from the cutting of larger parts (objects) with the purpose of minimizing a specific cost or maximizing the profit. The obtained results of SingleGA are compared to the following methods: SHP, Kombi234, ANLCP300 and Symbio, found in literature, verifying its capacity to find feasible and competitive solutions. The computational results show that variations of SingleGA posses good results, improving as setup cost increases.
{"title":"Study of different setup costs in SingleGA to solve a one-dimensional cutting stock problem","authors":"J. Brandão, Alessandra Martins Coelho, F. Carmo, João Flávio Vasconcelos","doi":"10.1037/e527372013-002","DOIUrl":"https://doi.org/10.1037/e527372013-002","url":null,"abstract":"This paper presents the application of new costs for one recent approach, called SingleGA, in solving One-Dimensional cutting stock problem. The cutting problem basically consists in finding the best way to obtain parts of distinct sizes (items) from the cutting of larger parts (objects) with the purpose of minimizing a specific cost or maximizing the profit. The obtained results of SingleGA are compared to the following methods: SHP, Kombi234, ANLCP300 and Symbio, found in literature, verifying its capacity to find feasible and competitive solutions. The computational results show that variations of SingleGA posses good results, improving as setup cost increases.","PeriodicalId":91079,"journal":{"name":"GSTF international journal on computing","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84043885","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：