<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="Tiki CMS/Groupware via FeedCreator 1.7.2" -->
<?xml-stylesheet href="http://wiki.ithea.org/lib/rss/rss-style.css" type="text/css"?>
<?xml-stylesheet href="http://wiki.ithea.org/lib/rss/rss20.xsl" type="text/xsl"?>
<rss version="2.0">
    <channel>
        <title>Tiki RSS feed for articles</title>
        <description></description>
        <link>http://wiki.ithea.org/tiki-articles_rss.php?ver=2</link>
        <lastBuildDate>Sat, 19 May 2012 21:54:55 +0100</lastBuildDate>
        <generator>Tiki CMS/Groupware via FeedCreator 1.7.2</generator>
        <image>
            <url>http://wiki.ithea.org/img/tiki.jpg</url>
            <title>tikiwiki logo</title>
            <link>http://wiki.ithea.org/tiki-index.php</link>
            <description><![CDATA[Feed provided by http://wiki.ithea.org/tiki-index.php. Click to visit.]]></description>
        </image>
        <language>en-us</language>
        <item>
            <title>INFORMATIONAL-PARAMETRIC MODEL OF SIGN LANGUAGE FINGERSPELLING UNITS</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=990</link>
            <description><![CDATA[<p>Résumé: An approach for researching fingers' movement with an aim to create a formal notion of sign language fingerspelling units (dactyls) is considered. Then an informational parametric model of a human arm is suggested that describes possible movements during fingerspelling process. 10 fingerspelling alphabets are analyzed mutually compared for exact and partial similarity as well as notable distinctions. The example of a .Net-based software application is then provided that teaches proper Ukrainian fingerspelling.
</p>

<p>Keywords: fingerspelling alphabet, specification, model of human movements.
</p>

<p>ACM Classification Keywords: I.2.8 Problem Solving, Control Methods, and Search H.1.1 Systems and Information
</p>

<p>Link:
</p>

<p>INFORMATIONAL-PARAMETRIC MODEL OF SIGN LANGUAGE FINGERSPELLING UNITS
</p>

<p>Iurii Krak, Bogdan Trotsenko, Julia Barchukova
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p06.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p06.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 15:05:00 +0100</pubDate>
        </item>
        <item>
            <title>COMPARATIVE ANALYSIS FOR ESTIMATING OF THE HURST EXPONET FOR STATIONARY AND ...</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=989</link>
            <description><![CDATA[<p>Abstract: Estimating of the Hurst exponent for experimental data plays a very important role in the research of processes which show properties of self-similarity. There are many methods for estimating the Hurst exponent using time series. The aim of this research is to carry out the comparative analysis of the statistical properties of the Hurst exponent estimators obtained by different methods using model stationary and nonstationary fractal time series. In this paper the most commonly used methods for estimating the Hurst exponents are examined. There are: /RS-analysis, variance-time analysis, detrended fluctuation analysis (DFA) and wavelet-based estimation. The fractal Brownian motion that is constructed using biorthogonal wavelets have been chosen as a model random process which exhibit fractal properties. In this paper, the results of a numerical experiment are represented where the fractal Brown motion was modelled for the specified values of the exponent H. The values of the Hurst exponent for the model realizations were varied within the whole interval of possible values 0 < H < 1.The lengths of the realizations were defined as 500, 1000, 2000 and 4000 values. For the nonstationary case model time series are presented by the sum of fractional noise and the trend component, which are a polynomial in varying degrees, irrational, transcendental and periodic functions. The estimates of H were calculated for each generated time series using the methods mentioned above. Samples of the exponent H estimates were obtained for each value of H and their statistical characteristics were researched. The results of the analysis have shown that the estimates of the Hurst exponent, which were obtained for the stationary realisations using the considered methods, are biased normal random variables. For each method the bias depends on the true value of the degrees self-similarity of the process and length of time series. Those estimates which are obtained by the DFA method and the wavelet transformation have the minimal bias. Standard deviations of the estimates depending on the estimation method and decrease, while the length of the series increases. Those estimates which are obtained by using the wavelet analysis have the minimal standard deviation. In the case of a nonstationary time series, represented by a trend and additive fractal noise, more accurate evaluation is obtained using the DFA method. This method allows estimating the Hurst exponent for experimental data with trend components of virtually any kind. The greatest difficulty in estimating, presents a series with a periodic trend component. It is desirable in addition to investigate the spectrum of the wavelet energy, which is demonstrated in the structure of the time series. In the presence of a slight trend, the wavelet-estimation is quite effective.
</p>

<p>Keywords: Hurst exponent, estimate of the Hurst exponent, self-similar stochastic process, nonstationary time series, methods for estimating the Hurst exponent.
</p>

<p>ACM Classification Keywords: G.3 Probability and statistics - Time series analysis, Stochastic processes, G.1 Numerical analysis, G.1.2 Approximation - Wavelets and fractals.
</p>

<p>Link:
</p>

<p>COMPARATIVE ANALYSIS FOR ESTIMATING OF THE HURST EXPONET FOR STATIONARY AND NONSTATIONARY TIME SERIES
</p>

<p>Ludmila Kirichenko, Tamara Radivilova, Zhanna Deineko
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p05.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p05.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 15:00:00 +0100</pubDate>
        </item>
        <item>
            <title>SEARCH ALGORITHM FOR SHORTEST SYNCHRONIZING SEQUENCES USING BOOLEAN SATISFIABILI</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=988</link>
            <description><![CDATA[<p>Abstract: The problem under consideration is to find a synchronizing sequence for a logic network with memory. A novel method is proposed that is based on formulation of the task as the Boolean satisfiability problem solved with any standard SAT solver. The developed method allows creating a Boolean equation presenting the problem in conjunctive normal form.
</p>

<p>Keywords: design automation, verification, testing.
</p>

<p>ACM Classification Keywords: B.6.2 <a class="wiki"  href="Logic Design">Logic Design</a>: Reliability and Testing; B.6.2 <a class="wiki"  href="Reliability and Testing">Reliability and Testing</a>: Error-checking.
</p>

<p>Link:
</p>

<p>SEARCH ALGORITHM FOR SHORTEST SYNCHRONIZING SEQUENCES USING BOOLEAN SATISFIABILITY
</p>

<p>Liudmila Cheremisinova
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p04.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p04.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:56:00 +0100</pubDate>
        </item>
        <item>
            <title>OVERALL QOS REFERENCING IN TELECOMMUNICATION SYSTEMS – SOME CURRENT CONCEPTS .</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=987</link>
            <description><![CDATA[<p>Abstract: The main current concepts in overall Quality of Service (QoS) considerations in telecommunication systems, in documents of the leading standardization organizations, are found and put together. At least fifteen Open Issues for further study are formulated. Proposed are: Work Definitions of Communication and Telecommunication; A Reference Model of a Telecommunication System; Definitions of Overall Telecommunication Network and System Performance; Two Telecommunication System States’ modelling approaches are described; Parameters’ Classification Based on Their Values' Establishing Method is proposed, for the needs of design models; The necessity of Causal Classification of Values in Telecommunication Systems’ Models is argued; The necessity of Overall Telecommunication System’s Parameters’ Notation System is argued and a set of requirements is listed. An initial step of such notation system, proposed and used by authors is described.
</p>

<p>Keywords: Telecommunication Systems, Telecommunication Network, Overall Quality of Service, Multi-Conceptual<a href="tiki-editpage.php?page=Multi-Conceptual" title="Create page: Multi-Conceptual" class="wiki wikinew">?</a> Models, Models Scalability
</p>

<p>ACM Classification Keywords: C.4 Performance of Systems, H.1.2 User/Machine Systems, I.6 Simulation and Modelling, I.6.0 General, H.1.2 User/Machine Systems, K.6 Management of Computing and Information Systems, K.6.0 Genera.
</p>

<p>Link:
</p>

<p>OVERALL QOS REFERENCING IN TELECOMMUNICATION SYSTEMS – SOME CURRENT CONCEPTS AND OPEN ISSUES
</p>

<p>Stoyan Poryazov, Emiliya Saranova
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p03.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p03.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:47:00 +0100</pubDate>
        </item>
        <item>
            <title>AUTOMATED CONFERENCE CD-ROM BUILDER – AN OPEN SOURCE APPROACH</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=986</link>
            <description><![CDATA[<p>Abstract: This paper presents a new approach for creating conferences CD based HTML presentation of published papers for off-line reading. A couple of advances techniques has been deployed to automate process of creation like Java script engine, SQL database integration, full text search engine. The approach offers a good integration with online conference management systems for direct data exchange, friendly user interface and good compatibility with majority of contemporary HTML browsers.
</p>

<p>Key Words: Java script, SQL, PHP, Database, Open Source, Linux.
</p>

<p>Link:
</p>

<p>AUTOMATED CONFERENCE CD-ROM BUILDER – AN OPEN SOURCE APPROACH
</p>

<p>Stefan Karastanev
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p02.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p02.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:45:00 +0100</pubDate>
        </item>
        <item>
            <title>CONTENT ANALYZING AND SYNTHESIZING SERVICES IN A DIGITAL LIBRARY</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=985</link>
            <description><![CDATA[<p>Abstract: Current research on digital libraries (DL) is mostly focused on the generation of large collections of multimedia resources and regular tools for their indexing and retrieval. However, digital libraries should provide more than advanced content maintenance and retrieval services. They should aid the users in their content observation, knowledge acquisition and better satisfying their needs, interests and wishes. This paper presents an extension of the current DL functionality with content analyzing services. The main goal is to reach implicit and hidden data, content, rules and facts, dependences and tendencies, valid for the content in the DL repository, to synthesize and summarize the collected data in order to use them in various investigations and learning. These services also observe the DL tracking services’ output and provide different inferences for the frequency of service usage, failed requests, user logs and activities, etc., assisting the DL environment maintenance through the generation of inferences about its stability, flexibility, and reliability. This interpretation of DL analyzing services is not proposed and analyzed until now. We try to push up a new research point, aiming to aid user’s work in the DL environment.
</p>

<p>Keywords: Digital Libraries, Services, Content Analysis, East-Christian<a href="tiki-editpage.php?page=East-Christian" title="Create page: East-Christian" class="wiki wikinew">?</a> Iconographical Art.
</p>

<p>ACM Classification Keywords: H.3.5 Online Information Services – Web-based services, H.3.7 Digital Libraries – Collection, Dissemination, System issues
</p>

<p>Link:
</p>

<p>CONTENT ANALYZING AND SYNTHESIZING SERVICES IN A DIGITAL LIBRARY
</p>

<p>Desislava Paneva-Marinova<a href="tiki-editpage.php?page=Paneva-Marinova" title="Create page: Paneva-Marinova" class="wiki wikinew">?</a>, Maxim Goynov, Radoslav Pavlov
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p01.pdf">http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p01.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:42:00 +0100</pubDate>
        </item>
        <item>
            <title>EXTRACTING BUSINES RULES – HYPE OR HOPE FOR SOFTWARE MODERNIZATION</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=984</link>
            <description><![CDATA[<p>Abstract: The purpose of this work is to investigate how the Business Rules approach (very promising) can be used for the purposes of feasible and efficient software modernization (very needed). The processes of the forward and backward reengineering of legacy software systems are presented through identification of the main players. Their responsibilities, assigned tasks and expected deliverables are described. Some reasons for need of instrumental tools to support the process are given.
</p>

<p>Keywords: software development, software modernization, business rules, extracting business rules.
</p>

<p>ACM Classification Keywords: D.2.1 Requirements/Specifications, D.2.7 Distribution, Maintenance, and Enhancement.
</p>

<p>Link:
</p>

<p>EXTRACTING BUSINES RULES – HYPE OR HOPE FOR SOFTWARE MODERNIZATION
</p>

<p>Neli Maneva, Krassimir Manev
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijita/vol18/ijita18-4-p08.pdf">http://foibg.com/ijita/vol18/ijita18-4-p08.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:38:00 +0100</pubDate>
        </item>
        <item>
            <title>EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=983</link>
            <description><![CDATA[<p>Abstract: Wide introduction of the process-oriented systems for today is connected with the fact that they allow to formalize knowledge about business processes at the enterprises companies, organizations. At the same time, construction of business processes’ formal models require a lot of time and material costs, and it is the subject to influence of the human factor because it is often carry out with participation of experts and executors the purposes of which can be not coincided with the purposes of modeled business processes and enterprise overall aims. The given contradiction can lead to a divergence between real business process and its developed model. It can lead to construction of inadequate models of business processes. One of the important approaches to the decision of the given problem is realized on the basis of methodology of business processes intelligent analysis. The intelligent analysis is directed on reception of really carried out business processes’ models on the basis of research of events registration magazines of such processes.
</p>

<p>Keywords: business processes, Petri net, implicit selection, logic net, predicate.
</p>

<p>ACM Classification Keywords: C.4 Performance of systems - Modeling techniques, J.1 Administrative data processing - Business
</p>

<p>Link:
</p>

<p>EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES
</p>

<p>Nataliya Golyan, Vera Golyan, Olga Kalynychenko
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijita/vol18/ijita18-4-p07.pdf">http://foibg.com/ijita/vol18/ijita18-4-p07.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:24:00 +0100</pubDate>
        </item>
        <item>
            <title>CONSTRUCTION OF A REALISTIC MOVEMENT ON THE 3D HUMAN MODEL FOR STUDYING AND ...</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=982</link>
            <description><![CDATA[<p>Abstract: Complex information technology for communications gesture and mimicry modeling and visualization is created.
</p>

<p>Keywords: modeling, sign language, computer system, visual-speech synthesis and analysis.
</p>

<p>ACM Classification Keywords: I.2.8 Problem Solving, And Search H.1.1 Systems and Information
</p>

<p>Link:
</p>

<p>CONSTRUCTION OF A REALISTIC MOVEMENT ON THE 3D HUMAN MODEL FOR STUDYING AND LEARNING SIGN LANGUAGE
</p>

<p>Iurii Kryvonos, Iurii Krak, Anton Ternov
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijita/vol18/ijita18-4-p06.pdf">http://foibg.com/ijita/vol18/ijita18-4-p06.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:07:00 +0100</pubDate>
        </item>
        <item>
            <title>OPTIMIZING PROGRAMMABLE LOGIC ARRAYS USING THE SIMULATED ANNEALING ALGORITHM</title>
            <link>http://wiki.ithea.org/tiki-read_article.php?articleId=981</link>
            <description><![CDATA[<p>Abstract: In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is considered as a case of multiple constrained folding. Some experimental results of computer investigation of the suggested algorithms are given.
</p>

<p>Keywords: design automation, area optimization, VLSI structure folding, simulated annealing.
</p>

<p>ACM Classification Keywords: B.6.3 <a class="wiki"  href="Logic Design">Logic Design</a>: Design Aids – Optimization; B.7.2 <a class="wiki"  href="Integrated circuits">Integrated circuits</a>: Design Aids –Layout.
</p>

<p>Link:
</p>

<p>OPTIMIZING PROGRAMMABLE LOGIC ARRAYS USING THE SIMULATED ANNEALING ALGORITHM
</p>

<p>Liudmila Cheremisinova, Irina Loginova
</p>

<p><a target="_blank" class="wiki"  href="http://foibg.com/ijita/vol18/ijita18-4-p05.pdf">http://foibg.com/ijita/vol18/ijita18-4-p05.pdf</a>
</p>
]]></description>
            <author>System Administrator</author>
            <pubDate>Wed, 14 Mar 2012 14:04:00 +0100</pubDate>
        </item>
    </channel>
</rss>

