Menu
SOFTWARE TESTING AND DOCUMENTING AUTOMATION
By: Anton Tsybin, Lyudmila Lyadova  (3419 reads)
Rating: (1.00/10)

Abstract: This article describes some approaches to problem of testing and documenting automation in information systems with graphical user interface. Combination of data mining methods and theory of finite state machines is used for testing automation. Automated creation of software documentation is based on using metadata in documented system. Metadata is built on graph model. Described approaches improve performance and quality of testing and documenting processes.

Keywords: software testing, documenting automation, data mining, dynamic grammar, metadata.

ACM Classification Keywords: D.2 Software Engineering: D.2.2 Design Tools and Techniques; D.2.4 Software - Program Verification; I.2 Artificial Intelligence: I.2.2 Automatic Programming.

Link:

SOFTWARE TESTING AND DOCUMENTING AUTOMATION

Anton Tsybin, Lyudmila Lyadova

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-3-p11.pdf

COMPLEX PROTECTION SYSTEM OF METADATA-BASED DISTRIBUTED
By: Denis Kourilov, Lyudmila Lyadova  (3255 reads)
Rating: (1.00/10)

Abstract: A description of architecture and approaches to the implementation of a protection system of metadatabased adaptable information systems is suggested. Various protection means are examined. The system described is a multilevel complex based on a multiagent system combining IDS functional abilities with structure and logics protection means.

Keywords: adaptable information systems, protection mechanisms, metadata, multiagent systems.

ACM Classification Keywords: D.2 Software Engineering: D.2.0 General − Protection mechanisms; K.6 Management of Computing and Information Systems: K.6.5 Security and Protection − Authentication, Insurance, Invasive software (e.g., viruses, worms, Trojan horses), Unauthorized access (e.g., hacking, phreaking); I.2 Artificial Intelligence: I.2.11 Distributed Artificial Intelligence − Multiagent systems.

Link:

COMPLEX PROTECTION SYSTEM OF METADATA-BASED DISTRIBUTED INFORMATION SYSTEMS

Denis Kourilov, Lyudmila Lyadova

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p03.pdf

DESIGN STANDARDIZED WEB-COMPONENTS FOR E-LEARNING
By: Andrey Belonogov  (3248 reads)
Rating: (1.00/10)

Abstract: In this paper a flexible approach to design LMS with QTI Ready component based on the e-Learning standards AICC and IMS QTI is described. This system and component permits a dynamic learning and assessment process. QTI Ready component can provide these facilities to other real world virtual learning management system.

Keywords: Web-based education, e-Learning technologies, metadata schemes, standardization and open standards, Servlet technology.

ACM Classification Keywords: D.2 Software engineering – Standards: D.2.11 Software Architectures - Patterns (e.g., client/server, pipeline, blackboard); H.3.5 Online Information Services - Web-based services

Link:

DESIGN STANDARDIZED WEB-COMPONENTS FOR E-LEARNING

Andrey Belonogov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-3-p16.pdf

ACCESS RIGHTS INHERITANCE IN INFORMATION SYSTEMS CONTROLLED BY METADATA
By: Mariya Chichagova, Ludmila Lyadova  (3095 reads)
Rating: (1.00/10)

Abstract: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system’s protection becomes more difficult. One of the most difficult problems is access rights assignment. This paper describes the graph model of access rights inheritance. This model takes into account relations and dependences between different objects and between different users. The model can be implemented in the information systems controlled by the metadata, describing information objects and connections between them, such as the systems based on CASE-technology METAS.

Keywords: access control mechanisms, graph model, metadata, CASE-technology.

ACM Classification Keywords: D.2 Software engineering: D.2.0 General - Protection mechanisms.

Link:

ACCESS RIGHTS INHERITANCE IN INFORMATION SYSTEMS CONTROLLED BY METADATA

Mariya Chichagova, Ludmila Lyadova

http://www.foibg.com/ijita/vol14/ijita14-2-p13.pdf

