Demystifying Museum Soft Power

You are invited to celebrate the completion of a research project that has sought to define, explain and deconstruct the ‘soft power’ of museums. Spanning museums’ contributions to place branding, urban regeneration and the development of tourism, the concept of ‘soft power’ is an increasingly valuable metric for the GLAM sector, providing a unique set of insights. Click here for more information and registration.

 When: Wednesday, October 24th, 5:00-6:00 pm

Where: The Lab, Level 2 of the Digital Studio, West Wing of Arts West

 

Spatial@Melbourne at Arts

Spatial@Melbourne is hosting an afternoon tea session at the Faculty of Arts to discuss the opportunities for collaboration between the spatial community interested in interdisciplinary projects. The session will include a 5-minute talk by Michael Rigby (AURIN) on Digital Humanities.

Please note the change of venue

Where: Linkway, 4th floor John Medley Building (Building 191), The University of Melbourne

When: Wednesday Oct 3rd, 3:00-3:30pm

FOSS4G SotM Oceania 2018 – Conference

The overall FOSS4G SotM Oceania event will include a full day of workshops, a 2 day conference, a community day, and social events in the vibrant, yet laid back city of Melbourne. Student registrations are now open and there are a limited number of student registrations at a discounted rate of $250.

The conference is looking for volunteers. For more information about the call for volunteers visit here. Also, if you are interested in being a coordinator (paid opportunity) for the conference contact admin@foss4g-oceania.org.

 

FOSS4G SotM Oceania – Student registrations

There is a limited number of student registrations for FOSS4G OCeania, which will go first to students who are presenting at the conference (presentations or workshops). As a reminder, presentation submissions are due on 31 August, so get your abstracts ready!

Any remaining student registrations will be released in mid-October and will be first come, first served. See the Registration page for more details on the different registrations available”

 

View this link to get more information:  https://foss4g-oceania.org/news/student-registrations-will-be-available

Day registration for GIScience 2018

