<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>vol. 09, no. 01</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/394" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/394</id>
<updated>2013-05-21T20:54:50Z</updated>
<dc:date>2013-05-21T20:54:50Z</dc:date>
<entry>
<title>Software network analyzer for computer network performance measurement  planning over heterogeneous services in higher educational institutes</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9649" rel="alternate"/>
<author>
<name>Ismail, Mohd Nazri</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9649</id>
<updated>2013-04-16T20:26:41Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 9, no. 1
In 21st century, convergences of technologies and services in heterogeneous environment have contributed multi-traffic. This scenario will affect computer network on learning system in higher educational Institutes. Implementation of various services can produce different types of content and quality. Higher educational institutes should have a good computer network infrastructure to support usage of various services. The ability of computer network should consist of i) higher bandwidth; ii) proper network design; and iii) higher performance of communication devices/servers. Thus, presently there is no software to plan and help network administrator in determine ability of network services during introduce a new service. Current approach using by network administrators are planning computer network performance via prediction and measure ability of real network performance using hardware/software network analyzer. This approach can influence several problems such as prediction without software always inaccurate and most of the software/hardware network analyzer in real network is limited by network interfaces. Therefore, to encounter these problems, network administrators need software that can plan and measure additional network resources. Thus, this study presents a novel approach for measurement and planning network performance management in heterogeneous environment. The main objectives of this research is to i) identify which approach and problem occurs in Malaysia higher educational institutes; ii) create simulation model that able to plan and measure network performance for various services; iii) software network analyzer development based on simulation model design; and iv) conduct an evaluation of simulation model and software development with real network. These objectives can achieve as follows: i) conduct a survey; ii) select appropriate mathematical formula to create simulation model; iii) select appropriate modeling application for software development; and iv) conduct verification and validation technique for simulation modeling and evaluation of software network analyzer . The results from survey show that most of the network administrators are using hardware/software network analyzer to measure network performance during operational phase. The minimum size of bandwidth capacity has contributed higher network utilization usage. It can generate network congestion and network service failure in higher educational institutes. We create suitable models to evaluate the network performance using Little Law and Queuing theory that can represent similar to hardware/software network analyzer. In order to get accuracy results on the performance of simulation model, we measure (verify and validate) data from lab experiment and real network environment. Development of software network analyzer is based on simulation model architecture. This software will undergo evaluation process using qualitative technique. As a result, this software prototyping can provide a good approximation of real functionality observed in the real network environment. In addition the software is capable of approximating the performance within a minimum error rate. This software network analyzer can significantly enhance to analyze and propose solution on computer network performance. Future work is to develop software network analyzer for planning, suggestion and analyzing computer network performance on wireless transmission (WLAN, WWAN and WiMax) and Ipv6 protocol. We investigate how preparation and planning phases can be applied to heterogeneous environment in order to better utilize network resources. Our software network analyzer prototyping development is based on Fluke Optiview Network Analyzer. Before we develop any software prototype, it should define the following criteria: i) establish prototype objectives; ii) define prototype functionality; iii) develop prototype; and iv) evaluate prototype. Software network analyzer prototype consists of two phases: analyzing computer network performance under optimum condition and without optimum condition. Software network analyzer prototype was developed to measure and predict network activities based on offline condition. We use qualitative technique to measure our software network analyzer prototype to identify this software is able to plan, propose and analyze computer network performance. Evaluation of software network analyzer prototype is based on focus groups in University of Kuala Lumpur (UniKL). Six evaluators are experienced in education and industrial sector will select to complete the survey and interview task. Three evaluators will select who are experienced in industrial sector only, while, another three evaluators experienced in academic and industrial sector. All evaluators have experienced more than 6 to 13 years in network management field. All evaluators need to complete the following task such as: acceptance test, performance test, loading test, network responsive test and repetition test. A common strategy is to design, test, evaluate and then modify the design based on analysis of the prototype.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>In 21st century, convergences of technologies and services in heterogeneous environment have contributed multi-traffic. This scenario will affect computer network on learning system in higher educational Institutes. Implementation of various services can produce different types of content and quality. Higher educational institutes should have a good computer network infrastructure to support usage of various services. The ability of computer network should consist of i) higher bandwidth; ii) proper network design; and iii) higher performance of communication devices/servers. Thus, presently there is no software to plan and help network administrator in determine ability of network services during introduce a new service. Current approach using by network administrators are planning computer network performance via prediction and measure ability of real network performance using hardware/software network analyzer. This approach can influence several problems such as prediction without software always inaccurate and most of the software/hardware network analyzer in real network is limited by network interfaces. Therefore, to encounter these problems, network administrators need software that can plan and measure additional network resources. Thus, this study presents a novel approach for measurement and planning network performance management in heterogeneous environment. The main objectives of this research is to i) identify which approach and problem occurs in Malaysia higher educational institutes; ii) create simulation model that able to plan and measure network performance for various services; iii) software network analyzer development based on simulation model design; and iv) conduct an evaluation of simulation model and software development with real network. These objectives can achieve as follows: i) conduct a survey; ii) select appropriate mathematical formula to create simulation model; iii) select appropriate modeling application for software development; and iv) conduct verification and validation technique for simulation modeling and evaluation of software network analyzer . The results from survey show that most of the network administrators are using hardware/software network analyzer to measure network performance during operational phase. The minimum size of bandwidth capacity has contributed higher network utilization usage. It can generate network congestion and network service failure in higher educational institutes. We create suitable models to evaluate the network performance using Little Law and Queuing theory that can represent similar to hardware/software network analyzer. In order to get accuracy results on the performance of simulation model, we measure (verify and validate) data from lab experiment and real network environment. Development of software network analyzer is based on simulation model architecture. This software will undergo evaluation process using qualitative technique. As a result, this software prototyping can provide a good approximation of real functionality observed in the real network environment. In addition the software is capable of approximating the performance within a minimum error rate. This software network analyzer can significantly enhance to analyze and propose solution on computer network performance. Future work is to develop software network analyzer for planning, suggestion and analyzing computer network performance on wireless transmission (WLAN, WWAN and WiMax) and Ipv6 protocol. We investigate how preparation and planning phases can be applied to heterogeneous environment in order to better utilize network resources. Our software network analyzer prototyping development is based on Fluke Optiview Network Analyzer. Before we develop any software prototype, it should define the following criteria: i) establish prototype objectives; ii) define prototype functionality; iii) develop prototype; and iv) evaluate prototype. Software network analyzer prototype consists of two phases: analyzing computer network performance under optimum condition and without optimum condition. Software network analyzer prototype was developed to measure and predict network activities based on offline condition. We use qualitative technique to measure our software network analyzer prototype to identify this software is able to plan, propose and analyze computer network performance. Evaluation of software network analyzer prototype is based on focus groups in University of Kuala Lumpur (UniKL). Six evaluators are experienced in education and industrial sector will select to complete the survey and interview task. Three evaluators will select who are experienced in industrial sector only, while, another three evaluators experienced in academic and industrial sector. All evaluators have experienced more than 6 to 13 years in network management field. All evaluators need to complete the following task such as: acceptance test, performance test, loading test, network responsive test and repetition test. A common strategy is to design, test, evaluate and then modify the design based on analysis of the prototype.</dc:description>
</entry>
<entry>
<title>Constraint-Handling in Evolutionary Optimization Efrén Mezura-Montes (Editor) Springer, Studies in Computational Intelligence Series Vol. 198, 1st Edition, 2009</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9648" rel="alternate"/>
<author>
<name>Mezura-Montes, Efrén</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9648</id>
<updated>2013-04-10T20:33:24Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 9, no. 1
The use of evolutionary and swarm intelligence algorithms, has become a very popular option to solve complex real-world optimization problems. However, in their original versions, these algorithms lack a mechanism to handle the constraints of the problem i.e. they were designed to deal with unconstrained search spaces. Therefore, the design of constraint-handling mechanism is nowadays considered a research area within natureinspired computation for optimization.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>The use of evolutionary and swarm intelligence algorithms, has become a very popular option to solve complex real-world optimization problems. However, in their original versions, these algorithms lack a mechanism to handle the constraints of the problem i.e. they were designed to deal with unconstrained search spaces. Therefore, the design of constraint-handling mechanism is nowadays considered a research area within natureinspired computation for optimization.</dc:description>
</entry>
<entry>
<title>Measuring the component of a divide and conquer skeleton</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9647" rel="alternate"/>
<author>
<name>Printista, Alicia Marcela</name>
</author>
<author>
<name>Saez, Fernando</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9647</id>
<updated>2012-05-08T22:00:36Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 1
Current performance prediction analytical models try to characterize the performance behavior of actual machines through a small set of parameters. Due to different factors, the predicted times suffer substantial deviations. A natural approach is to associate a different proportionality constant with each basic block of computation. In particular, the paper deals with a skeleton designed for parallel divide and conquer algorithms that provide hypercubical communications among processes. Our proposal is to introduce different kinds of components to the analytical model by associating a performance constant for each conceptual block of a skeleton. The trace files obtained from the execution of the resulting code using the programming skeleton are used by lineal regression techniques giving us, among other information, the values of the parameters of those blocks. The accuracy of the proposed model is analyzed by means of two instances of skeleton.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>Current performance prediction analytical models try to characterize the performance behavior of actual machines through a small set of parameters. Due to different factors, the predicted times suffer substantial deviations. A natural approach is to associate a different proportionality constant with each basic block of computation. In particular, the paper deals with a skeleton designed for parallel divide and conquer algorithms that provide hypercubical communications among processes. Our proposal is to introduce different kinds of components to the analytical model by associating a performance constant for each conceptual block of a skeleton. The trace files obtained from the execution of the resulting code using the programming skeleton are used by lineal regression techniques giving us, among other information, the values of the parameters of those blocks. The accuracy of the proposed model is analyzed by means of two instances of skeleton.</dc:description>
</entry>
<entry>
<title>Optimized cost effective approach for selection of materialized views in data warehousing</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9646" rel="alternate"/>
<author>
<name>Ashadevi, B.</name>
</author>
<author>
<name>Balasubramanian, R</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9646</id>
<updated>2012-05-08T22:00:36Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 1
A data warehouse efficiently processes a given set of queries by utilizing the multiple materialized views. Owing to the constraint on space and maintenance cost, the materialization of all views is unfeasible. One of the critical decisions involved in the process of designing a data warehouse for optimal efficiency, is the materialized views selection. The primary goal of data warehousing is to select a suitable set of views that minimizes the total cost associated with the materialized views. In this paper, we have presented a framework, an optimized version of our previous work, for the selection of views to materialize, for a given storage space constraints, which intends to achieve the best combination of good query response, low query processing cost and low view maintenance cost. All the cost metrics associated with the materialized views selection that comprise the query execution frequencies, base-relation update frequencies, query access costs, view maintenance costs and the system's storage space constraints are considered by this framework. This framework optimizes the maintenance, storage and query processing cost as it selects the most cost effective views to materialize. Thus, an efficient data warehousing system is the outcome.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>A data warehouse efficiently processes a given set of queries by utilizing the multiple materialized views. Owing to the constraint on space and maintenance cost, the materialization of all views is unfeasible. One of the critical decisions involved in the process of designing a data warehouse for optimal efficiency, is the materialized views selection. The primary goal of data warehousing is to select a suitable set of views that minimizes the total cost associated with the materialized views. In this paper, we have presented a framework, an optimized version of our previous work, for the selection of views to materialize, for a given storage space constraints, which intends to achieve the best combination of good query response, low query processing cost and low view maintenance cost. All the cost metrics associated with the materialized views selection that comprise the query execution frequencies, base-relation update frequencies, query access costs, view maintenance costs and the system's storage space constraints are considered by this framework. This framework optimizes the maintenance, storage and query processing cost as it selects the most cost effective views to materialize. Thus, an efficient data warehousing system is the outcome.</dc:description>
</entry>
<entry>
<title>Two fuzziness indexes proposed by Kaufmann: observations about them</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9645" rel="alternate"/>
<author>
<name>Sierra Duque, Carlos M.</name>
</author>
<author>
<name>Álvarez, Hernán</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9645</id>
<updated>2012-05-08T22:00:37Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 1
Professor Arnold Kaufmann did propose&#13;
at least two types of indexes for estimating fuzziness in&#13;
finite standard fuzzy sets. First one has an analogue&#13;
formulation to that stated by Claude Shannon for&#13;
measuring uncertainty in a given system. Shannon&#13;
formulation estimates one type of uncertainty classified&#13;
as conflict. The present paper will reveal the&#13;
inconvenience of such an index for measuring fuzziness&#13;
phenomena. In addition, it is proved algebraic&#13;
equivalence between another index posed by&#13;
Kaufmann and a fuzziness index proposed by Ronald&#13;
Yager.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>Professor Arnold Kaufmann did propose&#13;
at least two types of indexes for estimating fuzziness in&#13;
finite standard fuzzy sets. First one has an analogue&#13;
formulation to that stated by Claude Shannon for&#13;
measuring uncertainty in a given system. Shannon&#13;
formulation estimates one type of uncertainty classified&#13;
as conflict. The present paper will reveal the&#13;
inconvenience of such an index for measuring fuzziness&#13;
phenomena. In addition, it is proved algebraic&#13;
equivalence between another index posed by&#13;
Kaufmann and a fuzziness index proposed by Ronald&#13;
Yager.</dc:description>
</entry>
<entry>
<title>E711 - A public emergency wireless phone system</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9644" rel="alternate"/>
<author>
<name>Matos, Victor</name>
</author>
<author>
<name>Blake, Ben</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9644</id>
<updated>2012-05-08T22:00:37Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 1
This paper introduces the conceptual design of a new information technology integrating wireless telephony and Internet services to assist in locating lost or displaced people in a moment of crisis. This public safety service is based on a novel text messaging mobile-phone emergency service called "E711" which informs that the caller is safe and well. The proposed E711 messages are delivered as guaranteed SMS packets to a centralized web emergency registry operated by a public safety organization. Finding the whereabouts of a victim could be done by consulting the entries of this registry. The public could access the emergency database in a variety of ways including Internet searches and phone calls. Optionally, non-guarantee E711 SMS messages are forwarded to family and friends. We provide an algorithm to automatically recognize critical flow changes of E711 packets and dynamically adapt congested network gateways for optimum delivery. We argue that in case of high network traffic, the E711 system has a better chance of success than voice services such as E911 or person-to-person communication.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>This paper introduces the conceptual design of a new information technology integrating wireless telephony and Internet services to assist in locating lost or displaced people in a moment of crisis. This public safety service is based on a novel text messaging mobile-phone emergency service called "E711" which informs that the caller is safe and well. The proposed E711 messages are delivered as guaranteed SMS packets to a centralized web emergency registry operated by a public safety organization. Finding the whereabouts of a victim could be done by consulting the entries of this registry. The public could access the emergency database in a variety of ways including Internet searches and phone calls. Optionally, non-guarantee E711 SMS messages are forwarded to family and friends. We provide an algorithm to automatically recognize critical flow changes of E711 packets and dynamically adapt congested network gateways for optimum delivery. We argue that in case of high network traffic, the E711 system has a better chance of success than voice services such as E911 or person-to-person communication.</dc:description>
</entry>
<entry>
<title>An economic view of indirect reputation management for grids</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9643" rel="alternate"/>
<author>
<name>Echaiz, Javier</name>
</author>
<author>
<name>Ardenghi, Jorge Raúl</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9643</id>
<updated>2012-05-08T22:00:37Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 1
Scientific collaboration are becoming interdisciplinary, and scientists are working in informal collaboration to solve complex problems that require multiple types of large resources. An option is a computational grid. A computational grid is a distributed infrastructure that appears to the end user as one large computing resource across organization boundaries. Grid technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or institutions, usually called virtual organizations. In these settings, the discovery, characterization, management, and monitoring of resources, services, and computations can be challenging due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Trust is one of the biggest concerns in the grid resource management field. Grid systems can employ reputation mechanisms in order to provide this essential trust, but not usually without incurring in certain additional costs that negate the potential performance gains offered by grid computing technologies. Moreover, current reputation mechanisms are not appropriate for resource management in large-scale systems (generally used in P2P). In this paper, we present a new reputation model for resource management based on a economy model. Also we demonstrate how it can by employed to add trust into algorithms for grid scheduling. Finally, we simulate the proposed resource management algorithm in order to verify its effectiveness.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
<dc:description>Scientific collaboration are becoming interdisciplinary, and scientists are working in informal collaboration to solve complex problems that require multiple types of large resources. An option is a computational grid. A computational grid is a distributed infrastructure that appears to the end user as one large computing resource across organization boundaries. Grid technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or institutions, usually called virtual organizations. In these settings, the discovery, characterization, management, and monitoring of resources, services, and computations can be challenging due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Trust is one of the biggest concerns in the grid resource management field. Grid systems can employ reputation mechanisms in order to provide this essential trust, but not usually without incurring in certain additional costs that negate the potential performance gains offered by grid computing technologies. Moreover, current reputation mechanisms are not appropriate for resource management in large-scale systems (generally used in P2P). In this paper, we present a new reputation model for resource management based on a economy model. Also we demonstrate how it can by employed to add trust into algorithms for grid scheduling. Finally, we simulate the proposed resource management algorithm in order to verify its effectiveness.</dc:description>
</entry>
</feed>