A SENSITIVE METRIC OF CLASS COHESION
By: Luis Fernández, Rosalía Peña  (5857 reads)
Rating: (1.00/10)

Abstract: Metrics estimate the quality of different aspects of software. In particular, cohesion indicates how well the parts of a system hold together. A metric to evaluate class cohesion is important in object-oriented programming because it gives an indication of a good design of classes. There are several proposals of metrics for class cohesion but they have several problems (for instance, low discrimination). In this paper, a new metric to evaluate class cohesion is proposed, called SCOM, which has several relevant features. It has an intuitive and analytical formulation, what is necessary to apply it to large-size software systems. It is normalized to produce values in the range 0..1, thus yielding meaningful values. It is also more sensitive than those previously reported in the literature. The attributes and methods used to evaluate SCOM are unambiguously stated. SCOM has an analytical threshold, which is a very useful but rare feature in software metrics. We assess the metric with several sample cases, showing that it gives more sensitive values than other well know cohesion metrics.

Keywords: Object-Oriented? Programming, Metrics/Measurement, Quality analysis and Evaluation.

ACM Classification Keywords: D.1.5 Object-oriented Programming; D.2.8 Metrics

Link:

A SENSITIVE METRIC OF CLASS COHESION

Luis Fernández, Rosalía Peña

http://www.foibg.com/ijita/vol13/ijita13-1-p11.pdf

METADATA AND GEOSPATIAL DATA PROCESSING ON THE BASE OF XML AND GRID
By: Shelestov et al.  (2994 reads)
Rating: (1.00/10)

Abstract: The software architecture and development consideration for open metadata extraction and processing framework are outlined. Special attention is paid to the aspects of reliability and fault tolerance. Grid infrastructure is shown as useful backend for general-purpose task.

Keywords: Metadata, ISO19115, Grid computing, Globus Toolkit, XML.

ACM Classification Keywords: D.1.3 Concurrent Programming – Distributed programming, D.2.3 Coding Tools and Techniques – Object-oriented programming, D.2.5 Testing and Debugging – Error handling and recovery, D.2.0 General – Standards.

Link:

METADATA AND GEOSPATIAL DATA PROCESSING ON THE BASE OF XML AND GRID

Andrii Shelestov, Mykhailo Korbakov, Mykhaylo Zynovyev

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-3-p08.pdf

RESEARCHING FRAMEWORK FOR SIMULATING/IMPLEMENTATING P SYSTEMS
By: Gómez et al.  (3195 reads)
Rating: (1.00/10)

Abstract: Researching simulation/implementation of membranes systems is very recent. Present literature gathers new publications frequently about software/hardware, data structures and algorithms for implementing P system evolution. In this context, this work presents a framework which goal is to make tasks of researchers of this field easier. Hence, it establishes the set of cooperating classes that form a reusable and flexible design for the customizable evaluation with new data structures and algorithms. Moreover, it includes customizable services for correcting, monitoring and logging the evolution and edition, recovering, automatic generating, persistence and visualizing P systems.

Keywords: P System, framework, simulation, implementation.

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

RESEARCHING FRAMEWORK FOR SIMULATING/IMPLEMENTATING P SYSTEMS

Sandra Gómez, Luis Fernández, Iván García, Fernando Arroyo

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p12.pdf

DELIMITED MASSIVELY PARALLEL ALGORITHM BASED ON RULES ELIMINATION
By: Gil et al.  (3227 reads)
Rating: (1.00/10)

Abstract: In the field of Transition P systems implementation, it has been determined that it is very important to determine in advance how long takes evolution rules application in membranes. Moreover, to have time estimations of rules application in membranes makes possible to take important decisions related to hardware / software architectures design. The work presented here introduces an algorithm for applying active evolution rules in Transition P systems, which is based on active rules elimination. The algorithm complies the requisites of being nondeterministic, massively parallel, and what is more important, it is time delimited because it is only dependant on the number of membrane evolution rules.

Keywords: Natural computing, Membrane computing, Transition P systems, rules application algorithms

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

