A data structure based on grammatical compression to detect long pattern
|
|
- Ιώ Αποστόλου
- 6 χρόνια πριν
- Προβολές:
Transcript
1 1 1 (1 + )nlogn + n + o(n) O( 1 (mlogn+occc(logmlogu))) n u m = P, < < 1 Z-index ) M-index ) A data structure based on grammatical compression to detect long pattern Naoya Kishiue, 1 Masaya Nakahara, 1 hirou Maruyama and Hiroshi akamoto In this research, we propose the method to search long pattern from compressed index based on Context-free Grammar. The proposed method can detect the pattern at O( 1 (mlogn+occc(logmlogu))) time with (1+)nlogn+ n + o(n) bits, where n is generated variables compressed text (original size u), m = P, < < 1. Result of experiments, we confirmed our proposed method was faster than existing method (e.g, Z-index ), M-index ) ) at long pattern. 1 Kyushu Institute of Technology Graduate chool of Computer cience and ystems ngineering Kyushu University Graduate chool of Information cience and lectrical ngineering Kyushu Institute of Technology aculty of Computer cience and ystems ngineering 1. M-index ) 9) ucg 1 n(1+)nlogn+n+o(n) < < 1 m P O( 1 (mlogn+occc(logmlogu))) occ c P P P P occ c ),),9). CG X ab a b X edit sensitive parsing 1) CG.1 Σ 1 Σ = 11 (digram) a ia j lca(i,j) a i a j w w i w[i] w w[i] 1 w[i] label(w[i]) 1) 1 c11 Information Processing ociety of Japan
2 lca( a, a) = lca( a, a) = a1 a a a a a a a a9 a1 a11 1 lca ig.1 Alphabet tree and lca dummy w 1st labels nd labels final labels landmarks a1 a a a a9 a1 a1 a a a a1 a Σ Σ 1 Σ Σ ig. Alphabet reduction and landmarks lca(w[i 1],w[i]) (w[i 1] < w[i]) label(w[i]) = lca(w[i 1],w[i])+1 (otherwise) 1 a i i {1,,...,n} {,,..., logn +1} n 1 logn w w w log n 1 log n w 1 w 1,w n w 1,w n n n edit sensitive parsing 1 log n loglog logn > 1 log (1). dit sensitive parsing s n (1) () 1 log n () 1, 1 s i = aaaab s i = XXb X aa edit sensitive parsing s i = abacabcda s i[],s i[] s i = axcayda X ba,y bc s i = axzywx ba,y bc,z ca,w da s 1,s,,s k s s = 1 s s s logs..1 CG CG G D P P 1,P,,P k G 1 w w[i,j] = w[k,l] = αβγ w[i,j] w[k,l] β w[i,j] w w[j] i < j ss c11 Information Processing ociety of Japan
3 K '''' ''' H J I H I C D b c b a d b a d e b c Compressed pattern Core K X X Y G C G D '' ' G A a C a D b A a Type: G H I A A C D D A A C D A C AC A A a b a b a b d c b a b b b a b a landmark Type: Type:1 Type: ig. tate of compression a b a b c b a d b a d e b c a d Parsing Tree of original text ig. xtracting the Core ig. Adjacent relation of subtrees b a b b b b b a b a b b b a b b DAG ig. Parsing Tree and DAG w[i,j] = w[k,l] Σ w[i,j] = w[k,l] = xαy α α P P XP 1,P,,P k G P X P i,p ji j P 1 P i P k = O(log P ). A, A 1 X ab a,b X a b A 1 A A A, A X (1) X A () X Y A, A u logu A logu O(logu). DAG A, DAG DAG DAG A DAG DAG DAG G G G left G right c11 Information Processing ociety of Japan
4 1 a b DAG representation 1 9 Gleft 1 DAG ig. Decomposition of DAG Grightt G G DAG AXG left,g right X Y G right X Y G left Y G left logu X DAG O(logu) P c O(log P logu) P O(occ c(log P logu)) DAG. DAG Σ [1,n] (1) rank c(,i):[1,i] c Σ () select c(,i): c i () access(,i):[i] ) n nlogσ +o(nlogσ) O(logσ) Σ = σ = n O(1) n+o(n) ) balanced parenthesis representation P ) T T T 1,T,...,T d T P(T) P(T) = () (d = 1) P(T) = (P(T 1)P(T ) P(T d )) (otherwise) (),1 nn P P P ) (1) findclose(i):p[i] () findopen(i):p[i] () enclose(i):p[i] ( 1) parent(x):enclose(x) x () firstchile(x):x+1 x ( ) nextsibling(x):finclose(x) + 1 x i p c11 Information Processing ociety of Japan
5 The in-branching children of x in T sorted by the original variables of the parents in T R z 1 z z z z The in-degree edges in the left tree T R The in-degree edges to a node x in the left tree T x y 1 y y y y X X X X X 1 The original variables of y i accessible by the succinct permutation ig. reverse dictionary representation by binary search p = preorder(i) = rank ( (P,i) i = select ( (P,p) O(1) n+o(n) ). π π[i] π 1 [i] π = (,,1,,) π[] =,π 1 [] = π[i] π i π 1 [i] π i ) (1+)nlogn+O(n) π[i] O(1) π 1 [i] O( 1 ) P z xy xy z T (x),t R(x) x T (x i) T (x i) T (z 1),T (z ),,T (z k ) T R(z i) 1 a b DAG representation P label in label in T T R original label T ((((()))()((())))(())) ((((())()(()))((())))) a 1 b 9 ig. 9 eft/right tree and succinct representation y i xy T (x) T (k)t R(k) y k xy x T (x) O(logn) n nn+o(n) P 9 CG P P m O(mlogn) TR c11 Information Processing ociety of Japan
6 O( 1 ) CG (1+)nlogn+ n+o(n) O( 1 (mlogn+occc(logmlogu))) P. Z-index ) CArray 9) M-index ) CPU:Intel Xeon (Quad Core, Memory: 1G, CentO.(bit), gcc.1. 1 Pizza & Chili corpus 1M 1,,,,,1M 1M 1M, yte 1 Z-index, yte 1 11 CArray M-index 1 M-index 1. 1 ig. 1 Time to construct index. 1 ig. 1 Time to count occurrences 11 ig.11 Index size edit sensitive parsing z xy z x,y x,y OUD ) c11 Information Processing ociety of Japan
7 % 1) Cormode, G. and Muthukrishman,.: The string edit distance matching problem with moves, ACM Trans, Vol., No.1 (1). ) Delpratt, O., Rahman, N. and Raman, R.: ngineering the OUD uccinct Tree Representation, In WA (). ) erragina, P. and Manzini, G.: Opportunistic data structures with applications, In OC, Vol., No.1, pp.9 9 (). ) Grossi, R., Gupta, A. and Vitter, J.: High-order entropy-compressed text indexes, In ODA, pp. (). ) Munro, J.: Tables, In TTC9, pp. (199). ) Munro, J., Raman, R., Raman, V. and Rao,.: uccinct representations of permutations, In ICAP, pp. (). ) Munro, J. and Raman, V.: uccinct representation of balanced parentheses and static trees, IAM Journal on Computing, Vol.1, No., pp. (1). ) Navarro, G.: Indexing text using the ziv-lempel tire, Journal of Discrete Algorithms, pp. 11 (1). 9) adakane, K.: Compressed text databases with efficient query algorithms based on the compressed suffix array, In IAAC, pp.1 1 (). c11 Information Processing ociety of Japan
Re-Pair n. Re-Pair. Re-Pair. Re-Pair. Re-Pair. (Re-Merge) Re-Merge. Sekine [4, 5, 8] (highly repetitive text) [2] Re-Pair. Blocked-Repair-VF [7]
Re-Pair 1 1 Re-Pair Re-Pair Re-Pair Re-Pair 1. Larsson Moffat [1] Re-Pair Re-Pair (Re-Pair) ( ) (highly repetitive text) [2] Re-Pair [7] Re-Pair Re-Pair n O(n) O(n) 1 Hokkaido University, Graduate School
Διαβάστε περισσότεραReducing the space and time requirements of LZ-index using the XBW transformation jργklαzxcvbnβφδγωmζqwertλκοθξyu
ιertyuiopasdfghjklzxερυυξnmηqσwω ψerβνtyuςiopasdρfghjklzxcvbnmqwe rtyuiopasdfghjklzxcvbnφγιmλιqπςπζ αwωeτrtνyuτioρνμpκaλsdfghςjklzxcv λοπbnαmqwertyuiopasdfghjklzxcvbn mσγqwφertyuioσδφpγρaηsόρωυdfgh Reducing
Διαβάστε περισσότεραBuried Markov Model Pairwise
Buried Markov Model 1 2 2 HMM Buried Markov Model J. Bilmes Buried Markov Model Pairwise 0.6 0.6 1.3 Structuring Model for Speech Recognition using Buried Markov Model Takayuki Yamamoto, 1 Tetsuya Takiguchi
Διαβάστε περισσότεραGPU. CUDA GPU GeForce GTX 580 GPU 2.67GHz Intel Core 2 Duo CPU E7300 CUDA. Parallelizing the Number Partitioning Problem for GPUs
GPU 1 1 NP number partitioning problem Pedroso CUDA GPU GeForce GTX 580 GPU 2.67GHz Intel Core 2 Duo CPU E7300 CUDA C Pedroso Python 323 Python C 12.2 Parallelizing the Number Partitioning Problem for
Διαβάστε περισσότεραER-Tree (Extended R*-Tree)
1-9825/22/13(4)768-6 22 Journal of Software Vol13, No4 1, 1, 2, 1 1, 1 (, 2327) 2 (, 3127) E-mail xhzhou@ustceducn,,,,,,, 1, TP311 A,,,, Elias s Rivest,Cleary Arya Mount [1] O(2 d ) Arya Mount [1] Friedman,Bentley
Διαβάστε περισσότεραYoshifumi Moriyama 1,a) Ichiro Iimura 2,b) Tomotsugu Ohno 1,c) Shigeru Nakayama 3,d)
1,a) 2,b) 1,c) 3,d) Quantum-Inspired Evolutionary Algorithm 0-1 Search Performance Analysis According to Interpretation Methods for Dealing with Permutation on Integer-Type Gene-Coding Method based on
Διαβάστε περισσότεραGPGPU. Grover. On Large Scale Simulation of Grover s Algorithm by Using GPGPU
GPGPU Grover 1, 2 1 3 4 Grover Grover OpenMP GPGPU Grover qubit OpenMP GPGPU, 1.47 qubit On Large Scale Simulation of Grover s Algorithm by Using GPGPU Hiroshi Shibata, 1, 2 Tomoya Suzuki, 1 Seiya Okubo
Διαβάστε περισσότεραElements of Information Theory
Elements of Information Theory Model of Digital Communications System A Logarithmic Measure for Information Mutual Information Units of Information Self-Information News... Example Information Measure
Διαβάστε περισσότεραAnomaly Detection with Neighborhood Preservation Principle
27 27 Workshop on Information-Based Induction Sciences (IBIS27) Tokyo, Japan, November 5-7, 27. Anomaly Detection with Neighborhood Preservation Principle Tsuyoshi Idé Abstract: We consider a task of anomaly
Διαβάστε περισσότεραStabilization of stock price prediction by cross entropy optimization
,,,,,,,, Stabilization of stock prediction by cross entropy optimization Kazuki Miura, Hideitsu Hino and Noboru Murata Prediction of series data is a long standing important problem Especially, prediction
Διαβάστε περισσότεραAn Automatic Modulation Classifier using a Frequency Discriminator for Intelligent Software Defined Radio
C IEEJ Transactions on Electronics, Information and Systems Vol.133 No.5 pp.910 915 DOI: 10.1541/ieejeiss.133.910 a) An Automatic Modulation Classifier using a Frequency Discriminator for Intelligent Software
Διαβάστε περισσότεραPractical Implementation of Compressed Suffix Array on Modern Processors
DEIM Forum 2012 F11-2 CPU NTT, 239-0847 1-1 E-mail: {yamamuro.takeshi,onizuka.makoto,hitaka.toshio,yamamuro.masashi}@lab.ntt.co.jp T N P M N >> M / T / CPU CPU 2 P CPU CPU Practical Implementation of Compressed
Διαβάστε περισσότεραStudy of In-vehicle Sound Field Creation by Simultaneous Equation Method
Study of In-vehicle Sound Field Creation by Simultaneous Equation Method Kensaku FUJII Isao WAKABAYASI Tadashi UJINO Shigeki KATO Abstract FUJITSU TEN Limited has developed "TOYOTA remium Sound System"
Διαβάστε περισσότεραSocialDict. A reading support tool with prediction capability and its extension to readability measurement
SocialDict 1 2 2 2 Web SocialDict A reading support tool with prediction capability and its extension to readability measurement Yo Ehara, 1 Takashi Ninomiya, 2 Nobuyuki Shimizu 2 and Hiroshi Nakagawa
Διαβάστε περισσότεραIPSJ SIG Technical Report Vol.2014-CE-127 No /12/6 CS Activity 1,a) CS Computer Science Activity Activity Actvity Activity Dining Eight-He
CS Activity 1,a) 2 2 3 CS Computer Science Activity Activity Actvity Activity Dining Eight-Headed Dragon CS Unplugged Activity for Learning Scheduling Methods Hisao Fukuoka 1,a) Toru Watanabe 2 Makoto
Διαβάστε περισσότεραIndexing Methods for Encrypted Vector Databases
Computer Security Symposium 2013 21-23 October 2013 305-0006 1-1-1 junpei.kawamoto@acm.org LSH LSH LSH Indexing Methods for Encrypted Vector Databases Junpei Kawamoto Faculty of Engineering, Information
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραMIDI [8] MIDI. [9] Hsu [1], [2] [10] Salamon [11] [5] Song [6] Sony, Minato, Tokyo , Japan a) b)
1,a) 1,b) 1,c) 1. MIDI [1], [2] U/D/S 3 [3], [4] 1 [5] Song [6] 1 Sony, Minato, Tokyo 108 0075, Japan a) Emiru.Tsunoo@jp.sony.com b) AkiraB.Inoue@jp.sony.com c) Masayuki.Nishiguchi@jp.sony.com MIDI [7]
Διαβάστε περισσότεραBMI/CS 776 Lecture #14: Multiple Alignment - MUSCLE. Colin Dewey
BMI/CS 776 Lecture #14: Multiple Alignment - MUSCLE Colin Dewey 2007.03.08 1 Importance of protein multiple alignment Phylogenetic tree estimation Prediction of protein secondary structure Critical residue
Διαβάστε περισσότεραSchedulability Analysis Algorithm for Timing Constraint Workflow Models
CIMS Vol.8No.72002pp.527-532 ( 100084) Petri Petri F270.7 A Schedulability Analysis Algorithm for Timing Constraint Workflow Models Li Huifang and Fan Yushun (Department of Automation, Tsinghua University,
Διαβάστε περισσότεραWavelet based matrix compression for boundary integral equations on complex geometries
1 Wavelet based matrix compression for boundary integral equations on complex geometries Ulf Kähler Chemnitz University of Technology Workshop on Fast Boundary Element Methods in Industrial Applications
Διαβάστε περισσότεραDevelopment of a basic motion analysis system using a sensor KINECT
KINECT 1,a) 2 3,b) KINECT KINECT ( ( Development of a basic motion analysis system using a sensor KINECT Abstract: We developed a basic motion analysis system using a sensor KINECT. Our system estimates
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότεραApplying Markov Decision Processes to Role-playing Game
1,a) 1 1 1 1 2011 8 25, 2012 3 2 MDPRPG RPG MDP RPG MDP RPG MDP RPG MDP RPG Applying Markov Decision Processes to Role-playing Game Yasunari Maeda 1,a) Fumitaro Goto 1 Hiroshi Masui 1 Fumito Masui 1 Masakiyo
Διαβάστε περισσότεραA Method for Creating Shortcut Links by Considering Popularity of Contents in Structured P2P Networks
P2P 1,a) 1 1 1 P2P P2P P2P P2P A Method for Creating Shortcut Links by Considering Popularity of Contents in Structured P2P Networks NARISHIGE Yuki 1,a) ABE Kota 1 ISHIBASHI Hayato 1 MATSUURA Toshio 1
Διαβάστε περισσότεραNewman Modularity Newman [4], [5] Newman Q Q Q greedy algorithm[6] Newman Newman Q 1 Tabu Search[7] Newman Newman Newman Q Newman 1 2 Newman 3
DEWS2007 D3-6 y yy y y y y yy / DC 7313194 341 E-mail: yfktamura,mori,kuroki,kitakamig@its.hiroshima-cu.ac.jp, yymakoto@db.its.hiroshima-cu.ac.jp Newman Newman Newman Newman Newman A Clustering Algorithm
Διαβάστε περισσότερα(pattern recognition) (symbol processing) (content) (raw data) - 1 -
(symbol processing) (pattern recognition) (content) (identify) (interpret) (raw data) - 1 - 9D-SPA - 2 - 2D string (Chang, Shi, and Yan, 1987) 2D G-string (Jungert, 1988) 2D C-string (Lee and Hsu, 1990)
Διαβάστε περισσότερα2. N-gram IDF. DEIM Forum 2016 A1-1. N-gram IDF IDF. 5 N-gram. N-gram. N-gram. N-gram IDF.
DEIM Forum 216 A1-1 N-gram IDF 565 871 1-5 E-mail: {hirakawa.maumi,hara}@it.oaka-u.ac.jp N-gram IDF IDF N-gram N-gram N-gram N-gram IDF N-gram N-gram IDF N-gram N-gram IDF Web Wikipedia 1 N-gram IDF [3]
Διαβάστε περισσότεραGraded Refractive-Index
Graded Refractive-Index Common Devices Methodologies for Graded Refractive Index Methodologies: Ray Optics WKB Multilayer Modelling Solution requires: some knowledge of index profile n 2 x Ray Optics for
Διαβάστε περισσότεραCeramic PTC Thermistor Overload Protection
FEATURES compliant CPTD type are bare disc type CPTL type are leaded Low, medium and high voltage ratings Low resistance; Small size No need to reset supply after overload No noise generated Stable over
Διαβάστε περισσότεραn 1 n 3 choice node (shelf) choice node (rough group) choice node (representative candidate)
THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE. y y yy y 1565 0871 2 1 yy 525 8577 1 1 1 E-mail: yfmakihara,shiraig@cv.mech.eng.osaka-u.ac.jp, yyshimada@ci.ritsumei.ac.jp
Διαβάστε περισσότεραQuick algorithm f or computing core attribute
24 5 Vol. 24 No. 5 Cont rol an d Decision 2009 5 May 2009 : 100120920 (2009) 0520738205 1a, 2, 1b (1. a., b., 239012 ; 2., 230039) :,,.,.,. : ; ; ; : TP181 : A Quick algorithm f or computing core attribute
Διαβάστε περισσότεραProbabilistic Approach to Robust Optimization
Probabilistic Approach to Robust Optimization Akiko Takeda Department of Mathematical & Computing Sciences Graduate School of Information Science and Engineering Tokyo Institute of Technology Tokyo 52-8552,
Διαβάστε περισσότερα1 n-gram n-gram n-gram [11], [15] n-best [16] n-gram. n-gram. 1,a) Graham Neubig 1,b) Sakriani Sakti 1,c) 1,d) 1,e)
1,a) Graham Neubig 1,b) Sakriani Sakti 1,c) 1,d) 1,e) 1. [11], [15] 1 Nara Institute of Science and Technology a) akabe.koichi.zx8@is.naist.jp b) neubig@is.naist.jp c) ssakti@is.naist.jp d) tomoki@is.naist.jp
Διαβάστε περισσότεραSpeeding up the Detection of Scale-Space Extrema in SIFT Based on the Complex First Order System
(MIRU2008) 2008 7 SIFT 572-8572 26-12 599-8531 1-1 E-mail: umemoto@ipc.osaka-pct.ac.jp, kise@cs.osakafu-u.ac.jp SIFT 1 ANN 3 1 SIFT 1 Speeding up the Detection of Scale-Space Extrema in SIFT Based on the
Διαβάστε περισσότεραDetection and Recognition of Traffic Signal Using Machine Learning
1 1 1 Detection and Recognition of Traffic Signal Using Machine Learning Akihiro Nakano, 1 Hiroshi Koyasu 1 and Hitoshi Maekawa 1 To improve road safety by assisting the driver, traffic signal recognition
Διαβάστε περισσότεραSimplex Crossover for Real-coded Genetic Algolithms
Technical Papers GA Simplex Crossover for Real-coded Genetic Algolithms 47 Takahide Higuchi Shigeyoshi Tsutsui Masayuki Yamamura Interdisciplinary Graduate school of Science and Engineering, Tokyo Institute
Διαβάστε περισσότεραAutomatic extraction of bibliography with machine learning
Automatic extraction of bibliography with machine learning Takeshi ABEKAWA Hidetsugu NANBA Hiroya TAKAMURA Manabu OKUMURA Abstract In this paper, we propose an extraction method of bibliography using support
Διαβάστε περισσότεραCSJ. Speaker clustering based on non-negative matrix factorization using i-vector-based speaker similarity
i-vector 1 1 1 1 i-vector CSJ i-vector Speaker clustering based on non-negative matrix factorization using i-vector-based speaker similarity Fukuchi Yusuke 1 Tawara Naohiro 1 Ogawa Tetsuji 1 Kobayashi
Διαβάστε περισσότεραJapanese Fuzzy String Matching in Cooking Recipes
1 Japanese Fuzzy String Matching in Cooking Recipes Michiko Yasukawa 1 In this paper, we propose Japanese fuzzy string matching in cooking recipes. Cooking recipes contain spelling variants for recipe
Διαβάστε περισσότερα[4] 1.2 [5] Bayesian Approach min-max min-max [6] UCB(Upper Confidence Bound ) UCT [7] [1] ( ) Amazons[8] Lines of Action(LOA)[4] Winands [4] 1
1,a) Bayesian Approach An Application of Monte-Carlo Tree Search Algorithm for Shogi Player Based on Bayesian Approach Daisaku Yokoyama 1,a) Abstract: Monte-Carlo Tree Search (MCTS) algorithm is quite
Διαβάστε περισσότεραHomomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότεραΠανεπιστήμιο Κρήτης, Τμήμα Επιστήμης Υπολογιστών Άνοιξη 2009. HΥ463 - Συστήματα Ανάκτησης Πληροφοριών Information Retrieval (IR) Systems
Πανεπιστήμιο Κρήτης, Τμήμα Επιστήμης Υπολογιστών Άνοιξη 2009 HΥ463 - Συστήματα Ανάκτησης Πληροφοριών Information Retrieval (IR) Systems Στατιστικά Κειμένου Text Statistics Γιάννης Τζίτζικας άλ ιάλεξη :
Διαβάστε περισσότεραsubstructure similarity search using features in graph databases
substructure similarity search using features in graph databases Aleksandros Gkogkas Distributed Management of Data Laboratory intro Θα ενασχοληθούμε με το πρόβλημα των ερωτήσεων σε βάσεις γραφημάτων.
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραP t s st t t t t2 t s st t t rt t t tt s t t ä ör tt r t r 2ö r t ts t t t t t t st t t t s r s s s t är ä t t t 2ö r t ts rt t t 2 r äärä t r s Pr r
r s s s t t P t s st t t t t2 t s st t t rt t t tt s t t ä ör tt r t r 2ö r t ts t t t t t t st t t t s r s s s t är ä t t t 2ö r t ts rt t t 2 r äärä t r s Pr r t t s st ä r t str t st t tt2 t s s t st
Διαβάστε περισσότεραAbstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
Διαβάστε περισσότεραStudy on Re-adhesion control by monitoring excessive angular momentum in electric railway traction
() () Study on e-adhesion control by monitoring excessive angular momentum in electric railway traction Takafumi Hara, Student Member, Takafumi Koseki, Member, Yutaka Tsukinokizawa, Non-member Abstract
Διαβάστε περισσότεραΠρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής
Πρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής Να γραφεί πρόγραμμα το οποίο δέχεται ως είσοδο μια ακολουθία S από n (n 40) ακέραιους αριθμούς και επιστρέφει ως έξοδο δύο ακολουθίες από θετικούς ακέραιους
Διαβάστε περισσότεραAVL-trees C++ implementation
Τ Μ Η Μ Α Μ Η Χ Α Ν Ι Κ Ω Ν Η / Υ Κ Α Ι Π Λ Η Ρ Ο Φ Ο Ρ Ι Κ Η Σ AVL-trees C++ implementation Δομές Δεδομένων Μάριος Κενδέα 31 Μαρτίου 2015 kendea@ceid.upatras.gr Εισαγωγή (1/3) Δυαδικά Δένδρα Αναζήτησης:
Διαβάστε περισσότεραBCI On Feature Extraction from Multi-Channel Brain Waves Used for Brain Computer Interface
BCI On Feature Extraction from Multi-Channel Brain Waves Used for Brain Computer Interface Hiroya SAITO Kenji NAKAYAMA Akihiro HIRANO Graduate School of Natural Science and Technology,Kanazawa Univ. E-mail:
Διαβάστε περισσότεραMaxima SCORM. Algebraic Manipulations and Visualizing Graphs in SCORM contents by Maxima and Mashup Approach. Jia Yunpeng, 1 Takayuki Nagai, 2, 1
Maxima SCORM 1 2, 1 Muhammad Wannous 1 3, 4 2, 4 Maxima Web LMS MathML HTML5 Flot jquery JSONP JavaScript SCORM SCORM Algebraic Manipulations and Visualizing Graphs in SCORM contents by Maxima and Mashup
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραΑλγόριθμοι Ταξινόμησης Μέρος 3
Αλγόριθμοι Ταξινόμησης Μέρος 3 Μανόλης Κουμπαράκης 1 Ταξινόμηση με Ουρά Προτεραιότητας Θα παρουσιάσουμε τώρα δύο αλγόριθμους ταξινόμησης που χρησιμοποιούν μια ουρά προτεραιότητας για την υλοποίηση τους.
Διαβάστε περισσότεραFX10 SIMD SIMD. [3] Dekker [4] IEEE754. a.lo. (SpMV Sparse matrix and vector product) IEEE754 IEEE754 [5] Double-Double Knuth FMA FMA FX10 FMA SIMD
FX,a),b),c) Bailey Double-Double [] FMA FMA [6] FX FMA SIMD Single Instruction Multiple Data 5 4.5. [] Bailey SIMD SIMD 8bit FMA (SpMV Sparse matrix and vector product) FX. DD Bailey Double-Double a) em49@ns.kogakuin.ac.jp
Διαβάστε περισσότεραChap. 6 Pushdown Automata
Chap. 6 Pushdown Automata 6.1 Definition of Pushdown Automata Example 6.1 L = {wcw R w (0+1) * } P c 0P0 1P1 1. Start at state q 0, push input symbol onto stack, and stay in q 0. 2. If input symbol is
Διαβάστε περισσότεραVol. 31,No JOURNAL OF CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY Feb
Ξ 31 Vol 31,No 1 2 0 0 1 2 JOURNAL OF CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY Feb 2 0 0 1 :025322778 (2001) 0120016205 (, 230026) : Q ( m 1, m 2,, m n ) k = m 1 + m 2 + + m n - n : Q ( m 1, m 2,, m
Διαβάστε περισσότεραRetrieval of Seismic Data Recorded on Open-reel-type Magnetic Tapes (MT) by Using Existing Devices
No. 3 + 1,**- Technical Research Report, Earthquake Research Institute, University of Tokyo, No. 3, pp. + 1,,**-. MT * ** *** Retrieval of Seismic Data Recorded on Open-reel-type Magnetic Tapes (MT) by
Διαβάστε περισσότεραSolving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques
Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques Raphael Chenouard, Patrick Sébastian, Laurent Granvilliers To cite this version: Raphael
Διαβάστε περισσότεραGraph Algorithms. Παρουσίαση στα πλαίσια του μαθήματος «Παράλληλοι Αλγόριθμοι» Καούρη Γεωργία Μήτσου Βασιλική
Graph Algorithms Παρουσίαση στα πλαίσια του μαθήματος «Παράλληλοι Αλγόριθμοι» Καούρη Γεωργία Μήτσου Βασιλική Περιεχόμενα minimum weight spanning tree connected components transitive closure shortest paths
Διαβάστε περισσότεραΑνάκληση Πληποφοπίαρ. Information Retrieval. Διδάζκων Δημήηριος Καηζαρός
Ανάκληση Πληποφοπίαρ Information Retrieval Διδάζκων Δημήηριος Καηζαρός Διάλεξη 4η: 04/03/2017 1 Phrase queries 2 Ερωτήματα φράσεως Έστω ότι επιθυμούμε ν απαντήσουμε ερωτήματα της μορφής stanford university
Διαβάστε περισσότεραΔιάλεξη 14: Δέντρα IV - B-Δένδρα
ΕΠΛ231 Δομές Δεδομένων και Αλγόριθμοι 1 Διάλεξη 14: Δέντρα IV - B-Δένδρα Στην ενότητα αυτή θα μελετηθούν τα εξής επιμέρους θέματα: - 2-3 Δένδρα, Εισαγωγή και άλλες πράξεις - Άλλα Δέντρα: Β-δένδρα, Β+-δέντρα,
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραA Study on Segmentation of Artificial Grayscale Image for Vector Conversion
367 35 111 A31 E-mail kawamura@suou.waseda.jp TV A Study on Segmentation of Artificial Grayscale Image for Vector Conversion Kei KAWAMURA, Daisuke ISHII, and Hiroshi WATANABE Graduate School of Global
Διαβάστε περισσότεραAn Efficient Calculation of Set Expansion using Zero-Suppressed Binary Decision Diagrams
22 27 2 SP-C 2012 2011 Short Paper ZDD An Eicient Calculation o Set Expansion using Zero-Suppressed Binary Decision Diagrams Masaaki Nishino Norihito Yasuda Toru Kobayashi NTT Cyber Solutions Laboratories,
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραResurvey of Possible Seismic Fissures in the Old-Edo River in Tokyo
Bull. Earthq. Res. Inst. Univ. Tokyo Vol. 2.,**3 pp.,,3,.* * +, -. +, -. Resurvey of Possible Seismic Fissures in the Old-Edo River in Tokyo Kunihiko Shimazaki *, Tsuyoshi Haraguchi, Takeo Ishibe +, -.
Διαβάστε περισσότεραApr Vol.26 No.2. Pure and Applied Mathematics O157.5 A (2010) (d(u)d(v)) α, 1, (1969-),,.
2010 4 26 2 Pure and Applied Matheatics Apr. 2010 Vol.26 No.2 Randić 1, 2 (1., 352100; 2., 361005) G Randić 0 R α (G) = v V (G) d(v)α, d(v) G v,α. R α,, R α. ; Randić ; O157.5 A 1008-5513(2010)02-0339-06
Διαβάστε περισσότεραOrthogonalization Library with a Numerical Computation Policy Interface
Vol. 46 No. SIG 7(ACS 10) May 2005 DGKS PC 10 8 10 14 4.8 Orthogonalization Library with a Numerical Computation Policy Interface Ken Naono, Mitsuyoshi Igai and Hiroyuki Kidachi We propose an orthogonalization
Διαβάστε περισσότεραencouraged to use the Version of Record that, when published, will replace this version. The most /BCJ BIOCHEMICAL JOURNAL
Biochemical Journal: this is an Accepted Manuscript, not the final Version of Record. You are encouraged to use the Version of Record that, when published, will replace this version. The most up-to-date
Διαβάστε περισσότεραΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ
ΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ Ενότητα 12: Συνοπτική Παρουσίαση Ανάπτυξης Κώδικα με το Matlab Σαμαράς Νικόλαος Άδειες Χρήσης Το παρόν εκπαιδευτικό υλικό υπόκειται σε άδειες χρήσης Creative Commons.
Διαβάστε περισσότεραHIV HIV HIV HIV AIDS 3 :.1 /-,**1 +332
,**1 The Japanese Society for AIDS Research The Journal of AIDS Research +,, +,, +,, + -. / 0 1 +, -. / 0 1 : :,**- +,**. 1..+ - : +** 22 HIV AIDS HIV HIV AIDS : HIV AIDS HIV :HIV AIDS 3 :.1 /-,**1 HIV
Διαβάστε περισσότεραΑΠΟΔΟΤΙΚΗ ΑΠΟΤΙΜΗΣΗ ΕΡΩΤΗΣΕΩΝ OLAP Η ΜΕΤΑΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΕΞΕΙΔΙΚΕΥΣΗΣ. Υποβάλλεται στην
ΑΠΟΔΟΤΙΚΗ ΑΠΟΤΙΜΗΣΗ ΕΡΩΤΗΣΕΩΝ OLAP Η ΜΕΤΑΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΕΞΕΙΔΙΚΕΥΣΗΣ Υποβάλλεται στην ορισθείσα από την Γενική Συνέλευση Ειδικής Σύνθεσης του Τμήματος Πληροφορικής Εξεταστική Επιτροπή από την Χαρά Παπαγεωργίου
Διαβάστε περισσότεραΗΥ360 Αρχεία και Βάσεις εδοµένων
ΗΥ360 Αρχεία και Βάσεις εδοµένων ιδάσκων:. Πλεξουσάκης Tutorial B-Trees, B+Trees Μπαριτάκης Παύλος 2018-2019 Ιδιότητες B-trees Χρήση για μείωση των προσπελάσεων στον δίσκο Επέκταση των Binary Search Trees
Διαβάστε περισσότεραand algorithms CONTENTS Process for Design and Analysis of Algorithms Understanding the Problem
Contents i advanced anced data structures and algorithms FOR m.tech (jntu - hyderabad) i year i semester (COMMON TO CSE, CS,, IT,, WT AND SE) CONTENTS UNIT - I [CH. H. - 1] ] [INTRODUCTION INTRODUCTION]...
Διαβάστε περισσότεραΗΜΥ 210 ΣΧΕΔΙΑΣΜΟΣ ΨΗΦΙΑΚΩΝ ΣΥΣΤΗΜΑΤΩΝ. Χειµερινό Εξάµηνο ΔΙΑΛΕΞΗ 3: Αλγοριθµική Ελαχιστοποίηση (Quine-McCluskey, tabular method)
ΗΜΥ 210 ΣΧΕΔΙΑΣΜΟΣ ΨΗΦΙΑΚΩΝ ΣΥΣΤΗΜΑΤΩΝ Χειµερινό Εξάµηνο 2016 ΔΙΑΛΕΞΗ 3: Αλγοριθµική Ελαχιστοποίηση (Quine-McCluskey, tabular method) ΧΑΡΗΣ ΘΕΟΧΑΡΙΔΗΣ Επίκουρος Καθηγητής, ΗΜΜΥ (ttheocharides@ucy.ac.cy)
Διαβάστε περισσότεραTechnical Information T-9100 SI. Suva. refrigerants. Thermodynamic Properties of. Suva Refrigerant [R-410A (50/50)]
d Suva refrigerants Technical Information T-9100SI Thermodynamic Properties of Suva 9100 Refrigerant [R-410A (50/50)] Thermodynamic Properties of Suva 9100 Refrigerant SI Units New tables of the thermodynamic
Διαβάστε περισσότεραHOSVD. Higher Order Data Classification Method with Autocorrelation Matrix Correcting on HOSVD. Junichi MORIGAKI and Kaoru KATAYAMA
DEIM Forum 2010 D1-4 HOSVD 191-0065 6-6 E-mail: j.morigaki@gmail.com, katayama@tmu.ac.jp Lathauwer (HOSVD) (Tensor) HOSVD Savas HOSVD Sun HOSVD,, Higher Order Data Classification Method with Autocorrelation
Διαβάστε περισσότεραCeramic PTC Thermistor Overload Protection
FEATURES compliant CPTD type are bare disc type CPTL type are leaded Low, medium and high voltage ratings Low resistance; Small size No need to reset supply after overload No noise generated Stable over
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραFP series Anti-Bend (Soft termination) capacitor series
FP series Anti-Bend (Soft termination) capacitor series Features Applications» High performance to withstanding 5mm of substrate» For general digital circuit bending test guarantee» For power supply bypass
Διαβάστε περισσότεραΕποχές( 1. Εποχή(του(mainframe((πολλοί( χρήστες,(ένας(υπολογιστής)(( 2. Εποχή(του(PC((ένας(χρήστης,(
Κίνητρα( Η(εξάπλωση(των(υπολογιστικών(συσκευών( Πως(έγινε;( Ανάγκη(για(πληροφορία( Προς(τι;( Εφαρμογές(του(διάχυτου(υπολογισμού( Μπορούμε(να(σχεδιάσουμε(&(να(αναπτύξουμε(ώστε(οι( άνθρωποι(να(μπορούν(να(τον(χρησιμοποιούν(
Διαβάστε περισσότεραΑνάκτηση Πληροφορίας
Το Πιθανοκρατικό Μοντέλο Κλασικά Μοντέλα Ανάκτησης Τρία είναι τα, λεγόμενα, κλασικά μοντέλα ανάκτησης: Λογικό (Boolean) που βασίζεται στη Θεωρία Συνόλων Διανυσματικό (Vector) που βασίζεται στη Γραμμική
Διαβάστε περισσότεραΠΛΕ- 027 Μικροεπεξεργαστές
ΠΛΕ- 027 Μικροεπεξεργαστές 1ο μάθημα: εισαγωγή, διαδικαστικά θέματα, απόδοση υπολογιστών Διδάσκοντας: Αρης Ευθυμίου Πηγές διαφανειών: συνοδευτικές διαφάνειες αγγλικης εκδοσης του βιβλιου Γενικές πληροφορίες
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραVBA Microsoft Excel. J. Comput. Chem. Jpn., Vol. 5, No. 1, pp (2006)
J. Comput. Chem. Jpn., Vol. 5, No. 1, pp. 29 38 (2006) Microsoft Excel, 184-8588 2-24-16 e-mail: yosimura@cc.tuat.ac.jp (Received: July 28, 2005; Accepted for publication: October 24, 2005; Published on
Διαβάστε περισσότεραDuPont Suva 95 Refrigerant
Technical Information T-95 SI DuPont Suva refrigerants Thermodynamic Properties of DuPont Suva 95 Refrigerant (R-508B) The DuPont Oval Logo, The miracles of science, and Suva, are trademarks or registered
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραDuPont Suva 95 Refrigerant
Technical Information T-95 ENG DuPont Suva refrigerants Thermodynamic Properties of DuPont Suva 95 Refrigerant (R-508B) The DuPont Oval Logo, The miracles of science, and Suva, are trademarks or registered
Διαβάστε περισσότερα2016 IEEE/ACM International Conference on Mobile Software Engineering and Systems
2016 IEEE/ACM International Conference on Mobile Software Engineering and Systems Multiple User Interfaces MobileSoft'16, Multi-User Experience (MUX) S1: Insourcing S2: Outsourcing S3: Responsive design
Διαβάστε περισσότεραDevelopment and Verification of Multi-Level Sub- Meshing Techniques of PEEC to Model High- Speed Power and Ground Plane-Pairs of PFBS
Rose-Hulman Institute of Technology Rose-Hulman Scholar Graduate Theses - Electrical and Computer Engineering Graduate Theses Spring 5-2015 Development and Verification of Multi-Level Sub- Meshing Techniques
Διαβάστε περισσότερα: Monte Carlo EM 313, Louis (1982) EM, EM Newton-Raphson, /. EM, 2 Monte Carlo EM Newton-Raphson, Monte Carlo EM, Monte Carlo EM, /. 3, Monte Carlo EM
2008 6 Chinese Journal of Applied Probability and Statistics Vol.24 No.3 Jun. 2008 Monte Carlo EM 1,2 ( 1,, 200241; 2,, 310018) EM, E,,. Monte Carlo EM, EM E Monte Carlo,. EM, Monte Carlo EM,,,,. Newton-Raphson.
Διαβάστε περισσότεραDEIM Forum 2014 A8-1, 606 8501 E-mail: {tsukuda,ohshima,kato,tanaka}@dl.kuis.kyoto-u.ac.jp 1 2,, 1. Google 1 Yahoo 2 Bing 3 Web Web BM25 [1] HITS [2] PageRank [3] Web 1 [4] 1http://www.google.com 2http://www.yahoo.com
Διαβάστε περισσότεραErkki Mäkinen ja Timo Poranen Algoritmit
rkki Mäkinen ja Timo Poranen Algoritmit TITOJNKÄSITTLYTITIDN LAITOS TAMPRN YLIOPISTO D 2008 6 TAMPR 2009 TAMPRN YLIOPISTO TITOJNKÄSITTLYTITIDN LAITOS JULKAISUSARJA D VRKKOJULKAISUT D 2008 6, TOUKOKUU 2009
Διαβάστε περισσότεραHigh order interpolation function for surface contact problem
3 016 5 Journal of East China Normal University Natural Science No 3 May 016 : 1000-564101603-0009-1 1 1 1 00444; E- 00030 : Lagrange Lobatto Matlab : ; Lagrange; : O41 : A DOI: 103969/jissn1000-56410160300
Διαβάστε περισσότεραEE434 ASIC & Digital Systems Arithmetic Circuits
EE434 ASIC & Digital Systems Arithmetic Circuits Spring 25 Dae Hyun Kim daehyun@eecs.wsu.edu Arithmetic Circuits What we will learn Adders Basic High-speed 2 Adder -bit adder SSSSSS = AA BB CCCC CCCC =
Διαβάστε περισσότεραΕΦΑΡΜΟΓΗ ΕΥΤΕΡΟΒΑΘΜΙΑ ΕΠΕΞΕΡΓΑΣΜΕΝΩΝ ΥΓΡΩΝ ΑΠΟΒΛΗΤΩΝ ΣΕ ΦΥΣΙΚΑ ΣΥΣΤΗΜΑΤΑ ΚΛΙΝΗΣ ΚΑΛΑΜΙΩΝ
ΤΕΧΝΟΛΟΓΙΚΟ ΕΚΠΑΙ ΕΥΤΙΚΟ Ι ΡΥΜΑ ΚΡΗΤΗΣ ΤΜΗΜΑ ΦΥΣΙΚΩΝ ΠΟΡΩΝ ΚΑΙ ΠΕΡΙΒΑΛΛΟΝΤΟΣ ΕΦΑΡΜΟΓΗ ΕΥΤΕΡΟΒΑΘΜΙΑ ΕΠΕΞΕΡΓΑΣΜΕΝΩΝ ΥΓΡΩΝ ΑΠΟΒΛΗΤΩΝ ΣΕ ΦΥΣΙΚΑ ΣΥΣΤΗΜΑΤΑ ΚΛΙΝΗΣ ΚΑΛΑΜΙΩΝ ΕΠΙΜΕΛΕΙΑ: ΑΡΜΕΝΑΚΑΣ ΜΑΡΙΝΟΣ ΧΑΝΙΑ
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότεραΕΘΝΙΚΟ ΚΑΙ ΚΑΠΟΔΙΣΤΡΙΑΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΑΘΗΝΩΝ ΣΧΟΛΗ ΘΕΤΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΚΑΙ ΤΗΛΕΠΙΚΟΙΝΩΝΙΩΝ
ΕΘΝΙΚΟ ΚΑΙ ΚΑΠΟΔΙΣΤΡΙΑΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΑΘΗΝΩΝ ΣΧΟΛΗ ΘΕΤΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΚΑΙ ΤΗΛΕΠΙΚΟΙΝΩΝΙΩΝ ΠΡΟΓΡΑΜΜΑ ΜΕΤΑΠΤΥΧΙΑΚΩΝ ΣΠΟΥΔΩΝ "ΤΕΧΝΟΛΟΓΙΕΣ ΠΛΗΡΟΦΟΡΙΚΗΣ ΣΤΗΝ ΙΑΤΡΙΚΗ ΚΑΙ ΤΗ ΒΙΟΛΟΓΙΑ" ΔΙΠΛΩΜΑΤΙΚΗ
Διαβάστε περισσότεραΑυτόματη Ανακατασκευή Θραυσμένων Αντικειμένων
Αυτόματη Ανακατασκευή Θραυσμένων Αντικειμένων Κωνσταντίνος Παπαοδυσσεύς Καθηγητής ΣΗΜΜΥ, Δημήτρης Αραμπατζής Δρ. ΣΗΜΜΥ Σολομών Ζάννος Υ.Δ. ΣΗΜΜΥ Φώτιος Γιαννόπουλος Υ.Δ. ΣΗΜΜΥ Μιχαήλ Έξαρχος Δρ. ΣΗΜΜΥ
Διαβάστε περισσότερα