ppxscal/embedding_network huggingface dataset:
Prescription to remedy the IT-business relationship
Authors: Sandra Cormack, Aileen Cater-Steel
Venue: Socio-technical and human cognition elements of information systems (2003)

Even though organisations are highly dependent on information technology (IT), many organisations have reported an unhealthy relationship between business and IT professionals. Establishing an effective relationship between these two disparate groups is essential for organisational success in today's competitive global economy. Despite many attempts to improve the IT-business relationship, tensions still exist. The cultural differences between business and IT have recently been blamed for these tensions.Through the application of relevant organisational behaviour theories, the cultural characteristics of the IT group that effect the IT-business relationship can be identified. Research shows that the IT culture is such that mutual benefits are not derived from the relationship, IT and business groups have a poor attitude towards cooperation, there is a lack of shared knowledge between business and IT, and there is a lack of organisational linkages between business and IT. As a starting point for reconciliation between business and IT, this chapter provides insights into how tensions in the IT-business relationship can be minimised through understanding and managing the IT culture.
Prior Knowledge and the Discovery of Entrepreneurial Opportunities
Authors: Scott Shane
Venue: Organization Science (2000)

Before technological change leads to new processes, products, markets, or ways of organizing, entrepreneurs must discover opportunities in which to exploit the new technology. To date, research has not explained adequately why entrepreneurs discover these opportunities, which creates several conceptual problems in the entrepreneurship literature. Drawing on Austrian economics, I argue that opportunity discovery is a function of the distribution of information in society (Hayek 1945). Through in-depth case studies of eight sets of entrepreneurs who exploit a single MIT invention, I show that entrepreneurs discover opportunities related to the information that they already possess. I use these findings to draw several implications that differ from those prevailing in the entrepreneurship literature, including: (1) entrepreneurs do not always select between alternative market opportunities for new technologies; (2) the source of entrepreneurship lies in differences in information about opportunities; (3) the results of prior studies of entrepreneurial exploitation may suffer from bias; and (4) individual differences influence the opportunities that people discover, how their entrepreneurial efforts are organized, and how the government can influence this process.
Rule-based extraction of experimental evidence in the biomedical domain: the KDD Cup 2002 (task 1)
Authors: Yizhar Regev, Michal Finkelstein-Landau, Ronen Feldman, Maya Gorodetsky, Xin Zheng, Samuel Levy, Rosane Charlab, Charles Lawrence, Ross A. Lippert, Qing Zhang, Hagit Shatkay
Venue: ACM SIGKDD Explorations Newsletter (2002)

Below we describe the winning system that we built for the KDD Cup 2002 Task 1 competition. Our system is a Rule-based Information Extraction (IE) system. It combines pattern matching, Natural Language Processing (NLP) tools, semantic constraints based on the domain and the specific task, and a post-processing stage for making the final curation decision based on the various evidence (positive and negative) found within the document. Development and implementation were made using the DIAL IE language and the ClearLab development environment. The results achieved were significantly superior than those achieved using categorization approaches.
ATM: a retrospective on systems legacy or "a technology with a fabulous future behind it?"
Authors: Jon Crowcroft, Derek McAuley
Venue: ACM SIGCOMM Computer Communication Review (2002)

The following four papers were selected from submissions for a proposed workshop that was to have been held during the 2002 ACM SIGCOMM Conference. Due to time, we cancelled the event, but the papers capture some of the past, present and future lessons to be gleaned from the whole ATM experience, and we felt that these lessons should be provided with a forum.
Asynchronous Group Mutual Exclusion in Ring Networks
Authors: Kuen-Pin Wu, Yuh-Jzer Joung
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The design issues for group mutual exclusion have been modeled by Joung as the Congenial Talking Philosophers, and solutions for shared-memory models and complete message-passing networks have been proposed [2, 3].These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each philosopher can only communicate directly with its two neighboring philosophers. As rings are also a popular network topology, in this paper we focus the Congenial Talking Philosophers on ring networks and present an efficient and highly concurrent distributed algorithm for the problem.
Feature flow fields
Authors: H. Theisel, H.-P. Seidel
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

Feature tracking algorithms for instationary vector fields are usually based on a correspondence analysis of the features at different time steps. This paper introduces a method for feature tracking which is based on the integration of stream lines of a certain vector field called feature flow field. We analyze for which features the method of feature flow fields can be applied, we show how events in the flow can be detected using feature flow fields, and we show how to construct the feature flow fields for particular classes of features. Finally, we apply the technique to track critical points in a 2D instationary vector field.
Anti-Aliased volume extraction
Authors: Sarang Lakare, Arie Kaufmany
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