DELIMITED MASSIVELY PARALLEL ALGORITHM BASED ON RULES ELIMINATION FOR APPLICATION OF ACTIVE RULES IN TRANSITION P SYSTEMS

Francisco Javier Gil, Luis Fernández, Fernando Arroyo, Jorge Tejedor

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p11.pdf

A CIRCUIT IMPLEMENTING MASSIVE PARALLELISM IN TRANSITION P SYSTEMS
By: Alonso et al.  (3398 reads)
Rating: (1.00/10)

Abstract: Transition P-systems are based on biological membranes and try to emulate cell behavior and its evolution due to the presence of chemical elements. These systems perform computation through transition between two consecutive configurations, which consist in a m-tuple of multisets present at any moment in the existing m regions of the system. Transition between two configurations is performed by using evolution rules also present in each region. Among main Transition P-systems characteristics are massive parallelism and non determinism. This work is part of a very large project and tries to determine the design of a hardware circuit that can improve remarkably the process involved in the evolution of a membrane. Process in biological cells has two different levels of parallelism: the first one, obviously, is the evolution of each cell inside the whole set, and the second one is the application of the rules inside one membrane. This paper presents an evolution of the work done previously and includes an improvement that uses massive parallelism to do transition between two states. To achieve this, the initial set of rules is transformed into a new set that consists in all their possible combinations, and each of them is treated like a new rule (participant antecedents are added to generate a new multiset), converting an unique rule application in a way of parallelism in the means that several rules are applied at the same time. In this paper, we present a circuit that is able to process this kind of rules and to decode the result, taking advantage of all the potential that hardware has to implement P Systems versus previously proposed sequential solutions.

Keywords: Transition P System, membrane computing, circuit design.

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

A CIRCUIT IMPLEMENTING MASSIVE PARALLELISM IN TRANSITION P SYSTEMS

Santiago Alonso, Luis Fernández, Fernando Arroyo, Javier Gil

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p08.pdf

A HIERARCHICAL ARCHITECTURE WITH PARALLEL COMUNICATION ...
By: Bravo et al.  (3210 reads)
Rating: (1.00/10)

Abstract: Membrane systems are computational equivalent to Turing machines. However, its distributed and massively parallel nature obtain polynomial solutions opposite to traditional non-polynomial ones. Nowadays, developed investigation for implementing membrane systems has not yet reached the massively parallel character of this computational model. Better published approaches have achieved a distributed architecture denominated “partially parallel evolution with partially parallel communication” where several membranes are allocated at each processor, proxys are used to communicate with membranes allocated at different processors and a policy of access control to the communications is mandatory. With these approaches, it is obtained processors parallelism in the application of evolution rules and in the internal communication among membranes allocated inside each processor. Even though, external communications share a common communication line, needed for the communication among membranes arranged in different processors, are sequential. In this work, we present a new hierarchical architecture that reaches external communication parallelism among processors and substantially increases parallelization in the application of evolution rules and internal communications. Consequently, necessary time for each evolution step is reduced. With all of that, this new distributed hierarchical architecture is near to the massively parallel character required by the model.

Keywords: Architecture, hierarchy, P systems

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

A HIERARCHICAL ARCHITECTURE WITH PARALLEL COMUNICATION FOR IMPLEMENTING P SYSTEMS

Ginés Bravo, Luis Fernández , Fernando Arroyo, Juan A. Frutos

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p09.pdf

ADVERGAMES: OVERVIEW
By: Santos et al.  (3278 reads)
Rating: (1.00/10)

Abstract: Advergame is a new marketing concept that has appeared due to the fact that young people are always connected to the Internet, are using mobile services such as SMS and MMS, or are chatting with instant messenger services and they spend too much time just playing in a stand alone way or in a network game. A new revolutionary service is the advergame one; that is a game with advertisment capabilities. Any company can develop an advergame that is, a game with some kind of advertising process of this company. This paper introduces some idea and concepts when developping an advergame..