Some special day tickets are available for GIScience 2018 for $100 ($50 for the Friday half-day). These tickets are only open to researchers at the University of Melbourne and RMIT University, and only available until 19th August. They don’t include any social events/goodie bags etc., only the technical program. So, in case you don’t fancy registering for the whole conference, but still fancy seeing some of the technical program (see: http://giscience.org/full-conference-program/) there is an option to register for just one day of your choice here.

Open Data Survey

The University of Melbourne has partnered with the Department of Premier and Cabinet (DPC) in Victoria, Australia to develop a survey on open data. The survey, Open Data in Practice: Attitudes of Government Agency Workers, is now open to participants. It aims to capture the attitudes of open data workers and other stakeholders towards open data and evaluate the current state of open data policies across Australia.

To complete the survey, visit https://www.surveymonkey.com/r/5C5MW6G

For more information about this research project, see https://networkedsociety.unimelb.edu.au/research/projects/active/open-data-practice

Using Geographic Information in a HASS Virtual Lab: Geocoding Requirements

Researchers in the humanities are increasingly adopting new technologies and engaging with a variety of digital resources and services. With the increasing availability of both historic and real-time data, there is an increasing opportunity for researchers to harness the power of geographic information (GI) to support exploration, analysis and presentation tasks. The goal of this 2 hour interactive workshop is to principally understand how HASS researchers using GI can be supported with geocoding tools.

Audience: Researchers with direct experience using geographic information and geocoding tools are encouraged to attend.

When: Thursday, 3rd May, 10:00 am- 12:00 pm.

Where: The Lab, Level 2 of the Digital Studio, West Wing of Arts West (access via the rear lift).

More details can be found here.

Public Seminar by Prof Hanan Samet, University of Maryland

Title: INDEXING METHODS FOR GAME DATABASES TUNED FOR REDUCING MOTION UPDATE TIMES*
Who: Prof Hanan Samet, Department of Computer Science, University of Maryland.
When: Thursday 22nd March, 11:00 am – 12:00 pm.
Where: PAR-Old Geology-G04 (Theatre 1), The University of Melbourne
Abstract:
Moving object databases arise in numerous applications such as traffic monitoring, crowd tracking, and games.  They all require keeping track of objects that move and thus the database of objects must be constantly updated.  The cover fieldtree (more commonly known as the loose quadtree and the loose octree, depending on the dimension of the underlying space) is designed to overcome the drawback of spatial data structures that associate objects with their minimum enclosing quadtree (octree) cells which is that the size of these cells depends more on the position of the objects and less on their size.  In fact, the size of these cells may be as large as the entire space from which the objects are drawn.  The loose quadtree (octree) overcomes this drawback by expanding the size of the space that is spanned by each quadtree (octree) cell c of width w by a cell expansion factor p (p>0) so that the expanded cell is of width (1+p)*w and an object is associated with its minimum enclosing expanded quadtree (octree)
cell. It is shown that for an object o with minimum bounding hypercube box b of radius r (i.e., half the length of a side of the hypercube), the maximum possible width w of the minimum enclosing expanded
quadtree cell c is just a function of r and p, and is independent of the position of o.  Normalizing w via division by 2r enables calculating the range of possible expanded quadtree cell sizes as a function of p.  For p>= 0.5 the range consists of just two values and usually just one value for p>=1.  This makes updating very simple and fast as for p >= 0.5, there are at most two possible new cells associated with the moved object and thus the update can be done in O(1) time.  Experiments with random data showed that the update time to support motion in such an environment is minimized when p is infinitesimally less than 1, with as much as a one order of magnitude increase in the number of updates that can be handled vis-a-vis the p=0 case in a given unit of time.  Similar results for updates were obtained for an N-body simulation where improved query performance and scalability were also observed.  Finally, in order amplify the result, a video titled “Crates and Barrels” is available which is an N-body simulation of 14,000 objects.  The video as well as a JAVA applet that illustrates the behavior of the loose quadtree are both available from here.
* Appeared in the Proceedings of the {ACM SIGMOD  Conference, pp. 169–180, New York, June 2013
** Joint work with Jagan Sankaranarayanan and Michael Auerbach
Bio: 
Hanan Samet is a Distinguished University Professor of Computer Science at the University of Maryland, College Park and is a member of the Institute for Computer Studies.  He is also a member of the Computer Vision Laboratory at the Center for Automation Research where he leads a number of research projects on the use of hierarchical data structures for database applications involving spatial data.  He has a Ph.D from Stanford University.  His doctoral dissertation dealt with proving the correctness of translations of LISP programs which was the first work in translation validation and the related concept of proof carrying code.  He is the author of the recent book “Foundations of Multidimensional and Metric Data Structures” published by Morgan-Kaufmann, San Francisco, CA, in 2006, an award winner in the 2006 best book in Computer and Information Science competition of the Professional and Scholarly Publishers (PSP) Group of the American Publishers Association (AAP), and of the first two books on spatial data  structures titled “Design and Analysis of Spatial Data Structures” and “Applications of Spatial Data Structures:  Computer Graphics, Image Processing and GIS” published by Addison-Wesley, Reading, MA, 1990.  He is the Founding Editor-In-Chief of the ACM Transactions on Spatial Algorithms and System (TSAS), the founding chair of ACM SIGSPATIAL, a recipient of the 2009 UCGIS Research Award, 2011 ACM Paris Kanellakis Theory and Practice Award, the 2010 CMPS Board of Visitors Award at the University of Maryland, the 2014 IEEE Computer Society Wallace McDowell Award, and a Fellow of the ACM, IEEE, AAAS, IAPR (International Association for Pattern Recognition), and UCGIS (University Consortium for Geographic Science).  He received best paper awards in the 2007 Computers & Graphics Journal,  the 2008 ACM SIGMOD and SIGSPATIAL ACMGIS Conferences, the 2012 SIGSPATIAL MobiGIS Workshop, and the 2013 SIGSPATIAL GIR Workshop, as well as a best demo paper award at the 2011 and 2016 SIGSPATIAL ACMGIS Conferences.  His paper at the 2009 IEEE International Conference on Data Engineering (ICDE) was selected as one of the best papers for publication in the IEEE Transactions on Knowledge and Data Engineering.  He was elected to the ACM Council as the Capitol Region Representative for the term 1989-1991, and was an ACM Distinguished Speaker for the term 2008-2015.

Spatial@MSD Morning Tea

GIS users, AURIN users, Spatial modellers: Spatial@Melbourne comes to town to collect Melbourne School of Design’s activities and expertise in spatial information, and to help forming networks across groups and faculties. We plan to produce a profile of the faculty activities for the MSSI Newsletter. Please contact Gideon Aschwanden for more information or to RSVP.
When: Friday, 9 March, 10:00 -11:00 am
Where: Level 4 staff room, Melbourne School of Design
BYO mug; cookies served.

Number of posts found: 50

March 2023
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
2728293031  

Follow us