We present a technique to extract regions from a volumetric dataset without introducing any aliasing so that the extracted volume can be explored using direct volume rendering techniques. Extracting regions using binary masks generated by contemporary segmentation approaches typically introduces aliasing at the boundary of the extracted regions. This aliasing is especially visible when the dataset is visualized using direct volume rendering. Our algorithm uses the binary mask only to locate the boundary. The main idea of the algorithm is to retain the natural fuzziness at the boundary of a region even after it is extracted. To achieve that, intensities of the boundary voxels are flipped so that they are now representing a fuzzy boundary with the empty region surrounding it, while preserving the boundary position.
Combining Labeled and Unlabeled Data for Text Classification with a Large Number of Categories
Authors: Rayid Ghani
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We develop a framework to incorporate unlabeled data in the Error-Correcting Output Coding (ECOC)setup by decomposing multiclass problems into multiple binary problems and then use Co-Training to learn the individual binary classification problems. We show that our method isespecially useful for classification tasks involving a large number of categories where Co-training doesn't perform very well by itself and when combined with ECOC, outperforms several other algorithms that combine labeled and unlabeled data for text classification in terms of accuracy, precision-recall tradeoff, and efficiency.
Flexible spatio-temporal stationary variogram models
Authors: Rubén Fernández-Casal, Wenceslao González-Manteiga, Manuel Febrero-Bande
Venue: Statistics and Computing (2003)

In this paper we propose a generalization of the Shapiro and Botha (1991) approach that allows one to obtain flexible spatio-temporal stationary variogram models. It is shown that if the weighted least squares criterion is chosen, the fitting of such models to pilot estimations of the variogram can be easily carried out by solving a quadratic programming problem. The work also includes an application to real data and a simulation study in order to illustrate the performance of the proposed space-time dependency modeling.
Practical Piecewise-Linear Approximation for Monotropic Optimization
Authors: Spyros Kontogiorgis
Venue: INFORMS Journal on Computing (2000)

Piecewise-linear programs are routinely used in applications to approximate nonlinear programs with a separable, concave objective function and linear constraints. We present a general and simple method for constructing and solving such problems. We use a spline algorithm to construct the approximant, a variant of the d-form to formulate the LP, and the interior point method to solve the LP. In computational experiments on a large-scale application benchmark, the method produces a 99.7% accurate solution in a sixth of the time it takes to solve the problem exactly with a state-of-the-art nonlinear solver.
A Heuristic Method for the Set Covering Problem
Authors: Alberto Caprara, Matteo Fischetti, Paolo Toth
Venue: Operations Research (1999)

We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA. In 1994 Ferrovie dello Stato SpA, jointly with the Italian Operational Research Society, organized a competition, called FASTER, intended to promote the development of algorithms capable of producing good solutions for these instances, since the classical approaches meet with considerable difficulties in tackling them. The main characteristics of the algorithm we propose are (1) a dynamic pricing scheme for the variables, akin to that used for solving large-scale LPs, to be coupled with subgradient optimization and greedy algorithms, and (2) the systematic use of column fixing to obtain improved solutions. Moreover, we propose a number of improvements on the standard way of defining the step-size and the ascent direction within the subgradient optimization procedure, and the scores within the greedy algorithms. Finally, an effective refining procedure is proposed. Our code won the first prize in the FASTER competition, giving the best solution value for all the proposed instances. The algorithm was also tested on the test instances from the literature: in 92 out of the 94 instances in our test bed we found, within short computing time, the optimal (or the best known) solution. Moreover, among the 18 instances for which the optimum is not known, in 6 cases our solution is better than any other solution found by previous techniques.
The application of mobile computing and technology to health care services
Authors: Khawar Hameed
Venue: Telematics and Informatics (2003)