Keywords: Advergames, Mobile Computing, Games Development.

ACM Classification Keywords: D.1.m Miscellaneous.

Link:

ADVERGAMES: OVERVIEW

Eugenio Santos, Rafael Gonzalo, Francisco Gisbert

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-3-p01.pdf

HW IMPLEMENTATION OF A OPTIMIZED ALGORITHM FOR THE APPLICATION ...
By: Martinez et al.  (3749 reads)
Rating: (1.00/10)

Abstract: P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.

Keywords: Membrane Computing, Evolution Rules, Circuit design, Digital systems, Transition P System.

ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing

Link:

HW IMPLEMENTATION OF A OPTIMIZED ALGORITHM FOR THE APPLICATION OF ACTIVE RULES IN A TRANSITION P-SYSTEM

Victor Martinez, Luis Fernandez, Fernando Arroyo, Abraham Gutierrez

http://www.foibg.com/ijita/vol14/ijita14-4-p04.pdf

PROGRAMMING PARADIGMS IN COMPUTER SCIENCE EDUCATION
By: Elena Bolshakova  (3300 reads)
Rating: (1.00/10)

Abstract: Main styles, or paradigms of programming – imperative, functional, logic, and object-oriented – are shortly described and compared, and corresponding programming techniques are outlined. Programming languages are classified in accordance with the main style and techniques supported. It is argued that profound education in computer science should include learning base programming techniques of all main programming paradigms.

Keywords: programming styles, paradigms of programming, programming techniques, integration of programming techniques, learning programming paradigms

ACM Classification Keywords: D.1 Programming Techniques – Functional Programming, Logic Programming, Object-oriented Programming

Link:

PROGRAMMING PARADIGMS IN COMPUTER SCIENCE EDUCATION

Elena Bolshakova

http://www.foibg.com/ijita/vol12/ijita12-3-p13.pdf

SCIT — UKRAINIAN SUPERCOMPUTER PROJECT
By: Koval et al.  (2914 reads)
Rating: (1.00/10)

Abstract: The paper describes a first supercomputer cluster project in Ukraine, its hardware, software and characteristics. The paper shows the performance results received on systems that were built. There are also shortly described software packages made by cluster users that have already made a return of investments into a cluster project.

Keywords: supercomputer, cluster, computer structure.

ACM Classification Keywords: C.5.1 Super computers, C.1.4 Parallel Architectures.

Link:

SCIT — UKRAINIAN SUPERCOMPUTER PROJECT

Valeriy Koval, Sergey Ryabchun, Volodymyr Savyak, Ivan Sergienko, Anatoliy Yakuba

http://www.foibg.com/ijita/vol12/ijita12-1-p09.pdf

A PRACTICAL CASE OF SOFTWARE LOCALIZATION ...
By: Cardenosa et al.  (3174 reads)
Rating: (1.00/10)

Abstract: Internationalization of software as a previous step for localization is usually taken into account during early phases of the life-cycle of software development. However, the need to adapt software applications into different languages and cultural settings can appear once the application is finished and even in the market. In these cases, software localization implies a high cost of time and resources. This paper shows a real case of a existent software application, designed and developed without taking into account future necessities of localization, whose architecture and source code were modified to include the possibility of straightforward adaptation into new languages. The use of standard languages and advanced programming languages has permitted the authors to adapt the software in a simple and straightforward mode.

Keywords: Localization, Internationalization, XML.

ACM Classification Keywords: D. Software, D.2.7 Distribution, Maintenance and Enhancement

Link:

A PRACTICAL CASE OF SOFTWARE LOCALIZATION AFTER SYSTEM DEVELOPMENT1

Jesus Cardenosa, Carolina Gallardo, Alvaro Martin

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-2-p04.pdf

VOIP TRAFFIC SHAPING ANALYSES IN METROPOLITAN AREA NETWORKS
By: Goleva et al.  (3929 reads)
Rating: (1.00/10)

