Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6541 - 6570 of 6884

Full-Text Articles in Physical Sciences and Mathematics

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert Huijie Deng Sep 2002

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert Huijie Deng

Research Collection School Of Computing and Information Systems

At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2(d-1)m/2 encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about a.2m encryptions, where a is a small number.

Go to article

Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang Sep 2002

Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang

Research Collection School Of Computing and Information Systems

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …

Go to article

A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal Sep 2002

A Label-Switching Packet Forwarding Architecture For Multi-Hop Wireless Lans, Arup Acharya, Archan Misra, Sorav Bansal

Research Collection School Of Computing and Information Systems

A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP …

Go to article

Detection Of Slide Transition For Topic Indexing, Chong-Wah Ngo, Ting-Chuen Pong, Thomas S. Huang Aug 2002

Detection Of Slide Transition For Topic Indexing, Chong-Wah Ngo, Ting-Chuen Pong, Thomas S. Huang

Research Collection School Of Computing and Information Systems

This paper presents an automatic and novel approach in detecting the transitions of slides for video sequences of technical lectures. Our approach adopts a foreground vs background segmentation algorithm to separate a presenter from the projected electronic slides. Once a background template is generated, text captions are detected and analyzed. The segmented caption regions as well as background templates together provide salient visual cues to decide whether a slide is flipped and replaced. The partitioning of videos according to slide changes not only structure the content of video according to topics, but also facilitate the synchronization of video, audio and …

Go to article

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li Aug 2002

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li

Research Collection School Of Computing and Information Systems

In this paper, we describe how an integrated web‐based application, code‐named FOCI (Flexible Organizer for Competitive Intelligence), can help the knowledge worker in the gathering, organizing, tracking and dissemination of competitive intelligence (CI). It combines the use of a novel user‐configurable clustering, trend analysis and visualization techniques to manage information gathered from the web. FOCI allows its users to define and personalize the organization of the information clusters according to their needs and preferences into portfolios. These personalized portfolios created are saved and can be subsequently tracked and shared with other users. The paper runs through an example to show …

Go to article

Hcl: A Specification Language For Hierarchical Text Classification, Aixin Sun, Ee Peng Lim, Wee-Keong Ng Aug 2002

Hcl: A Specification Language For Hierarchical Text Classification, Aixin Sun, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Hierarchical text classification refers to assigning text documents to the categories in a given category tree based on their content. With large number of categories organized as a tree, hierarchical text classification helps users to find information more quickly and accurately. Nevertheless, hierarchical text classification methods in the past have often been constructed in a proprietary manner. The construction steps often involve human efforts and are not completely automated. In this paper, we therefore propose a specification language known as HCL (Hierarchical Classification Language) . HCL is designed to describe a hierarchical classification method including the definition of a category …

Go to article

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono Jul 2002

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono

Research Collection School Of Computing and Information Systems

The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.

Go to article

Digital Libraries To Knowledge Portals: Towards A Global Knowledge Portal For Secondary Schools In Singapore, Yin-Leng Theng, Dion Hoe-Lian Goh, Chu Keong Lee, Ee Peng Lim, Zehua Liu Jul 2002

Digital Libraries To Knowledge Portals: Towards A Global Knowledge Portal For Secondary Schools In Singapore, Yin-Leng Theng, Dion Hoe-Lian Goh, Chu Keong Lee, Ee Peng Lim, Zehua Liu

Research Collection School Of Computing and Information Systems

For digital libraries to remain relevant in the new millennium where the ability to manage knowledge is critical, this paper explores how digital libraries could strategically be evolved into knowledge portals to encapsulate knowledge creation, management, sharing and reusability, features evidently lacking in most conventional digital libraries. Two digital library scenarios of use in education are described and implemented as knowledge portals using G-Portal and the Greenstone software. We hope that the initial work carried out on these two portal-like DLs will eventually form part of a Global Knowledge Portal for Secondary Schools in Singapore. Keywords Digital libraries, information portals, …

Go to article

G-Portal : A Map-Based Digital Library For Distributed Geospatial And Georeferenced Resources, Ee Peng Lim, Dion Hoe-Lian Goh Jul 2002