Mobile computing and technology is becoming prevalent in many aspects of private life and public services. This paper presents a discussion of the technology and its application in context of the UKs health care service, and outlines some potential benefits that may result from its integration into existing information systems and architectures. The additional component of 'mobility' is believed to provide value to health care services, information systems and ultimately the patient's experience.
Compiler managed micro-cache bypassing for high performance EPIC processors
Authors: Youfeng Wu, Ryan Rakvic, Li-Ling Chen, Chyi-Chang Miao, George Chrysos, Jesse Fang
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Advanced microprocessors have been increasing clock rates, well beyond the Gigahertz boundary. For such high performance microprocessors, a small and fast data micro cache (ucache) is important to overall performance, and proper management of it via load bypassing has a significant performance impact. In this paper, we propose and evaluate a hardware-software collaborative technique to manage ucache bypassing for EPIC processors. The hardware supports the ucache bypassing with a flag in the load instruction format, and the compiler employs static analysis and profiling to identify loads that should bypass the ucache. The collaborative method achieves a significant improvement in performance for the SpecInt2000 benchmarks. On average, about 40%, 30%, 24%, and 22% of load references are identified to bypass 256B, 1K, 4K, and 8K sized ucaches, respectively. This reduces the ucache miss rates by 39%, 32%, 28%, and 26%. The number of pipeline stalls from loads to their uses is reduced by 13%, 9%, 6%, and 5%. Meanwhile, the L1 and L2 cache misses remain largely unchanged. For the 256B ucache, bypassing improves overall performance on average by 5%.
Design and architecture of a digital music library on the web
Authors: John Papadakis, Christos Douligeris
Venue: The New Review of Hypermedia and Multimedia (2002)

In this paper, a Web-based digital music library based on a three-tier architecture is presented. The digital library's primary goal is to efficiently manage distributed mp3 file collections. The proposed methodology makes use of the metadata existing inside the ID3 tag of each mp3 file. Such information is extracted from the corresponding files and stored in separate, XML-based data structures, which are part of the overall distributed information retrieval module. The digital library's actual data is kept at the back-end in a distributed fashion. Communication between the layers of the digital library and the various architectural components that reside at the middle layer is facilitated through the employment of the XML standard.
Integrated machine tool selection and operation sequencing with capacity and precedence constraints using genetic algorithm
Authors: Chiung Moon, Moonhwan Lee, Yoonho Seo, Young Hae Lee
Venue: Computers and Industrial Engineering (2002)

In this paper, an integrated machine tool selection and sequencing model is proposed. The model determines machine visiting sequences for all part types, such that the total production time for the production order is minimized and workloads among machine tools are balanced. The model is formulated as a 0-1 integer programming. To solve the model, a genetic algorithm approach based on a topological sort technique is developed. To demonstrate the efficiency of the proposed GA approach on the integrated machine tool selection and sequencing problem, a number of numerical experiments using various size problems are carried out. The numerical experiments show that the proposed GA approach is efficient to this problems.
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
Authors: Antonio Frangioni, Giorgio Gallo
Venue: INFORMS Journal on Computing (1999)

We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow problem, where the mutual capacity constraints are dualized and the resulting Lagrangean Dual is solved with a dual-ascent algorithm belonging to the class of Bundle methods. Although decomposition approaches to block-structured Linear Programs have been reported not to be competitive with general-purpose software, our extensive computational comparison shows that, when carefully implemented, a decomposition algorithm can outperform several other approaches, especially on problems where the number of commodities is "large" with respect to the size of the graph. Our specialized Bundle algorithm is characterized by a new heuristic for the trust region parameter handling, and embeds a specialized Quadratic Program solver that allows the efficient implementation of strategies for reducing the number of active Lagrangean variables. We also exploit the structural properties of the single-commodity Min-Cost Flow subproblems to reduce the overall computational cost. The proposed approach can be easily extended to handle variants of the problem.
Forecasting Practices in Mexican Companies
Authors: Jorge A. Duran, Benito E. Flores
Venue: Interfaces (1998)

A survey of firms in Mexico shows that many companies make limited use of modern forecasting methods. The forecasting techniques used in the US and included in the survey are little known or used by the reporting Mexican companies. This is in spite of the fact that business forecasting has been taught in colleges and universities in Mexico for many years. The most commonly used methods are the judgmental. A likely explanation is the unstable business situation suffered by companies in Mexico since the December 1994 devaluation. Economic instability will make it very difficult to use historical information for forecasting purposes.
Dynamic viewpoint tethering: enhancing control performance in virtual worlds
Authors: Wenbi Wang
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this study, we focus on investigating users' navigational performance with respect to the display frame of reference. Dynamic viewpoint tethering is proposed as a means to increase user control and reduce the need for mental rotations, thus facilitating the acquisition of configurational knowledge about the virtual space.The concept of dynamic viewpoint tethering is explained and recent research findings are presented. Twelve volunteers participated in an experiment in which they were instructed to control an aircraft-shaped cursor flying through a set of virtual tunnels and to answer questions about the environment. Experimental results showed that neither the loose dynamic tether nor the rigid tether supported the best control performance. Rather, optimal tether configuration lies at the centre of the rigidity continuum. The research results provide useful guidelines for the design of navigational system interfaces.
Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad Hoc Networks (SWAN)
Authors: Gahng-Seop Ahn, Andrew T. Campbell, Andras Veres, Li-Hsiang Sun
Venue: IEEE Transactions on Mobile Computing (2002)