Abstract: This paper represents VoIP shaping analyses in devices that apply the three Quality of Service techniques – IntServ?, DiffServ? and RSVP. The results show queue management and packet stream shaping based on simulation of the three mostly demanded services – VoIP, LAN emulation and transaction exchange. Special attention is paid to the VoIP as the most demanding service for real time communication.

Keywords: Packet network, IP, Quality of Service, VoIP, shaping.

ACM Classification Keywords: C.4 Performance of Systems, C. Computer Systems Organization, C.2 Computer-Communication? Networks

Link:

VOIP TRAFFIC SHAPING ANALYSES IN METROPOLITAN AREA NETWORKS

Rossitza Goleva, Mariya Goleva, Dimitar Atamian, Tashko Nikolov, Kostadin Golev

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p12.pdf

SOFTWARE DEVELOPMENT FOR DISTRIBUTED SYSTEM OF RUSSIAN ...
By: Valery Kornyshko, Victor Dudarev  (3121 reads)
Rating: (1.00/10)

Abstract: Current state of Russian databases for substances and materials properties was considered. A brief review of integration methods of given information systems was prepared and a distributed databases integration approach based on metabase was proposed. Implementation details were mentioned on the posed database on electronics materials integration approach. An operating pilot version of given integrated information system implemented at IMET RAS was considered. Keywords: distributed database integration, metabase, Web services, database on electronics materials. ACM Classification Keywords: C.2.4 Distributed applications, Distributed databases; D.4.4 Network communication.

Link:

SOFTWARE DEVELOPMENT FOR DISTRIBUTED SYSTEM OF RUSSIAN DATABASES FOR ELECTRONICS MATERIALS

Valery Kornyshko, Victor Dudarev

http://www.foibg.com/ijita/vol13/ijita13-2-p03.pdf

GRID-ENABLING SATELLITE IMAGE ARCHIVE PROTOTYPE FOR UA SPACE GRID TESTBED1
By: Shelestov et al.  (3373 reads)
Rating: (1.00/10)

Abstract: The paper describes practical approach to implementation of satellite data archive using Globus Toolkit 4 components. The solutions consists in converting a hierarchy of remote data files available via FTP into Gridenabled archive. All etries of such archive will be indexed using arbitrary but pre-defined XML schema. The information will be exposed via MDS4 Index service and the actual data will be exposed via GridFTP. The schema used in our solution is simple enough for understanding but in a real life applications we should use metadata standards such as ISO 19139 and ISO 19115 in particular. A working prototype of the archive described in this paper is deployed on the Grid testbed of Space Research Institute of National Academy of Science and National Space Agency of Ukraine (SRI-NASU-NSAU). The SRI-NASU-NSAU testbed is briefly described in this paper as well. Keywords: Grid, distributed systems, parallel computing, satellite data, image processing, file archive, programming languages. ACM Classification Keywords: C.2.4 Distributed Systems: Distributed applications

Link:

GRID-ENABLING SATELLITE IMAGE ARCHIVE PROTOTYPE FOR UA SPACE GRID TESTBED1

Andrey Shelestov, Alexander Lobunets, Michael Korbakov

http://www.foibg.com/ijita/vol12/ijita12-4-p08.pdf

DEFINING NETWORK ACTIVITY PATTERNS USING FIRST ORDER TEMPORAL LOGICS
By: Lubomir Stanchev  (3302 reads)
Rating: (1.00/10)

Abstract: Part of network management is collecting information about the activities that go on around a distributed system and analyzing it in real time, at a deferred moment, or both. The reason such information may be stored in log files and analyzed later is to data-mine it so that interesting, unusual, or abnormal patterns can be discovered. In this paper we propose defining patterns in network activity logs using a dialect of First Order Temporal Logics (FOTL), called First Order Temporal Logic with Duration Constrains (FOTLDC). This logic is powerful enough to describe most network activity patterns because it can handle both causal and temporal correlations. Existing results for data-mining patterns with similar structure give us the confidence that discovering DFOTL patterns in network activity logs can be done efficiently.

