A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Information flow structure in large-scale product development organizational networks
2004
Journal of Information Technology
Preserved Fulltext
Process Architects for providing the operating software data at a major telecommunication company, and to Simon Austin and Andy Newton of Loughborough University and ADePT Management Limited for providing ...
Acknowledgements This paper is an extension of . The bulk of the work has been conducted while DB was with the Massachusetts Institute of Technology, Center for Innovation of Product Development. ...
∼ ) ( * k k f k γ − where * k is the cutoff The goal of the present paper is to investigate the statistical properties of large-scale distributed product development networks. ...
doi:10.1057/palgrave.jit.2000030
fatcat:jhom22p33fhx3gsteb7dyuvafa
Information Flow Structure in Large-Scale Product Development Organizational Networks
[chapter]
2005
Smart Business Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Process Architects for providing the operating software data at a major telecommunication company, and to Simon Austin and Andy Newton of Loughborough University and ADePT Management Limited for providing ...
Acknowledgements This paper is an extension of . The bulk of the work has been conducted while DB was with the Massachusetts Institute of Technology, Center for Innovation of Product Development. ...
∼ ) ( * k k f k γ − where * k is the cutoff The goal of the present paper is to investigate the statistical properties of large-scale distributed product development networks. ...
doi:10.1007/3-540-26694-1_8
fatcat:yvlsukpgafe4ri3ao7khyuvgge
The topology and dynamics of complex man- made systems
2007
2007 IEEE International Conference on Systems, Man and Cybernetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper examines the statistical properties of large-scale product development networks --and discusses the significance of these properties in providing insight into ways of improving the strategic ...
Understanding the structure and function of complex networks has recently become the foundation for explaining many different real-world complex biological, technological and informal social phenomena. ...
The Connectivity Syndrome A large-scale product design and development process (PD) is a distributed problem solving activity with hundreds of designers carrying out tasks and revising their actions based ...
doi:10.1109/icsmc.2007.4414261
dblp:conf/smc/Braha07
fatcat:acjg2tdfyrbypolnlgbjawtfpa
Software systems as complex networks: Structure, function, and evolvability of software collaboration graphs
2003
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Building on recent advances in the study of complex networks, I have examined software collaboration graphs contained within several open-source software systems, and have found them to reveal scale-free ...
I also present a simple model of software system evolution based on refactoring processes which captures some of the salient features of the observed systems. ...
Resources of the Cornell Theory Center (CTC) were used in this research; the CTC receives funding from Cornell University, New York State, federal agencies, foundations, and corporate partners. ...
doi:10.1103/physreve.68.046116
pmid:14683011
fatcat:icnetofeffh63k342w5bjvnleq
Relationships in Large-Scale Graph Computing
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It was titled "Large-scale graph computing at Google" and gave an excellent insight into the future of Google's search. ...
This article highlights some of the little known facts which lead to transformation of Google's algorithm in the last two years. ...
Clarke Approved for upload, sharing and distribution without modification. Author: Dan Petrovic (C) 2011, http://dejanseo.com.au/ ...
arXiv:1201.2261v1
fatcat:ranpsqxcrjh35cha7qcuhiejl4
Scalable performance of ScaleGraph for large scale graph analysis
2012
2012 19th International Conference on High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scalable analysis of massive graphs has become a challenging issue in high performance computing environments. ScaleGraph is an X10 library aimed for large scale graph analysis scenarios. ...
We make scalability evaluation by analyzing a synthetic Kronecker graph with 40.3 million edges (for all the three algorithms), and a real social network with 69 million edges (for degree distribution ...
ACKNOWLEDGMENT This research was supported by the Japan Science and Technology Agency's CREST project titled "Development of System Software Technologies for post-Peta Scale High Performance Computing" ...
doi:10.1109/hipc.2012.6507498
dblp:conf/hipc/DayarathnaHOS12
fatcat:bgptnzn26bae7m3mzdrisdnggm
MapReduce based Betweenness Approximation Engineering in Large Scale Graph
2012
Systems Engineering Procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
large scale SNA graph from emergency case management with better accuracy. ...
in large scale social network data computing in emergency case management. ...
Acknowledgements Thanks to the support of National Natural Science Foundation of China (NNSF) (Grants No.90924029) and China 863 Program (Grant No.2010AA012501). ...
doi:10.1016/j.sepro.2012.04.026
fatcat:y2ledttgy5eblklik2pmar3eza
Temporal Pattern Recognition in Large Scale Graphs
2019
Proceedings of the 13th ACM International Conference on Distributed and Event-based Systems - DEBS '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Many application domains involve monitoring the temporal evolution of large-scale graph data structures. ...
This paper presents ongoing work on the implementation of FlowGraph, a framework to recognize temporal patterns over properties of large-scale graphs. ...
We show how the paradigm is being implemented in FlowGraph, a distributed processing framework to detect temporal patterns in large-scale graphs. ...
doi:10.1145/3328905.3332518
dblp:conf/debs/ChaudhryMR19
fatcat:ludo55r3urbatj2bozta3ka2wi
Briefing: High-performance computing for city-scale modelling and simulations
2017
Proceedings of the Institution of Civil Engineers - Smart Infrastructure and Construction
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Figure 1 shows the visualization of our graph-parallel distributed computing tool that simulates city-scale infrastructure networks with hundred-thousand links and millions of agents traversing close to ...
The purpose of the ABM tool is to capture the complex city-scale response from individual agent behaviours. ...
This enables a simulation of large-scale complexity to be possible in a reasonable time frame. ...
doi:10.1680/jsmic.17.00026
fatcat:iejlrxaprvelfkud5noakchnde
Parallel Markov-based Clustering Strategy for Large-scale Ontology Partitioning
2017
Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
to improve the performance of the ontology matching process. ...
However, given the large-scale context, we adopt ontology partitioning strategies, which split ontologies into a set of disjoint partitions, as a crucial part to reduce the computational complexity and ...
First of all, the resulting graphs from large scale ontology are generally sparse; thus, Markov clustering storage issues can be resolved using distributed sparse matrix data structures offered by the ...
doi:10.5220/0006504001950202
dblp:conf/ic3k/MountasserOF17
fatcat:7kco2r6qvfdedeeeujlxhstmgi
External Memory based Distributed Generation of Massive Scale Social Networks on Small Clusters
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Small distributed systems are limited by their main memory to generate massively large graphs. ...
Trivial extension to current graph generators to utilize external memory leads to large amount of random I/O hence do not scale with size. ...
For 'large' graphs (scale 34 and above) the dataset size is even larger, doubling at every scale. ...
arXiv:1210.0187v1
fatcat:tcxh7ij6d5by5euvf6nnnermsq
Generation of complex bipartite graphs by using a preferential rewiring process
2005
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We find that the obtained bipartite graph has a scale-free-like property when a suitable fitness distribution is used. ...
We propose a model to generate complex bipartite graphs without growing; the bipartite graphs are assumed to have two sets of the fixed numbers of nodes and a fixed number of edges between nodes belonging ...
ACKNOWLEDGMENTS This work was supported in part by a grant-in-aid for scientific research ͑No. 14084202 and No. 14084203͒ from the Ministry of Education, Culture, Sports, Science and Technology, Japan. ...
doi:10.1103/physreve.72.036120
pmid:16241528
fatcat:pwi6a4s62fgild3nsqcuf5zyju
Affordable Supercomputing for Data Mining Applications
2011
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Business intelligence, e-science and Web mining are rapidly growing sources of extreme large scale problems. ...
Others such as machine learning or gene sequencing are computational intensive as they require complex algorithms run on large data that may not fit into the internal memory of a single machine. ...
Very large graph processing. The World Wide Web, the largest network ever processed, relies on graph algorithms including Google's PageRank. ...
doi:10.1016/j.procs.2011.09.009
fatcat:jlcdgcgpfjgbvf4uubt27ypcim
Systems and Algorithms for Large-scale Graph Analytics (Dagstuhl Seminar 14462)
2015
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of Dagstuhl Seminar 14462 "Systems and Algorithms for Large-scale Graph Analytics". ...
The seminar was a successful gathering of computer scientists from the domains of systems, algorithms, architecture and databases all of whom are interested in graph processing. ...
We thank Derek Murray for his great contribution to the organization of the workshop and participation via Skype as he could not travel because of the sudden set down of Microsoft Research Silicon Valley ...
doi:10.4230/dagrep.4.11.59
dblp:journals/dagstuhl-reports/Yoneki0M14
fatcat:dilicps65jgipetfid3udj2q4i
Topology of large-scale engineering problem-solving networks
2004
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal of the present paper is to investigate the statistical properties of networks of people engaged in distributed problem solving and discuss their significance. ...
Specifically, the incoming link distributions have sharp cutoffs that are substantially lower than those of the outgoing link distributions ͑sometimes the outgoing cutoffs are not even present͒. ...
I Empirical statistics of the four large-scale PD networks. ...
doi:10.1103/physreve.69.016113
pmid:14995673
fatcat:xx2egdz6unbdxpbkl5kaq6i3qu
« Previous
Showing results 1 — 15 out of 628,640 results