We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable and robust manner. The proposed architecture is designed to handle both real-time UDP traffic, and best effort UDP and TCP traffic without the need for the introduction and management of per-flow state information in the network. SWAN supports per-hop and end-to-end control algorithms that primarily rely on the efficient operation of TCP/IP protocols. In particular, SWAN uses local rate control for best-effort traffic, and sender-based admission control for real-time UDP traffic. Explicit congestion notification (ECN) is used to dynamically regulate admitted real-time sessions in the face of network dynamics brought on by mobility or traffic overload conditions. SWAN does not require the support of a QOS-capable MAC to deliver service differentiation. Rather, real-time services are built using existing best effort wireless MAC technology. Simulation, analysis, and results from an experimental wireless testbed show that real-time applications experience low and stable delays under various multihop, traffic, and mobility conditions.
Teaching principles of fuzzy logic analysis using the BK-products model
Authors: Bobby C. Granville
Venue: Journal of Computing Sciences in Colleges (2003)

The objective of the course is to give students experience using a generic front-end for relational knowledge based systems that explore the advantages of fuzzy "computing with words," a natural language protocol that provides users the freedom to permit their common use of vague measurement terms in analyzing vague and partial relational knowledge structures. This course applies fuzzy logic to filter, organize, and compare verbal relational requests (queries) that relate patient symptoms with diseases. Also, an English Query Language (EQL) grammar is used to form appropriate queries that represent the BK-Product analysis being made on fuzzy relations. BK-products provide the computational structure that permits the use of natural language queries to direct a reasoning process. Students use a front-end prototype unit to parse and translate a natural language query into a BK-product meta-formula. This formula is evaluated for the degree of set membership as called for by the given product analysis.
Robustness of regional matching scheme over global matching scheme
Authors: Liang Chen, Naoyuki Tokuda
Venue: Artificial Intelligence (2003)

Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regional matching process is more robust and stable than a direct approach using a global matching process, by establishing that the former is capable of accommodating a higher level of noise than the latter before the result of the decision overturns. To extend the theory to imagery analysis, we pose a conjecture that our conclusion on the robustness of the regional matching processes remains valid not only for the simpler vote counting schemes but also for practically more important decision-making schemes in image analysis which involve dimension-reducing transforms or other features extraction processes such as principal component analysis or Gablor transforms. Two convincing experimental verifications are provided, supporting not only the theory by a white-black flag recognition problem on a pixel-by-pixel basis, but also the validity of the conjecture by a facial recognition problem in the presence of localized noise typically represented by clutter or occlusion in imagery.
A framework for teaching global information systems
Authors: Bruce J. Neubauer
Venue: Journal of Computing Sciences in Colleges (2003)

It is difficult for students to learn to a topic as vast and complex as global information systems if they lack a framework for the association of related concepts. A part of the difficulty of teaching global information systems is attempting to relate factors in human communication to machine networking and input-output devices. This paper offers a framework for teaching global information systems that incorporates both human and technical aspects.
Understanding China's telecommunications policymaking and reforms: a tale of transition toward liberalization
Authors: Bing Zhang
Venue: Telematics and Informatics (2002)

By drawing on institutional theory and bargaining theory, this paper analyzes China's telecommunications policymaking mechanism, an important but less-explored issue. Key factors of shaping China's telecommunications policy are examined and the implementation of China's telecommunications policy in network development, competition, foreign direct investment, and regulatory restructuring is investigated. Finally, the impacts of China's entry into the World Trade Organization (WTO) on its telecommunications reform and transition are discussed.
Dynamic selection and effective compression of key frames for video abstraction
Authors: Xu-Dong Zhang, Tie-Yan Liu, Kwok-Tung Lo, Jian Feng
Venue: Pattern Recognition Letters (2003)

This paper reports on a new key frame based video abstraction method. With our method, a video sequence is first segmented into a number of video shots. Several key frames are selected in each shot using a dynamic selection technique. For these key frames, a motion-based clustering algorithm is applied so that key frames in the same cluster are alike in sense of motion compensation error, while those from different clusters are quit dissimilar. Then a novel cluster-based coding scheme is developed for efficient representation of the key frames. Simulations show that the proposed method can select key frames according to the dynamics of a video sequence and abstract the video with different levels of scalability.