Analyzing the effectiveness of graph metrics for anomaly detection in online social networks

Online social networks can be modelled as graphs; in this paper, we analyze the use of graph metrics for identifying users with anomalous relationships to other users. A framework is proposed for analyzing the effectiveness of various graph theoretic properties such as the number of neighbouring nodes and edges, betweenness centrality, and community cohesiveness in detecting anomalous users. Experimental results on real-world data collected from online social networks show that the majority of users typically have friends who are friends themselves, whereas anomalous users’ graphs typically do not follow this common rule. Empirical analysis also shows that the relationship between average betweenness centrality and edges identifies anomalies more accurately than other approaches.

Developing and benchmarking native Linux applications on Android

Smartphones get increasingly popular where more and more smartphone platforms emerge. Special attention was gained by the open source platform Android which was presented by the Open Handset Alliance (OHA) hosting members like Google, Motorola, and HTC. Android uses a Linux kernel and a stripped-down userland with a custom Java VM set on top. The resulting system joins the advantages of both environments, while third-parties are intended to develop only Java applications at the moment. In this work, we present the benefit of using native applications in Android. Android includes a fully functional Linux, and using it for heavy computational tasks when developing applications can bring in substantional performance increase. We present how to develop native applications and software components, as well as how to let Linux applications and components communicate with Java programs. Additionally, we present performance measurements of native and Java applications executing identical tasks. The results show that native C applications can be up to 30 times as fast as an identical algorithm running in Dalvik VM. Java applications can become a speed-up of up to 10 times if utilizing JNI.

Data requirements and graph data structures for a multi-modal, multi-objective trip planner

Traffic congestion has a significant impact on the economy and environment. Encouraging the use of multimodal transport (public transport, bicycle, park’n’ride, etc.) has been identified by traffic operators as a good strategy to tackle congestion issues and its detrimental environmental impacts. A multi-modal and multi-objective trip planner provides users with various multi-modal options optimised on objectives that they prefer (cheapest, fastest, safest, etc) and has a potential to reduce congestion on both a temporal and spatial scale. The computation of multi-modal and multi-objective trips is a complicated mathematical problem, as it must integrate and utilize a diverse range of large data sets, including both road network information and public transport schedules, as well as optimising for a number of competing objectives, where fully optimising for one objective, such as travel time, can adversely affect other objectives, such as cost. The relationship between these objectives can also be quite subjective, as their priorities will vary from user to user. This paper will first outline the various data requirements and formats that are needed for the multi-modal multi-objective trip planner to operate, including static information about the physical infrastructure within Brisbane as well as real-time and historical data to predict traffic flow on the road network and the status of public transport. It will then present information on the graph data structures representing the road and public transport networks within Brisbane that are used in the trip planner to calculate optimal routes. This will allow for an investigation into the various shortest path algorithms that have been researched over the last few decades, and provide a foundation for the construction of the Multi-modal Multi-objective Trip Planner by the development of innovative new algorithms that can operate the large diverse data sets and competing objectives.

Van der Waals-corrected density functional theory : benchmarking for hydrogen–nanotube and nanotube–nanotube interactions

Density functional theory (DFT) is a powerful approach to electronic structure calculations in extended systems, but suffers currently from inadequate incorporation of long-range dispersion, or Van der Waals (VdW) interactions. VdW-corrected DFT is tested for interactions involving molecular hydrogen, graphite, single-walled carbon nanotubes (SWCNTs), and SWCNT bundles. The energy correction, based on an empirical London dispersion term with a damping function at short range, allows a reasonable physisorption energy and equilibrium distance to be obtained for H2 on a model graphite surface. The VdW-corrected DFT calculation for an (8, 8) nanotube bundle reproduces accurately the experimental lattice constant. For H2 inside or outside an (8, 8) SWCNT, we find the binding energies are respectively higher and lower than that on a graphite surface, correctly predicting the well known curvature effect. We conclude that the VdW correction is a very effective method for implementing DFT calculations, allowing a reliable description of both short-range chemical bonding and long-range dispersive interactions. The method will find powerful applications in areas of SWCNT research where empirical potential functions either have not been developed, or do not capture the necessary range of both dispersion and bonding interactions.

A semi-supervised graph-based algorithm for detecting outliers in online-social-networks

In this paper, we propose a semi-supervised approach of anomaly detection in Online Social Networks. The social network is modeled as a graph and its features are extracted to detect anomaly. A clustering algorithm is then used to group users based on these features and fuzzy logic is applied to assign degree of anomalous behavior to the users of these clusters. Empirical analysis shows effectiveness of this method.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

A methodological framework for benchmarking smart transport cities

Besides responding to challenges of rapid urbanization and growing traffic congestion, the development of smart transport systems has attracted much attention in recent times. Many promising initiatives have emerged over the years. Despite these initiatives, there is still a lack of understanding about an appropriate definition of smart transport system. As such, it is challenging to identify the appropriate indicators of ‘smartness’. This paper proposes a comprehensive and practical framework to benchmark cities according to the smartness in their transportation systems. The proposed methodology was illustrated using a set of data collected from 26 cities across the world through web search and contacting relevant transport authorities and agencies. Results showed that London, Seattle and Sydney were among the world’s top smart transport cities. In particular, Seattle and Paris ranked high in smart private transport services while London and Singapore scored high on public transport services. London also appeared to be the smartest in terms of emergency transport services. The key value of the proposed innovative framework lies in a comparative analysis among cities, facilitating city-to-city learning.