G-Portal : A Map-Based Digital Library For Distributed Geospatial And Georeferenced Resources, Ee Peng Lim, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

As the World Wide Web evolves into an immense information network, it is tempting to build new digital library services and expand existing digital library services to make use of web content. In this paper, we present the design and implementation of G-Portal, a web portal that aims to provide digital library services over geospatial and georeferenced content found on the World Wide Web. G-Portal adopts a map-based user interface to visualize and manipulate the distributed geospatial and georeferenced content. Annotation capabilities are supported, allowing users to contribute geospatial and georeferenced objects as well as their associated metadata. The other …

Go to article

A Digital Library For Geography Examination Resources, Lian-Heong Chua, Dion Hoe-Lian Goh, Zehua Liu, Ee Peng Lim, Rebecca Pei-Hui Ang Jul 2002

A Digital Library For Geography Examination Resources, Lian-Heong Chua, Dion Hoe-Lian Goh, Zehua Liu, Ee Peng Lim, Rebecca Pei-Hui Ang

Research Collection School Of Computing and Information Systems

We describe a Web-based application developed above a digital library of geographical resources for Singapore students preparing to take a national examination in geography. The application provides an interactive, non-sequential approach to learning that supplements textbooks.

Go to article

Fast Filter-And-Refine Algorithms For Subsequence Selection, Beng-Chin Ooi, Hwee Hwa Pang, Hao Wang, Limsoon Wong, Cui Yu Jul 2002

Fast Filter-And-Refine Algorithms For Subsequence Selection, Beng-Chin Ooi, Hwee Hwa Pang, Hao Wang, Limsoon Wong, Cui Yu

Research Collection School Of Computing and Information Systems

Large sequence databases, such as protein, DNA and gene sequences in biology, are becoming increasingly common. An important operation on a sequence database is approximate subsequence matching, where all subsequences that are within some distance from a given query string are retrieved. This paper proposes a filter-and-refine algorithm that enables efficient approximate subsequence matching in large DNA sequence databases. It employs a bitmap indexing structure to condense and encode each data sequence into a shorter index sequence. During query processing, the bitmap index is used to filter out most of the irrelevant subsequences, and false positives are removed in the …

Go to article

Leadership Antecedents Of Informal Knowledge Acquisition And Dissemination, Siu Loon Hoe, Steve Mcshane Jul 2002

Leadership Antecedents Of Informal Knowledge Acquisition And Dissemination, Siu Loon Hoe, Steve Mcshane

Research Collection School Of Computing and Information Systems

