02865nam 2200613 a 450 991097362230332120200520144314.097802680756750268075670(CKB)2560000000052314(SSID)ssj0000483626(PQKBManifestationID)11338872(PQKBTitleCode)TC0000483626(PQKBWorkID)10572628(PQKB)10722002(OCoLC)694144476(MdBmJHUP)muse14861(Au-PeEL)EBL3440994(CaPaEBR)ebr10423319(MiAaPQ)EBC3440994(Perlego)3801887(EXLCZ)99256000000005231420090720d2009 uy 0engurcn|||||||||txtccrCriminality, public security, and the challenge to democracy in Latin America /edited by Marcelo Bergman and Laurence Whitehead1st ed.Notre Dame, Ind. University of Notre Dame Pressc2009xiv, 344 p. ill., mapsFrom the Helen Kellogg Institute for International Studies"Recent titles from the Helen Kellogg Institute for International Studies"--P. facing t.p.9780268022136 0268022135 Includes bibliographical references and index.Intro -- contents -- acronyms -- Introduction -- Trends in Criminality -- Regional Homicide Patterns in Brazil -- Citizen (In)Security in Chile, 1980-2007 -- Rising Crime in Mexico and Buenos Aires -- Police and Criminal Justice Reform -- La Mano Dura -- Public Opinion and the Police in Chile -- The Weaknesses of Public Security Forces in Mexico City -- The Pursuit of Efficiency and the Colombian Criminal Justice System -- Criminal Process Reform and Citizen Security -- Latin America's Prisons -- Citizen Security, Democratization, and the Rule of Law -- "Security Traps" and Democratic Governability in Latin America -- Citizen Insecurity and Democracy -- bibliography -- contributors -- index.The contributors to this book offer a collective assessment of some of the causes for the alarming rise in criminal activity in Latin America as new democratic regimes have taken root.Criminal statisticsLatin AmericaDemocracyLatin AmericaCriminal statisticsDemocracy364.98Bergman Marcelo864993Whitehead Laurence123938Helen Kellogg Institute for International Studies.MiAaPQMiAaPQMiAaPQBOOK9910973622303321Criminality, public security, and the challenge to democracy in Latin America4354927UNINA04173nam 22006375 450 991056823960332120251113175324.03-030-97568-110.1007/978-3-030-97568-5(MiAaPQ)EBC6977367(Au-PeEL)EBL6977367(CKB)22046197700041(PPN)269155244(OCoLC)1315540704(DE-He213)978-3-030-97568-5(EXLCZ)992204619770004120220506d2022 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierCohesive Subgraph Search Over Large Heterogeneous Information Networks /by Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang1st ed. 2022.Cham :Springer International Publishing :Imprint: Springer,2022.1 online resource (86 pages)SpringerBriefs in Computer Science,2191-5776Print version: Fang, Yixiang Cohesive Subgraph Search over Large Heterogeneous Information Networks Cham : Springer International Publishing AG,c2022 9783030975678 Includes bibliographical references (pages 65-74).Introduction -- Preliminaries -- CSS on Bipartite Networks -- CSS on Other General HINs -- Comparison Analysis -- Related Work on CSMs and solutions -- Future Work and Conclusion.This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs. The authors first classify the existing works of CSS over HINs according to the classic cohesiveness metrics such as core, truss, clique, connectivity, density, etc., and then extensively review the specific models and their corresponding search solutions in each group. Note that since the bipartite network is a special case of HINs, all the models developed for general HINs can be directly applied to bipartite networks, but the models customized for bipartite networks may not be easily extended for other general HINs due to their restricted settings. The authors also analyze and compare these cohesive subgraph models (CSMs) and solutions systematically. Specifically, the authors compare different groups of CSMs and analyze both their similarities and differences, from multiple perspectives such as cohesiveness constraints, shared properties, and computational efficiency. Then, for the CSMs in each group, the authors further analyze and compare their model properties and high-level algorithm ideas. This SpringerBrief targets researchers, professors, engineers and graduate students, who are working in the areas of graph data management and graph mining. Undergraduate students who are majoring in computer science, databases, data and knowledge engineering, and data science will also want to read this SpringerBrief.SpringerBriefs in Computer Science,2191-5776Information storage and retrieval systemsComputer scienceMathematicsDiscrete mathematicsGraph theoryInformation Storage and RetrievalDiscrete Mathematics in Computer ScienceGraph TheoryInformation storage and retrieval systems.Computer scienceMathematics.Discrete mathematics.Graph theory.Information Storage and Retrieval.Discrete Mathematics in Computer Science.Graph Theory.006.312006.312Fang Yixiang1227727MiAaPQMiAaPQMiAaPQBOOK9910568239603321Cohesive subgraph search over large heterogeneous information networks2989205UNINA