Monitoring and benchmarking government policies and actions to improve the healthiness of food environments : a proposed Government Healthy Food Environment Policy Index

Government action is essential to increase the healthiness of food environments and reduce obesity, diet-related non-communicable diseases (NCDs), and their related inequalities. This paper proposes a monitoring framework to assess government policies and actions for creating healthy food environments. Recommendations from relevant authoritative organizations and expert advisory groups for reducing obesity and NCDs were examined, and pertinent components were incorporated into a comprehensive framework for monitoring government policies and actions. A Government Healthy Food Environment Policy Index (Food-EPI) was developed, which comprises a ‘policy’ component with seven domains on specific aspects of food environments, and an ‘infrastructure support’ component with seven domains to strengthen systems to prevent obesity and NCDs. These were revised through a week-long consultation process with international experts. Examples of good practice statements are proposed within each domain, and these will evolve into benchmarks established by governments at the forefront of creating and implementing food policies for good health. A rating process is proposed to assess a government's level of policy implementation towards good practice. The Food-EPI will be pre-tested and piloted in countries of varying size and income levels. The benchmarking of government policy implementation has the potential to catalyse greater action to reduce obesity and NCDs.

Monitoring and benchmarking population diet quality globally : a step-wise approach

INFORMAS (International Network for Food and Obesity/non-communicable diseases Research, Monitoring and Action Support) aims to monitor and benchmark the healthiness of food environments globally. In order to assess the impact of food environments on population diets, it is necessary to monitor population diet quality between countries and over time. This paper reviews existing data sources suitable for monitoring population diet quality, and assesses their strengths and limitations. A step-wise framework is then proposed for monitoring population diet quality. Food balance sheets (FBaS), household budget and expenditure surveys (HBES) and food intake surveys are all suitable methods for assessing population diet quality. In the proposed ‘minimal’ approach, national trends of food and energy availability can be explored using FBaS. In the ‘expanded’ and ‘optimal’ approaches, the dietary share of ultra-processed products is measured as an indicator of energy-dense, nutrient-poor diets using HBES and food intake surveys, respectively. In addition, it is proposed that pre-defined diet quality indices are used to score diets, and some of those have been designed for application within all three monitoring approaches. However, in order to enhance the value of global efforts to monitor diet quality, data collection methods and diet quality indicators need further development work.

Position paper : benchmarking the performance of global and emerging knowledge cities

Knowledge-based development has become a new urban policy approach for the competitive cities of the global knowledge economy era. For those cities seeking a knowledge-based development, benchmarking is an essential prerequisite for informed and strategic vision and policy making to achieve a prosperous development. Nevertheless, benchmarked knowledge-based development performance analysis of global and emerging knowledge cities is an understudied area. This paper aims to contribute to the field by introducing the methodology of a novel performance assessment model—that is the Knowledge-Based Urban Development Assessment Model—and providing lessons from the application of the model in an international knowledge city performance analysis study. The assessment model puts renowned global and emerging knowledge cities—that are Birmingham, Boston, Brisbane, Helsinki, Istanbul, Manchester, Melbourne, San Francisco, Sydney, Toronto, and Vancouver—under the knowledge-based development microscope. The results of the analysis provide internationally benchmarked snapshot of the degree of achievements in various knowledge-based urban development performance areas of the investigated knowledge cities, and reveals insightful lessons on scrutinizing the global perspectives on knowledge-based development of cities.

Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Benchmarking the standard of environmental management practised in marinas

Most existing marinas are boat parking/storing and servicing facilities that have been built over a long period of time for the convenience of local boat owners.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Benchmarking potential factors leading to education quality : a study of Cambodian higher education

Purpose To study the quality in higher education in Cambodia and explore the potential factors leading to quality in Cambodian higher education. Design/methodology/approach Five main factors that were deemed relevant in providing quality in Cambodian higher education were proposed: academic curriculum and extra-curricular activities, teachers' qualification and methods, funding and tuition, school facilities, and interactive network. These five propositions were used to compare Shu-Te University, Taiwan with the top five universities in Cambodia. The data came in the forms of questionnaire and desk research. Descriptive analytical approach is then carried out to describe these five factors. Findings Only 6 per cent of lecturers hold PhD degree and about 85 per cent never published any papers; some private universities charge as low as USD200 per academic year, there is almost no donation from international organizations, and annual government funding on higher education sector nationwide in 2005 was only about USD3.67 million; even though there is a library at each university, books, study materials etc. are not up-to-date and inadequate; 90 per cent of the lecturers never have technical discussion or meeting and about 60 per cent of students felt that their teachers did not have time for them to consult with. Originality/value A useful insight was gained into the perceived importance of quality in higher education that can stimulate debate and discussion on the role of government in building the standard quality in higher education. Also, the findings from this research can assist in the development of a framework of developing human resource.