Trends and Directions in Distributed Knowledge
Elias M. Awad, McIntire School of Commerce, University of Virginia, United States
Convex Quadratic Programming in Graphs: Links between Continuous and Discrete Problems
Domingos M. Cardoso, Mathematics, University of Aveiro, Portugal
Transforming a Complex, Global Enterprise: Operations Research for Management Innovation
Greg H. Parlier, GH Parlier Consulting, United States
Trends and Directions in Distributed Knowledge
Elias M. Awad
McIntire School of Commerce, University of Virginia
United States
Brief Bio
Dr. Elias M. Awad is the Virginia Bankers Association Professor Emeritus of Bank Management at the University of Virginia. He has over 45 years IT experience in the academic, publishing, and consulting fields. He is one of the world’s leading IT and Management seminar and workshop presenters in the banking industry. Dr. Awad is the CEO of International Technology Group, LTD, a management consulting group with a central office in Charlottesville, Virginia and overseas offices in Beirut, Damascus, and Geneva. His book publication record goes back to the early 1960s with best sellers in management information systems, systems analysis and design, database management, knowledge management, human resources management, expert systems, and knowledge automation systems. (See www.amazon.com). His publications have been translated into German, Spanish, Portuguese, Chinese, Arabic, Russian, and Braille. As a senior management and IT consultant, he has delivered professional seminars and workshops internationally to major corporations and government agencies in 26 countries, including South Korea, Russia, China, Australia, Cambodia, Canada, Mexico, Philippines, Kazakhstan, Moldova, Uzbekistan, Malaysia, Saudi Arabia, Egypt, Lebanon, and Jordan. Contact email address: ema3z@virginia.edu
Abstract
The core of success in today's global commerce is knowledge centricity affecting individuals, organizations, government, and industries alike. With explicit knowledge tucked away in knowledge bases, a key trend in knowledge transfer (KT) is intrinsic knowledge intensification against cultural, structural, and cognitive barriers. KT facilitates knowledge exchange via teamwork based on mutual trust, tested integrity, and a shared vision in a knowledge-centric environment.
Networking, per se, facilitates KT but cannot guarantee implementation or integration. As a result, behavioralists such as knowledge brokers with technology background are slowly being employed to assure connectivity, promote collaboration, instill confidence, enhance communication, and enrich decision-making. It is a daunting challenge that will take time and experience for KT to take hold.
In the final analysis, KT imperatives must address time management ("when" of KT), HRM ("who" of KT), security management ("why" of KT), task management ("what" knowledge should be transferred), and network management ("how" knowledge should be transferred). It is an endeavor requiring intelligence, foresight, and leadership in an increasingly complex world.
Convex Quadratic Programming in Graphs: Links between Continuous and Discrete Problems
Domingos M. Cardoso
Mathematics, University of Aveiro
Portugal
http://sweet.ua.pt/dcardoso/
![]()
Brief Bio
Full professor at the Mathematics Department of the University of Aveiro, Portugal, since 2005, having got the PhD degree in Mathematics at University of Aveiro in 1993. President of the Portuguese OR Society – APDIO, since January 2012. Scientific Coordinator of the Centre for Optimization and Control Theory (CEOC) between 2002 and 2009. Scientific Coordinator Optimization, Graph Theory and Combinatorics Research Group of CEOC until the end of 2009 and of the Center for Research in Mathematics and Applications (CIDMA) since January 2010. Coordinator of several research projects (“Algebraic Methods in Graph Theory” 2005-2006, “Optimization of Diversity and Distribution of Cable Configuration for Automobile Industry (OPT-DDCC)” 2005, “Optimal Splice Location (OPT-SLC)" 2008-2009, “Graph Spectra and Applications (GSA)" 2011-2013”). Member of the Board of Directors of Centro Internacional de Matemática (CIM), between 2004 and 2008. Member of the Managing Board of EUROPT - The Continuous Optimization Working Group of EURO. Director of the Doctoral Program in Mathematics of University of Aveiro since 2008. Co-author of 1 book and author or co-author of about 60 papers in international journals, book chapters and proceedings. The main research topics includes optimization, operations research, discrete mathematics and spectral graph theory.
Abstract
Many real-world applications have combinatorial problems in graphs as their mathematical models. For instance, to decide on the Hamiltonicity of a graph, to determine a maximum stable set or a maximum clique, maximum induced matchings, are examples of these combinatorial problems and most of them can be generically formulated as the determination of a maximum order k-regular induced subgraph. Since the landmark publication of Motzkin and Straus in [T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turan, Canadian Journal of Mathematics 17 (1965): 533-540], several combinatorial optimization problems have been intensively studied using continuous optimization approaches, namely quadratic programming. In particular, the use of convex quadratic programming techniques have produced very interesting results, regarding the determination of lower and upper bounds on the order of k-regular induced sub-graphs (which define stable sets when k=0, induced matchings when k=1, and so on) . There are many families of graphs for which these bounds are attained and where we are able to determine also a corresponding maximum order k-regular induced subgraph. In this presentation, the advances obtained by the application of convex quadratic programming techniques on combinatorial problems in graphs are surveyed and most of the main results, connecting continuous optimization properties with the combinatorial structure of the graph, are presented. In fact, in many cases, the combinatorial structure of a graph implies that the bounds obtained by convex quadratic programming are achieved and the behaviour of the optimal values of sequences of convex quadratic problems implies the presence of particular combinatorial structures in graphs. Furthermore, a few open problems related with the main challenges in this topic are proposed.
Transforming a Complex, Global Enterprise: Operations Research for Management Innovation
Greg H. Parlier
GH Parlier Consulting
United States
![]()
Brief Bio
A West Point graduate and retired US Army Colonel, Greg is currently President, GH Parlier Consulting. A combat veteran with 5 operational deployments and service in over 20 foreign nations on 12 named operations, he was a paratroop commander in the 82nd Airborne Division for 8 years, air-ground battle staff officer, joint operations planner, and Army strategist. When he retired he was the Army's senior, most experienced Operations Research officer with assignments spanning land warfare analyses, manpower and personnel, program analysis and evaluation, and logistics. He was assistant then associate professor of Operations Research at West Point. For 12 years after retiring, he served on the research staff at the Institute for Defense Analyses where he was an advisor to several foreign governments and senior OR analyst supporting the multi-national forces command in Iraq. He is a distinguished graduate of the US Marine Corps Command and Staff College, National Defense Fellow at MIT, Army War College graduate, and recently was adjunct Professor of Operations Research at NC State University. Dr. Parlier holds advanced degrees in engineering, Operations Research, and international security, a certificate in political philosophy from Oxford, and was among the first to complete MIT Sloan's executive program in Management, Innovation, and Technology. He is past president of the Military Applications Society of INFORMS, was vice president for the Military Operations Research Society, fellow of the Inter-University Seminar on Armed Forces and Society, elected to the International Institute of Strategic Studies, and previously served as program co-chair for ICORES.
Abstract
“Management innovation as a strategic technology” - MIST, for short - is a new concept for transformational change in large-scale, complex, interdependent organizations that comprise an extended enterprise. The presentation will develop an appreciation and understanding of MIST and its emphasis on analytical architectures as a strategic management means for improved performance in public sector organizations and government institutions. The three conceptual building blocks for MIST include: data-driven, operations research–based, decision support systems (also referred to as “business intelligence” or “advanced analytics”); a transformational, rather than incremental, approach to strategic planning guided by an “engine for innovation”; and an “integrated” management science to increase the likelihood for successful transformative change by enabling, rather than impeding, organizational implementation. By describing the components of MIST and demonstrating their application to challenges faced by the US Army’s materiel enterprise, others may be encouraged to consider and, where appropriate, adapt and apply MIST to many other daunting national security challenges as well.