03145nam 2200745Ia 450 991095549180332120200520144314.0979-82-16-34607-41-280-77010-497866136808770-7391-4867-2(CKB)2550000000104159(EBL)943682(OCoLC)850192840(SSID)ssj0000681615(PQKBManifestationID)12240936(PQKBTitleCode)TC0000681615(PQKBWorkID)10663411(PQKB)10753323(Au-PeEL)EBL943682(CaPaEBR)ebr10570643(CaONFJC)MIL368087(MiAaPQ)EBC943682(EXLCZ)99255000000010415920110615d2011 uy 0engur|n|---|||||txtrdacontentcrdamediacrrdacarrierMyth, identity, and conflict a comparative analysis of Romanian and Serbian textbooks /Anamaria Dutceac SegestenLanham, Md. Lexington Booksc20111 online resource (314 pages)Description based upon print version of record.0-7391-4865-6 Includes bibliographical references and index.MYTH, IDENTITY, AND CONFLICT; Contents; Acknowledgments; 1 Introduction; 2 The History Textbook in Context; 3 Education, Conict, and Ethnic Identity; 4 Myth; 5 Romanian National Myths; 6 Serbian National Myths; 7 Common Myths to Serbia and Romania; 8 Myths in Textbooks; 9 Representation of the Self; 10 Representation of the Other; 11 Conclusion; Appendix; Bibliography; IndexMyth, Identity, and Conflict: A Comparative Analysis of Romanian and Serbian Textbooks, by Anamaria Dutceac Segesten, is an examination of how history and politics became entangled in Romania and Serbia. Segesten's findings confirm the presence of mythologized versions of the past in the history textbooks of both countries over the entire fifteen-year period studied (1992-2007), despite claims for professionalization of textbook-making.Ethnic attitudesRomaniaEthnic attitudesSerbiaGroup identityRomaniaGroup identitySerbiaMythology, RomanianMythology, SlavicSerbiaRomaniaHistoriographyPolitical aspectsRomaniaHistoryTextbooksPolitical aspectsSerbiaHistoriographyPolitical aspectsSerbiaHistoryTextbooksPolitical aspectsEthnic attitudesEthnic attitudesGroup identityGroup identityMythology, Romanian.Mythology, Slavic327.49804971POL011000bisacsh7,41ssgnDutceac Segesten Anamaria1975-1820369MiAaPQMiAaPQMiAaPQBOOK9910955491803321Myth, identity, and conflict4382260UNINA06328nam 22008295 450 991098614400332120251116222317.09789819610907981961090710.1007/978-981-96-1090-7(CKB)37776398800041(MiAaPQ)EBC31943577(Au-PeEL)EBL31943577(OCoLC)1511109536(DE-He213)978-981-96-1090-7(EXLCZ)993777639880004120250305d2025 u| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierComputing and Combinatorics 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I /edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang1st ed. 2025.Singapore :Springer Nature Singapore :Imprint: Springer,2025.1 online resource (1099 pages)Lecture Notes in Computer Science,1611-3349 ;151619789819610891 9819610893 -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbb{Z}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs.This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024. The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing. .Lecture Notes in Computer Science,1611-3349 ;15161Computer scienceImage processingDigital techniquesComputer visionData structures (Computer science)Information theoryComputer scienceMathematicsDiscrete mathematicsNumerical analysisTheory of ComputationComputer Imaging, Vision, Pattern Recognition and GraphicsData Structures and Information TheoryDiscrete Mathematics in Computer ScienceSymbolic and Algebraic ManipulationNumerical AnalysisComputer science.Image processingDigital techniques.Computer vision.Data structures (Computer science)Information theory.Computer scienceMathematics.Discrete mathematics.Numerical analysis.Theory of Computation.Computer Imaging, Vision, Pattern Recognition and Graphics.Data Structures and Information Theory.Discrete Mathematics in Computer Science.Symbolic and Algebraic Manipulation.Numerical Analysis.004.0151Chen Yong922822Gao Xiaofeng1784932Sun Xiaoming1955-1233993Zhang An1784933MiAaPQMiAaPQMiAaPQBOOK9910986144003321Computing and Combinatorics4524116UNINA