Keywords: network management, temporal logics

ACM Classification Keywords: C.2.3 Network Operations – network management; F.4.1 Mathematical Logic – temporal logic

Link:

DEFINING NETWORK ACTIVITY PATTERNS USING FIRST ORDER TEMPORAL LOGICS

Lubomir Stanchev

http://www.foibg.com/ijita/vol12/ijita12-4-p03.pdf

TRAFFIC OFFERED BEHAVIOUR REGARDING TARGET QOS PARAMETERS ...
By: Emiliya Saranova  (3586 reads)
Rating: (1.00/10)

Abstract: We consider a model of overall telecommunication network with virtual circuits switching, in stationary state, with Poisson input flow, repeated calls, limited number of homogeneous terminals and 8 types of losses. One of the main problems of network dimensioning/redimensioning is estimation of traffic offered in network because it reflects on finding of necessary number of circuit switching lines on the basis of the consideration of detailed users manners and target Quality of Service (QoS). In this paper we investigate the behaviour of the traffic offered in a network regarding QoS variables: “probability of blocked switching” and “probability of finding B-terminals busy”. Numerical dependencies are shown graphically. A network dimensioning task (NDT) is formulated, solvability of the NDT and the necessary conditions for analytical solution are researched as well. The received results make the network dimensioning/redimensioning, based on QoS requirements easily, due to clearer understanding of important variables behaviour. The described approach is applicable directly for every (virtual) circuit switching telecommunication system e.g. GSM, PSTN, ISDN and BISDN. For packet - switching networks, at various layers, proposed approach may be used as a comparison basis and when they work in circuit switching mode (e.g. VoIP).

Keywords: Overall Network Traffic, Offered Traffic, Virtual Circuits Switching.

ACM Classification Keywords: C.2.1 Network Architecture and Design; C.2.3 Network Operations; C.4 Performance of Systems.

Link:

TRAFFIC OFFERED BEHAVIOUR REGARDING TARGET QOS PARAMETERS IN NETWORK DIMENSIONING

Emiliya Saranova

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p11.pdf

DIMENSIONING OF TELECOMMUNICATION NETWORK BASED ON QUALITY ...
By: Emiliya Saranova  (3289 reads)
Rating: (1.00/10)

Abstract: The aim of this paper is to be determined the network capacity (number of necessary internal switching lines) based on detailed users’ behaviour and demanded quality of service parameters in an overall telecommunication system. We consider detailed conceptual and its corresponded analytical traffic model of telecommunication system with (virtual) circuit switching, in stationary state with generalized input flow, repeated calls, limited number of homogeneous terminals and losses due to abandoned and interrupted dialing, blocked and interrupted switching, not available intent terminal, blocked and abandoned ringing (absent called user) and abandoned conversation. We propose an analytical - numerical solution for finding the number of internal switching lines and values of the some basic traffic parameters as a function of telecommunication system state. These parameters are requisite for maintenance demand level of network quality of service (QoS). Dependencies, based on the numericalanalytical results are shown graphically. For proposed conceptual and its corresponding analytical model a network dimensioning task (NDT) is formulated, solvability of the NDT and the necessary conditions for analytical solution are researched as well. It is proposed a rule (algorithm) and computer program for calculation of the corresponded number of the internal switching lines, as well as corresponded values of traffic parameters, making the management of QoS easily.

Keywords: Telecommunication Network, Circuit Switching, Network Traffic, Terminal Traffic, Human Factors, Network Dimensioning.

ACM Classification Keywords: C.2.1 Network Architecture and Design (Circuit-switching networks); C.2.3 Network Operations (Network management); H.1.2 User/Machine Systems (Human factors).

Link:

DIMENSIONING OF TELECOMMUNICATION NETWORK BASED ON QUALITY OF SERVICES DEMAND AND DETAILED BEHAVIOUR OF USERS

Emiliya Saranova

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-2-p01.pdf

