PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 12

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition
Flasiński M.
Machine Graphics and Vision
|
2018
|
Vol. 27, No. 1/4
3--19
EN
Further results of research into graph grammar parsing for syntactic pattern recognition (Pattern Recognit. 21:623-629, 1988; 23:765-774, 1990; 24:1223-1224, 1991; 26:1-16, 1993; 43:249-2264, 2010; Comput. Vision Graph. Image Process. 47:1-21, 1989; Fundam. Inform. 80:379-413, 2007; Theoret. Comp. Sci. 201:189-231, 1998) are presented in the paper. The notion of interpreted graphs based on Tarski's model theory is introduced. The bottom-up parsing algorithm for ETPR(k) graph grammars is defined.
2
Content available Generative power of reduction-based parsable ETPR(k) graph grammars for syntactic pattern recognition
Flasiński M.
Journal of Automation Mobile Robotics and Intelligent Systems
|
2018
|
Vol. 12, No. 2
61--81
EN
Further results of research into parsable graph grammars used for syntactic pattern recognition (Pattern Recognition: 21, 623-629 (1988); 23, 765-774 (1990); 24, 12-23 (1991); 26, 1-16 (1993); 43, 2249-2264 (2010), Comput. Vision Graph. Image Process. 47, 1-21 (1989), Computer-Aided Design 27, 403-433 (1995), Theoret. Comp. Sci. 201, 189-231 (1998), Pattern Analysis Applications bf 17, 465-480 (2014)) are presented in the paper. The generative power of reduction-based parsable ETPR(k) graph grammars is investigated. The analogy between the triad of CF - LL(k) - LR(k) string languages and the triad of NLC - ETPL(k) - ETPR(k) graph languages is discussed.
3
Content available remote Business process- and graph grammar-based approach to ERP system modelling
Flasiński M., Jurek J.
Journal of Applied Computer Science
|
2012
|
Vol. 20, nr 1
7-21
EN
Methods of ERP (Enterprise Resource Planning) systems modelling are presented in the paper. The modelling is necessary to adapt an ERP system to a company in such a way, that it fully supports a management at the operational level, i.e. it supports the business processes in the best possible way. The choice of methods (business process and graph grammarbased) described in the paper is based on the authors' experiences in several dozen of implementation projects, realized in large Polish enterprises. The methods can be used to select the best ERP system for a company, to design its implementation, and to customize the system accordingly to the requirements of a company.
4
Cyfrowa tożsamość w Internecie na bazie otwartego protokołu OpenID
Gorawski M., Flasiński M.
Studia Informatica
|
2009
|
Vol. 30, nr 2B
215-227
PL
W artykule przedstawiono otwarty, zdecentralizowany protokół OpenID. Opisane zostały problemy, jakie protokół rozwiązuje, terminologię, specyfikacje, a także cechy OpenID. Przybliżono w dosyć szczegółowy sposób proces uwierzytelniania użytkowników. W dalszej części opisano implementację dostawcy OpenID, problem bezpieczeństwa, a zakończono rozważaniami na temat przyszłości aplikacji i samego protokołu.
EN
The article presents open, decentralized OpenID protocol. It describes problems which are solved by the protocol, terminology, specifications as well as features of OpenID. The article introduces in details the user authentication process. Further OpenID provider, implementation and security problem are described. The summary contains considerations concerning the future of the application and the protocol.
5
On the use of graph grammars for business process optimization
Flasiński M.
Foundations of Control and Management Sciences
|
2008
|
No. 9
29-37
EN
The analysis of IT applications development in small and medium-sized enterprises reveals significant difficulties with selection and adjustment of the available IT solutions to real and still changing requirements of management support, particularly in the firms with the non-stream organization of production and services. Those difficulties justify the necessity to seek for a new approach to IT applications development in those organizations. In the proposed solution IT is a supporting tool of organizational learning and optimisation of enterprise functioning. Optimisation of the quality, productivity and costs of the processes that contribute to reach immanent goals of the enterprise functioning, shapes the model of information management and IT application development.
6
Content available remote Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
Flasiński M.
Fundamenta Informaticae
|
2007
|
Vol. 80, nr 4
379-413
EN
A research into a syntactic pattern recognition model based on ( edNLC) graph grammars (introduced and investigated in Janssens and Rozenberg Inform. Sci. 20 (1980), 191-216, and Janssens, Rozenberg and Verraedt Comp. Vis. Graph. Image Process. 18 (1982), 279-304) has resulted in defining the efficient, O(n2), parsing schemes for the ETPL(k) subclass of these grammars and applying it for scene analysis, CAD/CAM object analysis and constructing AI systems (Flasiński Patt. Recogn. 21 (1988), 623-629, Flasiński Comp. Vis. Graph. Image Process. 47 (1989), 1-21, Flasiński Patt. Recogn. 26 (1993), 1-16, Flasiński Comp. Aided-Des. 27 (1995), 403-433, Flasiński Theor. Comp. Sci. 201 (1998), 189-231). In the paper the grammatical inference method for the parsable ETPL(k) graph grammars is defined, completing the development of this syntactic pattern recognition model.
7
Content available remote On the Analysis of Fuzzy String Patterns with the Help of Extended and Stochastic GDPLL(k) Grammars
Flasiński M., Jurek J.
Fundamenta Informaticae
|
2006
|
Vol. 71, nr 1
1-14
EN
Two methods of the analysis of distorted (fuzzy) string patterns are presented. The methods are based on the use of GDPLL(k ) grammars generating a large subclass of context sensitive languages. The first one utilizes error-correcting approach: a minimum distance measure is used for error-correcting parsing. The second one utilizes stochastic approach: the decision about the production to be applied in a derivation step is given according to the probability measure.
8
Content available remote Formal fundamentals of syntactic pattern recognition - survey
Flasiński M.
Geoinformatica Polonica
|
2001
|
T. 3
7-16
EN
The basic notions and ideas of syntactic pattern recognition have been introduced and discussed with the help of examples in the paper. The main problems concerning the use of formal grammars as a tool for a structural pattern generation and the use of formal automata as a tool for an analysis and recognition of such pattern have been surveyed. The paper contains also a short discussion of the application of syntactic pattern recognition methods in geosciences.
PL
W pracy wprowadzono podstawowe pojęcia i idee syntaktycznego rozpoznawania obrazów i objaśniono je na przykładach. Dokonano przeglądu głównych problemów dotyczących wykorzystania gramatyk formalnych jako narzędzia generacji obrazów strukturalnych oraz wykorzystania automatów formalnych jako narzędzia analizy i rozpoznawania takich obrazów. Artykuł zawiera również krótką dyskusję o zastosowaniu metod syntaktycznego rozpoznawania obrazów w naukach o Ziemi.
9
The use of graph grammars for model-based reasoning in diagnostic expert systems
Flasiński M., Lee M.
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Prace Informatyczne
|
1999
|
z. 9
147-165
EN
The new approach to a construction of model and qualitative reasoning-based expert systems is presented in the paper. The main idea of the approach is the use of formalisms of the theory of graph languages and automata for defining reasoning schemes that process pre-defined graph-like models of complex systems diagnosed. The main adventage of the approach is the efficiency of such reasoning schemes due to the use of the ETPL(k) graph languages with a polynomial membership problem (Flasiński, Theoretical Computer Science 201 (1998), 189-231).
10
Structural approach to extraction and analysis of 3D features representing machining operations
Jakubowski R., Flasiński M.
Archiwum Informatyki Teoretycznej i Stosowanej
|
1999
|
T. 11, z. 3-4
249-272
EN
Shape languages introduced in Jakubowski, Information Sciences 39 (1986), 129-151 and 50 (1990), 35-71 are extended to an attributed model and used for a recognition of fuzzy shape features. The parsable family of ETPL(k) graph languages (Flasiński, Pattern Recognition 26 (1993), 1-16, Theoretical Computer Science 201 (1998), 189-231) is applied for a semantically-dependent analysis of solids modeled with shape features.
PL
Niniejsza praca poszerza języki opisu kształtu, które wprowadzono w Jakubowski, Information Science 39 (1986), 129-151 oraz 50 (1990), 35-71, o model z atrybutami. Model ten został wykorzystany do rozpoznawania kształtów rozmytych. Dla analizy semantycznej modeli zastosowano rodzinę języków opisu grafów EPTL(k) (Flasiński, Pattern Recognition 26 (1993), 1-16, Theoretical Computer Science 201 (1998), 189-231).
11
Model-based inspection of printed circuit boards with the help of ETPL(k) graph languages
Flasiński M., Baran M.
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Prace Informatyczne
|
1998
|
z. 8
93-112
EN
A new model of an automated visual inspection of printed circuit boards (PCB) is presented in the paper. The model belongs to a syntatic pattern recognition approach. The efficient ETPL(k) graph languages (Flasiński, Patt.Recogn.1988, Comp. Vis. Graph. Image Process. 1989, Patt. Recogn. 1990, Patt. Recogn. 1993, Comp. Aided Design 1995, Theor Comp. Sci 1998) are used as a representation and analysis scheme.
12
Content available remote Parsing of random graph languages for automated inspection in statisfical-based quality assurance systems
Flasiński M., Skomorowski M.
Machine Graphics and Vision
|
1998
|
Vol. 7, No. 3
565-623
EN
Basic requirements for an automated visual inspection in intelligent SPC-oriented quality assurance systems are discussed. Extensions of feature IE-graphs representing solids in CAD ([62]) to a stochastic model of manufacturing processes are proposed. An efficient random graph language analysis based on parsable ETPL(k) graph grammars([55)] is presented as a tool for intelligent reasoning in high layer modules of automated inspection systems. The first applications of the model are shown.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.