Knowledge management is emerging as one of the leading influences on an organisation’s survival and competitive advantage (Blumentritt & Johnston 1999). Knowledge management is concerned with the effective acquisition, sharing, storage and utilisation of knowledge (Huber 1991; Saffady 1998). Corporate leaders are increasingly aware of the notion that an organisation’s long-term survival depends on its ability to generate new knowledge and continuously learn from the environment. The importance of a superior organisational learning capability as a source of competitive advantage is a common refrain among both managers and scholars (e.g. Kohli & Jaworski 1990; Nonaka 1991; Quinn 1992; Slater & …

Go to article

Data Management In Location-Dependent Information Services: Challenges And Issues, Dik Lun Lee, Jianliang Xu, Baihua Zheng, Wang-Chien Lee Jul 2002

Data Management In Location-Dependent Information Services: Challenges And Issues, Dik Lun Lee, Jianliang Xu, Baihua Zheng, Wang-Chien Lee

Research Collection School Of Computing and Information Systems

Location-dependent information services have great promise for mobile and pervasive computing environments. They can provide local and nonlocal news, weather, and traffic reports as well as directory services. Before they can be implemented on a large scale, however, several research issues must be addressed.

Go to article

Combining Two Heuristics To Solve A Supply Chain Optimization Problem, Hoong Chuin Lau, Yuyue Song Jul 2002

Combining Two Heuristics To Solve A Supply Chain Optimization Problem, Hoong Chuin Lau, Yuyue Song

Research Collection School Of Computing and Information Systems

In this paper, we consider a real-life supply chain optimization problem concerned with supplying a product from multiple warehouses to multiple geographically dispersed retailers. Each retailer faces a deterministic and period-dependent demand over some finite planning horizon. The demand of each retailer is satisfied by the supply from some predetermined warehouse through a fleet of vehicles which are only available within certain time windows at each period. Our goal is to identify a combined inventory and routing schedule such that the system-wide total cost over the planning horizon is minimised. This problem in essence is an amalgamation of two classical …

Go to article

The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang Jul 2002

The Case For Cyber Foraging, Rajesh Balan, Jason Flinn, Mahadev Satyanarayanan, Shafeeq Sinnamohideen, Hen-I Yang

Research Collection School Of Computing and Information Systems

In this paper, we propose cyber foraging: a mechanism to augment the computational and storage capabilities of mobile devices. Cyber foraging uses opportunistically discovered servers in the environment to improve the performance of interactive applications and distributed file systems on mobile clients. We show how the performance of distributed file systems can be improved by staging data at these servers even though the servers are not trusted. We also show how the performance of interactive applications can be improved via remote execution. Finally, we present VERSUDS: a virtual interface to heteregeneous service discovery protocols that can be used to discover …

Go to article

Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng Jul 2002

Security Analysis And Improvement Of The Global Key Recovery System, Yanjiang Yang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Key recovery is a technology that allows the owner of encrypted data or a trusted third party to recover encrypted data, mostly by reconstructing lost decryption key. In [HLG99], Harn et al proposed a Global Key Recovery System (GKRS) that combines the functions of the key recovery authorities and the public key certification authorities (CAs). Among other features, user-dominance, i.e., a user is allowed to select his own public-private key pair and especially a public element for verifying the validity of the public-private key pair, is considered extremely important by [HLG99] for wide acceptance of GKRS. In this paper, we …

Go to article

Avoiding Congestion Collapse On The Internet Using Tcp Tunnels, Boon Peng Lee, Rajesh Krishna Balan, Jacob Lillykutty, Winston Seah, A. L. Ananda Jun 2002

Avoiding Congestion Collapse On The Internet Using Tcp Tunnels, Boon Peng Lee, Rajesh Krishna Balan, Jacob Lillykutty, Winston Seah, A. L. Ananda

Research Collection School Of Computing and Information Systems

This paper discusses the application of TCP tunnels on the Internet and how Internet traffic can benefit from the congestion control mechanism of the tunnels. Primarily, we show the TCP tunnels offer TCP-friendly flows protection from TCP-unfriendly traffic. TCP tunnels also reduce the many flows situation on the Internet to that of a few flows. In addition, TCP tunnels eliminate unnecessary packet loss in the core routers of the congested backbones, which waste precious bandwidth leading to congestion collapse due to unresponsive UDP flows. We finally highlight that the use of TCP tunnels can, in principle, help prevent certain forms …

Go to article

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert H. Deng Jun 2002

Cryptanalysis Of Some Hash Functions Based On Block Ciphers And Codes, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash functions are secure: 2(d-1)m/2 encryptions are necessary to find a collision, where d and m are the minimal distance of the code and the block size of block cipher, respectively. However, we show in this paper that a collision could be found with about alpha*2m encryptions, where alpha is a small number.

Go to article

Idmp: An Intradomain Mobility Management Protocol For Next-Generation Wireless Networks, Subir Das, Anthony Mcauley, Ashutosh Dutta, Archan Misra, Sajal K. Das Jun 2002

Idmp: An Intradomain Mobility Management Protocol For Next-Generation Wireless Networks, Subir Das, Anthony Mcauley, Ashutosh Dutta, Archan Misra, Sajal K. Das

Research Collection School Of Computing and Information Systems

This paper describes a lightweight Intra-domain Management Protocol (IDMP) for managing mobility within a domain, commonly known as micro-mobility management, for next generation wireless networks. IDMP is modular and simple because it leverages existing protocols, such as Mobile IP or SIP (Session Initiated Protocol) as global mobility management, for locating roaming nodes. Unlike other proposed intra-domain mobility management schemes, IDMP uses two dynamically autoconfigured care-of addresses (CoAs) for routing the packets destined to mobile nodes. The global care-of address (GCoA) is relatively stable and identifies the mobile node’s attachment to the current domain, while the local care-of address (LCoA) changes …

Go to article

Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra Jun 2002

Minimum Energy Paths For Reliable Communication In Multi-Hop Wireless Networks, Suman Banerjee, Archan Misra

Research Collection School Of Computing and Information Systems

Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has the same cost and the minimum-hop path is selected. In situations where the transmission power can be varied with the distance of the link, the link cost is higher for longer hops; the energy-aware routing algorithms select a path with a large number of small-distance hops. In this paper, we argue that such a formulation based solely on the energy spent in a single transmission is misleading --- the proper metric should include the total energy …

Go to article

Energy Efficiency And Throughput For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Gupta, Rajeev Shorey, Imran Ali, Ashu Razdan, Archan Misra Jun 2002

Energy Efficiency And Throughput For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Gupta, Rajeev Shorey, Imran Ali, Ashu Razdan, Archan Misra

Research Collection School Of Computing and Information Systems

We study the performance metrics associated with TCP regulated traffic in multi-hop, wireless networks that use a common physical channel (e.g., IEEE 802.11). In contrast to earlier analyses, we focus simultaneously on two key operating metrics– the energy efficiency and the session throughput. Using analysis and simulations, we show how these metrics are strongly influenced by the radio transmission range of individual nodes. Due to tradeoffs between the individual packet transmission energy and the likelihood of retransmissions, the total energy consumption is a convex function of the number of hops (and hence, of the transmission range). On the other hand, …

Go to article

Personalized Information Management For Web Intelligence, Ah-Hwee Tan May 2002

Personalized Information Management For Web Intelligence, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Web intelligence can be defined as the process of scanning and tracking information on the World Wide Web so as to gain competitive advantages. This paper describes a system known as Flexible Organizer for Competitive Intelligence (FOCI) that transforms raw URLs returned by internet search engines into personalized information portfolios. FOCI builds information portfolios by gathering and organizing online information according to a user's needs and preferences. Through a novel method called User-Configurable Clustering, a user can personalize his/her portfolios in terms of the content as well as the information structure. The personalized portfolios can then be used to track …

Go to article

A Case For Analytical Customer Relationship Management, Jaideep Srivastava, Jau-Hwang Wang, Ee Peng Lim, San-Yih Hwang May 2002

A Case For Analytical Customer Relationship Management, Jaideep Srivastava, Jau-Hwang Wang, Ee Peng Lim, San-Yih Hwang

Research Collection School Of Computing and Information Systems

This paper describes how data analytics can be used to make various CRM functions like customer segmentation, communication targeting, retention, and loyalty much more effective. Also briefly describe the key technologies needed to implement analytical CRM, and are the organizational issues that must be carefully handled to make CRM a reality.

Go to article

Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung May 2002

Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung

Research Collection School Of Computing and Information Systems

Hepatocellular carcinoma (HCC or hepatoma) is the most common primary cancer of the liver. Persistent viral infection by the hepatic B or C virus is probably the most important cause of HCC worldwide. It is responsible for approximately one million deaths each year, predominantly in the underdeveloped and developing countries, but its incidence is also on the rise in the developed countries. For most patients suffering from HCC, long-term survival is rare, as they are presented late and are often unsuitable for curative treatment. Thus there is great interest to identify novel HCC diagnostic markers for early detection of the …

Go to article

Mining Relationship Graphs For Effective Business Objectives, Kok-Leong Ong, Ee Peng Lim, Wee-Keong Ng May 2002

Mining Relationship Graphs For Effective Business Objectives, Kok-Leong Ong, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Modern organization has two types of customer profiles: active and passive. Active customers contribute to the business goals of an organization, while passive customers are potential candidates that can be converted to active ones. Existing KDD techniques focused mainly on past data generated by active customers. The insights discovered apply well to active ones but may scale poorly with passive customers. This is because there is no attempt to generate know-how to convert passive customers into active ones. We propose an algorithm to discover relationship graphs using both types of profile. Using relationship graphs, an organization can be more effective …

Go to article

Product Schema Integration For Electronic Commerce: A Synonym Comparison Approach, Guanghao Yan, Wee-Keong Ng, Ee Peng Lim May 2002

Product Schema Integration For Electronic Commerce: A Synonym Comparison Approach, Guanghao Yan, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In any electronic commerce system, the heterogeneity of product descriptions is a critical impediment to efficient business information exchange. In the ABECOS electronic commerce system, buyer agents, seller agents, and directory agents liaise with one another in e-commerce activities. Only when agents have a common ontology of product descriptions (also called product schemas) are they able to interact seamlessly in e-commerce activities. This gives rise to the product schema integration problem (PSI); the problem of integrating heterogeneous schemas of a certain product into one globally compatible schema. We adopt an integration approach based on product attribute synonyms. We give a …

Go to article

Driving In Traffic: Short-Range Sensing For Urban Collision Avoidance, Chuck Thorpe, Dave Duggins, Jay Gowdy, Rob Maclaughlin, Christoph Mertz, Mel Siegel, Arne Suppe, Bob Wang, Teruko Yata Apr 2002

Driving In Traffic: Short-Range Sensing For Urban Collision Avoidance, Chuck Thorpe, Dave Duggins, Jay Gowdy, Rob Maclaughlin, Christoph Mertz, Mel Siegel, Arne Suppe, Bob Wang, Teruko Yata

Research Collection School Of Computing and Information Systems

Intelligent vehicles are beginning to appear on the market, but so far their sensing and warning functions only work on the open road. Functions such as runoff-road warning or adaptive cruise control are designed for the uncluttered environments of open highways. We are working on the much more difficult problem of sensing and driver interfaces for driving in urban areas. We need to sense cars and pedestrians and curbs and fire plugs and bicycles and lamp posts; we need to predict the paths of our own vehicle and of other moving objects; and we need to decide when to issue …

Go to article

A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau Apr 2002

A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the Weighted Constraint Satisfaction Problem which is an important problem in Artificial Intelligence. Given a set of variables, their domains and a set of constraints between variables, our goal is to obtain an assignment of the variables to domain values such that the weighted sum of satisfied constraints is maximized. In this paper, we present a new approach based on randomized rounding of semidefinite programming relaxation. Besides having provable worst-case bounds for domain sizes 2 and 3, our algorithm is simple and efficient in practice, and produces better solutions than some other polynomial-time algorithms such as greedy and …

Go to article

Multi-Level Modeling Of Software On Hardware In Concurrent Computation, Joann M. Paul, Arne Suppe, Henele I. Adams, Donald E. Thomas Apr 2002

Multi-Level Modeling Of Software On Hardware In Concurrent Computation, Joann M. Paul, Arne Suppe, Henele I. Adams, Donald E. Thomas

Research Collection School Of Computing and Information Systems

The fundamental modeling differences between hardware and software modeling can be thought of as reasoning about connectedness vs. reasoning about interleaved (shared) access to resources. A natural design hierarchy for physical systems is component-based because of the existence of a consistent basis for interconnect between design levels. However, performance modeling and design of concurrent, programmable systems require new ways of thinking about what it means to abstract detail, add detail and partition a model of software executing on hardware. We motivate frequency interleaving (FI) as a common simulation foundation for these systems because it resolves flow and partitioning with software …

Go to article

B2b E-Commerce Revisited: Leading Perspectives On The Key Issues And Research Directions, Qizhi Dai, Robert J. Kauffman Mar 2002

B2b E-Commerce Revisited: Leading Perspectives On The Key Issues And Research Directions, Qizhi Dai, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The application of Internet technologies for the conduct of interfirm business transactions has given rise to a boom in business-to-business (B2B) electronic commerce. Yet, although there are many success stories that have been reported over the past several years, the progress of B2B e-commerce has been hindered by unanticipated technical, organizational, economic and legal challenges that diminish value. In this article, we report on a series of interviews with leading academic researchers and industry senior managers who are in a unique position to make sense of key issues and offer useful insights. The respondents provide their views on the efficacy …

Go to article

First Prev Next Last