THE MATRIX METHOD OF DETERMINING THE FAULT TOLERANCE DEGREE ...
By: Krivoi et al.  (3215 reads)
Rating: (1.00/10)

Abstract: This work presents a theoretical-graph method of determining the fault tolerance degree of the computer network interconnections and nodes. Experimental results received from simulations of this method over a distributed computing network environment are also presented.

Keywords: computer network, fault tolerance, coherent graph, regular graph, network topology, adjacency matrix.

ACM Classification Keywords: C.2.1 Network Architecture and Design - network topology, F.2.1 Numerical Algorithms and Problems - matrix methods, B.8.1 Reliability, Testing, and Fault-Tolerance? - fault tolerance degree

Link:

THE MATRIX METHOD OF DETERMINING THE FAULT TOLERANCE DEGREE OF A COMPUTER NETWORK TOPOLOGY

Sergey Krivoi, Miroslaw Hajder, Pawel Dymora, Miroslaw Mazurek

http://www.foibg.com/ijita/vol13/ijita13-3-p04.pdf

CLUSTER SUPERCOMPUTER ARCHITECTURE
By: Golovinskiy et al.  (3051 reads)
Rating: (1.00/10)

Abstract: The paper describes the architecture of SCIT - supercomputer system of cluster type and the base architecture features used during this research project. This supercomputer system is put into research operation in Glushkov Institute of Cybernetics NAS of Ukraine from the early 2006 year. The paper may be useful for those scientists and engineers that are practically engaged in a cluster supercomputer systems design, integration and services.

Keywords: supercomputer, cluster, computer system management, computer architecture.

ACM Classification Keywords: C.1.4 Parallel Architectures. C.2.4 Distributed systems, D.4.7 Organization and Design

Link:

CLUSTER SUPERCOMPUTER ARCHITECTURE

Andrey Golovinskiy, Sergey Ryabchun, Anatoliy Yakuba

http://www.foibg.com/ijita/vol14/ijita14-4-p12.pdf

CLUSTER MANAGEMENT PROCESSES ORGANIZATION AND HANDLING
By: Koval et al.  (2795 reads)
Rating: (1.00/10)

Abstract: The paper describes cluster management software and hardware of SCIT supercomputer clusters built in Glushkov Institute of Cybernetics NAS of Ukraine. The paper shows the performance results received on systems that were built and the specific means used to fulfil the goal of performance increase. It should be useful for those scientists and engineers that are practically engaged in a cluster supercomputer systems design, integration and services.

Keywords: cluster, computer system management, computer architecture.

ACM Classification Keywords: C.1.4 Parallel Architectures; C.2.4 Distributed systems; D.4.7 Organization and Design

Link:

CLUSTER MANAGEMENT PROCESSES ORGANIZATION AND HANDLING

Valeriy Koval, Sergey Ryabchun, Volodymyr Savyak, Anatoliy Yakuba

http://www.foibg.com/ijita/vol12/ijita12-1-p11.pdf

LINEAR CLASSIFIERS BASED ON BINARY DISTRIBUTED REPRESENTATIONS
By: Dmitri Rachkovskij  (3446 reads)
Rating: (1.00/10)

Abstract: Binary distributed representations of vector data (numerical, textual, visual) are investigated in classification tasks. A comparative analysis of results for various methods and tasks using artificial and real-world data is given.

Keywords: Distributed representations, binary representations, coarse coding, classifiers, perceptron, SVM, RSC

ACM Classification Keywords: C.1.3 Other Architecture Styles - Neural nets, I.2.6 Learning - Connectionism and neural nets, Induction, Parameter learning

Link:

LINEAR CLASSIFIERS BASED ON BINARY DISTRIBUTED REPRESENTATIONS

Dmitri Rachkovskij

http://www.foibg.com/ijita/vol14/ijita14-3-p12.pdf

[prev]  Page: 65/66  [next]
1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66 
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.16 secs ]   [ Memory usage: 7.55MB ]   [ GZIP Disabled ]   [ Server load: 0.26 ]