Wyniki wyszukiwania - BazTech

1

Cryptographically Strong Elliptic Curves of Prime Order

Barański Marcin, Gliwa Rafał, Szmidt Janusz

International Journal of Electronics and Telecommunications

|

2021

|

Vol. 67, No. 2

207--212

EN

The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.

2

Adaptive ant-colony algorithm for semantic query routing

Gómez Santillán C., Cruz Reyes L., Schaeffer E., Meza E., Rivera Zarate G.

Journal of Automation Mobile Robotics and Intelligent Systems

|

2011

|

Vol. 5, No. 1

85-94

EN

The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.

3

Zastosowanie algorytmu poszukiwania snopowego opartego na szybkiej transformacie Fouriera do cyfrowej analizy sygnałów

Bożejko W., Wodecki M., Walczyński M.

Zeszyty Naukowe. Automatyka / Politechnika Śląska

|

2008

|

z. 150

31-36

PL

W pracy proponujemy algorytm poszukiwania snopowego analizowania sygnałów akustycznych oparty na kodowaniu sygnału za pomocą szybkiej transformaty Fouriera (FFT). Wykonano obliczenia na reprezentatywnej grupie przykładów, a uzyskane wyniki wskazują na dużą aplikacyjność proponowanej metody w zastosowaniu do zagadnień praktyki przemysłowej.

EN

In this paper we propose a beam search algorithm to analyze an acoustic signals, which is based on FFT coding. Calculations executed on representative group of benchmark instances show that the method has a big chance for application in the factory practice problems.

4

Problem gniazdowy z ograniczeniem bez czekania. Równoległe algorytmy tabu

Makuchowski M.

Zeszyty Naukowe. Automatyka / Politechnika Śląska

|

2008

|

z. 150

175-181

PL

W pracy opisane są równoległe algorytmy poszukiwania z zabronieniami, dedykowane gniazdowemu problemowi z ograniczeniem bez czekania. Proponowane algorytmy zbudowane są z nadrzędnego algorytmu bazującego na wspomnianej technice oraz sterowanego algorytmu konstrukcyjnego. Poszukiwania ograniczone są tylko do rozwiązań możliwych do wygenerowania przez wspomniany algorytm konstrukcyjny. W pracy przedstawia się analizę porównawczą zaproponowanych algorytmów.

EN

This paper deals with parallel tabu search algorithms for a job shop problem with a no-wait constraint and a makespan criterion. The proposed algorithms consist of a master algorithm based on the mentioned technique and slave constructive algorithm. This approach reduces the number of solutions to check only to solutions that can be generated by means of the constructive algorithm. In this paper a comparative analysis of the proposed algorithms is presented.

5

A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics

Ferré S., King R. D.

Fundamenta Informaticae

|

2005

|

Vol. 66, nr 1,2

1--32

EN

Many application domains make use of specific data structures such as sequences and graphs to represent knowledge. These data structures are ill-fitted to the standard representations used in machine learning and data-mining algorithms: propositional representations are not expressive enough, and first order ones are not efficient enough. In order to efficiently represent and reason on these data structures, and the complex patterns that are related to them, we use domain-specific logics. We show these logics can be built by the composition of logical components that model elementary data structures. The standard strategies of top-down and bottom-up search are ill-suited to some of these logics, and lack flexibility. We therefore introduce a dichotomic search strategy, that is analogous to a dichotomic search in an ordered array. We prove this provides more flexibility in the search, while retaining completeness and non-redundancy. We present a novel algorithm for learning using domain specific logics and dichotomic search, and analyse its complexity. We also describe two applications which illustrates the search for motifs in sequences; where these motifs have arbitrary length and length-constrained gaps. In the first application sequences represent the trains of the East-West challenge; in the second application they represent the secondary structure of Yeast proteins for the discrimination of their biological functions.

6

Optymalizacja transportu przesyłek przy wykorzystaniu stałych linii komunikacyjnych i wyróżnionych węzłów sortujących

Kuczora M.

Studia Informatica

|

2002

|

Vol. 23, nr 4

105-124

PL

Artykuł opisuje problem transportowy zakładający istnienie sieci węzłów o zróżnicowanej funkcji, pomiędzy którymi są transportowane przesyłki. Rozważane jest znalezienie optymalnej drogi paczki oraz określenie reguł konstrukcji rozkładu jazdy. Próba rozwiązania zakłada adaptację klasycznych algorytmów transportowych, tzn. algorytmu wyszukiwania najkrótszych ścieżek Dijkstry oraz Floyda-Warshalla. Wyniki są selekcjonowane w świetle przyjętych ograniczeń. Jako alternatywne rozwiązanie jest przedstawiony algorytmu przeszukiwania Tabu. Uzyskane rezultaty są porównane do wyników empirycznych, a wykorzystywane metody do prac podejmowanych na świecie.

EN

Article describes transport-class problem connected with network transporting packages that contains nodes which have different function. The goal is to find an optimal parcel itinerary and specify timetable creation rules. The attempt of solution adapts classical transport algorithms such as Dijkstra and Floyd-Warshall ones. The content modification of those algorithms and the selection of results according to given assumptions are executed. Tabu Search algorithm is considered as an alternative solution. The results are compared to empiric ones and applied methods to works which are undertaken in the world.