ppxscal/embedding_network huggingface dataset:
Website interactivity and amusement: techniques and effects
Authors: Yuan Gao
Venue: Computing information technology: the human side (2003)

This chapter reviews recent studies in the use of Website presentation techniques for commercial Websites. In particular, it examines theoretical relationships between interactivity features and amusement techniques and their potential effects on enhanced visitor experience -- more informative and entertaining Websites. Based on literature spanning research in traditional advertising media, Web advertising, user interface design, and human computer interaction, it proposes several theoretical relationships between the use of direct interactive techniques and perceived informativeness and entertainment, and between the use of amusement and humor features and perceived informativeness and entertainment. It suggests multiple future research directions and advocates further explorations that go beyond observational studies to uncover potential causal effects of certain hypermedia presentation techniques, and the combination thereof, on attitudinal and behavioral outcomes.
Maximizing the Shannon Capacity of Constrained Systems with Two Constraints
Authors: Navin Kashyap
Venue: SIAM Journal on Discrete Mathematics (2004)

In this paper, we consider the problem of finding the set $\{A,B\} \subset {0,1}m that maximizes, among all 2-subsets of ${\{0,1\}}^m$, the Shannon capacity, H(A,B), of a constrained system of binary sequences that do not contain A or B as a contiguous subsequence. This problem is motivated by the problem of finding a pair of length-m binary sequences, called markers, that achieves the maximum rate, R(2,m,n), of a (2,m,n) periodic prefix-synchronized (PPS) code. A (2,m,n) PPS code is a binary block code with two length-m markers, A,B, and codewords of length n that inserts A and B alternately at regular intervals in the encoded bitstream, with the additional constraint that A and B may not appear anywhere in the encoded bitstream other than where inserted. We show that for any $m \geq 2$, $\lim_{n \rightarrow \infty} R(2,m,n) = \max\{H(A,B): \{A,B\} \subset {\{0,1\}}^m\} = \log_2\rho_{m-1}$, where $\rho_{m-1}$ is the largest-magnitude zero of the polynomial $z^{m-1} - z^{m-2} - \cdots - 1$. Moreover, we completely characterize the sequences A and B that achieve $\max H(A,B), as well as those that achieve R(2,m,n) for all sufficiently large n.
Gestural communication over video stream: supporting multimodal interaction for remote collaborative physical tasks
Authors: Jiazhi Ou, Susan R. Fussell, Xilin Chen, Leslie D. Setlock, Jie Yang
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

We present a system integrating gesture and live video to support collaboration on physical tasks. The architecture combines network IP cameras, desktop PCs, and tablet PCs to allow a remote helper to draw on a video feed of a workspace as he/she provides task instructions. A gesture recognition component enables the system both to normalize freehand drawings to facilitate communication with remote partners and to use pen-based input as a camera control device. Results of a preliminary user study suggest that our gesture over video communication system enhances task performance over traditional video-only systems. Implications for the design of multimodal systems to support collaborative physical tasks are also discussed.
A new class of methods for solving ordinary differential equations
Authors: N. Moir
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Almost Runge-Kutta methods are a sub-class of the family of methods known as general linear methods, used for solving ordinary differential equations. They retain many of the properties of traditional Runge-Kutta methods, with some added advantages. The higher stage order enables cheap error estimators to be obtained. For some orders it also means a reduction in the number of internal stages required to obtain that order. We will introduce these methods and present some recent results.
Engineering a multi-purpose test collection for web retrieval experiments
Authors: Peter Bailey, Nick Craswell, David Hawking
Venue: Information Processing and Management: an International Journal (2003)

Past research into text retrieval methods for the Web has been restricted by the lack of a test collection capable of supporting experiments which are both realistic and reproducible. The 1.69 million document WT10g collection is proposed as a multi-purpose testbed for experiments with these attributes, in distributed IR, hyperlink algorithms and conventional ad hoc retrieval.WT10g was constructed by selecting from a superset of documents in such a way that desirable corpus properties were preserved or optimised. These properties include: a high degree of inter-server connectivity, integrity of server holdings, inclusion of documents related to a very wide spread of likely queries, and a realistic distribution of server holding sizes. We confirm that WT10g contains exploitable link information using a site (homepage) finding experiment. Our results show that, on this task, Okapi BM25 works better on propagated link anchor text than on full text.WT10g was used in TREC-9 and TREC-2000 and both topic relevance and homepage finding queries and judgments are available.
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem
Authors: Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
Venue: Journal of Scheduling (2004)

The weakly NP-hard single-machine total tardiness scheduling problem has been extensively studied in the last decades. Various heuristics have been proposed to efficiently solve in practice a problem for which a fully polynomial time approximation scheme exists (though with complexity O(n7/&epsi;)). In this note, we show that all known constructive heuristics for the problem, namely AU, MDD, PSK, WI, COVERT, NBR, present arbitrarily bad approximation ratios. The same behavior is shown by the decomposition heuristics DEC/EDD, DEC/MDD, DEC/PSK, and DEC/WI.
Understanding senior management's behavior in promoting the strategic role of IT in process reengineering: use of the theory of reasoned action
Authors: Ing-Long Wu
Venue: Information and Management (2003)

Information technology has been considered as both a strategic catalyst and enabler of business process reengineering (BPR). An area of major concern has been the difficulty to convince senior management's reluctant behavior toward promoting the strategic role of IT in process reengineering. There has been relatively little research on this topic. Furthermore, one common approach might be merely to study senior management's behavior as a whole. What appears to be missing is an examination of the possible underlying reasons for senior management's behavior. The theory of reasoned action (TRA) may provide a basis for analyzing the behavior. In particular, it can be used to assess the effects of interventions designed to change behavior. Basically, this framework has three steps: (1) examining original behavior, (2) developing remedial actions for negative behavior, and (3) assessing the changed behavior. Furthermore, this framework is examined by an empirical study to understand its application in practice.
A Dynamic IT Adoption Model for the SOHO Market: PC Generational Decisions with Technological Expectations
Authors: Namwoon Kim, Jin K. Han, Rajendra K. Srivastava
Venue: Management Science (2002)

Thesmall-office/home-office (SOHO) professionals comprise the fastest growing segment in the labor force today. Typically being a one-person business based at home, SOHO owners mostly rely on office information technology to single handedly run their entire operation. Despite the segment's ostensibly growing dependence and influence on the information technology (IT) industry, still very little is known about the dynamics between SOHO and IT products. With the purpose of addressing this void, we investigate the SOHO professionals' adoption patterns of multigenerational IT products. Accordingly, we develop and empirically estimate an individual SOHO-levelinitial- andrepeat-purchase logit model that captures the procurement patterns for successive generations of technological products, namely the PC category. Specifically, we find that SOHO professionals' procurement choices are influenced by a number of salient dimensions (i.e., income, performance, price, interpurchase time, network externalities). Furthermore, some SOHO owners are found to have a preference for a future (expected) generation (over a currently available one), which is explained via their business dispositions (i.e., technology orientation, result orientation, search orientation) toward accepting technological incertitude.
Dynamic Business Process Formation by Integrating Simulated and Physical Agent Systems
Authors: Fu-ren Lin, Shyh-ming Lin, Po-win Hsueh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

This paper proposes a new framework that integrates simulated and physical agents to provide an efficient way for companies to form supply chains dynamically. In this integrated framework, physical agents coordinate with inter-organizational physical agents to conduct business processes whereas simulated agents model and analyze business processes to support physical agents in making rational decisions under uncertain situation and with incomplete information. This paper surveys different techniques used for dynamic process coordination and explains how the proposed integrated framework can be used by companies to reach a commonly accepted goal in dynamic supply chains. This paper also elaborates the efficient supply chain formation using a business process example of the mold industry, andfinally discusses the development issues of this framework and future research directions.
Stratified rotating flow over complex terrain
Authors: C. R. Torres, J. E. Castillo
Venue: Applied Numerical Mathematics (2003)

We present a full 3-dimensional time dependent curvilinear ocean model in boundary-fitted grids. The model solves the primitive non-linear Navier-Stokes equations under the Boussinesq approximation in a rotating system. Three-dimensional simulations are made for a stratified flow over two different topographic configurations. The results for the velocity and density fields are presented and discussed.
Static vs. Dynamic Recovery Models for Survivable Distributed Systems
Authors: Joon Park, Pratheep Chandramohan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The need for survivability is more pressing for mission-critical systems, especially when they are integrated with other COTS products or services. As information systems became more complex and the interdependence of these systems became higher, the survivability picturebecame more complicated. In this paper, we introduce two basic models with respect to static and dynamic models, where each model has restart and continue modes. We describe each approach and compare the trade-offs in terms of simplicity, resource efficiency, adaptation, service downtime, immunization, and robustness. Later, we introduce a hybrid model bycombining these two basic models. Our approaches are transparent to the client side and can be applied to existing distributed systems by extending the server side with the components necessary for the schemes.
Challenging Formal Specifications by Mutation: a CSP security example
Authors: Thitima Srivatanakul, John A. Clark, Susan Stepney, Fiona Polack
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

When formal modelling is done we must validate boththe model and the assumptions. Formal techniques tendto concentrate on the former. We examine how fault injection(specification mutation) and model checking can helpaddress the latter, in particular, the effects of failure. Wefind that, in contrast with software testing, where they are aproblem, "equivalent mutants" are valuable for specificationvalidation.
Term project user interface specifications in a usability engineering course: challenges and suggestions
Authors: L. M. Leventhal, J. Barnes, J. Chao
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Term projects in an undergraduate Usability Engineering (UE) course provide opportunities for students to put the abstract ideas of what they have learned in class into practice. Projects provide students with opportunities to learn that the process of usability engineering is rarely as smooth as it would seem in the abstract. Moreover, term projects give students the opportunity to learn about specific methodologies and notations.One critical phase of the term project is the user interface specification; in our undergraduate UE course we have found the specification phase to be a significant pedagogic challenge. Key elements to that challenge are: 1) Presenting the project requirements in such a way that the students can generate a specification, 2) Defining the form and format for student work, 3) Teaching the process of specification and 4) Assessing the students' work. In this paper, we describe our approach to each of these four challenges. Since 1996, we have had good success with our approach; however, student data suggests that students still find the UE specification process difficult. In Spring 2003, we added some extra steps in our process that seem to lead to greater student understanding and success.
A social metaphor-based 3D virtual environment
Authors: Steve DiPaola, David Collins
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Our design goal for OnLive Traveler was to develop a virtual community system that emulates natural social paradigms, allowing the participants to sense a tele-presence, the subjective sensation that remote users are actually co-located within a virtual space. Once this level of immersive "sense of presence" and engagement is achieved, we believe an enhanced level of socialization, learning, and communication are achievable.OnLive Traveler is a client-server application allowing realtime synchronous communication between individuals over the Internet. The Traveler client interface presents the user with a shared virtual 3D world, in which participants are represented by avatars. The primary mode of communication is through multi-point, full duplex voice, managed by the server.We examine a number of very specific design and implementation decisions that were made to achieve this goal within platform constraints. We also will detail some observed results gleaned from the virtual community and virtual learning user-base, which has been using Traveler for several years.
Community support in universities: the Drehscheibe project
Authors: Michael Koch
Venue: Communities and Technologies (2003)

Community support systems (community platforms) that are providing a rich communication medium for work or interest groups are gaining more and more attention in application areas ranging from leisure support and customer support to knowledge management. One of these application areas is the support of teaching and research activities in universities. In this article we present a community support system we have been developing and using for seven years in different university departments. In contrast to other work on community support for universities the system does not focus on lecture support or on knowledge management alone, but provides a generic communication and matchmaking medium. We will present the basic functionality of the system and elaborate into some observations we have made in the usage period.
Multiple-view image sequence analysis: three-dimensional structure and motion from optical flows
Authors: Ha Vu Le
Venue:  (2003)

The topic of this research is the recovery of three-dimensional (3-D) structures and motions of moving objects in a dynamic scene. Object structures and motions under consideration are reconstructed in the forms of surfaces and their dense 3-D motion fields. No a priori knowledge of objects and their motions is required. Our approach to solving the problem is a combination of 3-D surface reconstruction from multiple views and optical flow-based structure-from-motion approach. We proposed a hierarchical framework in which motions and depths are computed first, at feature points of each image frame from the correspondences of feature points between consecutive frames of each view, and between corresponding frames of different views. Then, the dense optical flow and depth map for each image frame are estimated from motions and depths at features by applying mesh-based approximation methods. Flow fields and depth maps from multiple views can be fused together by using multiview fusion techniques like back-projection and feature-linking to produce refined results. 3-D scene flows can be recovered from depth maps and 2-D optical flows. Accurate motion and depth at each pixel can be computed by using the estimated values and correlation matching to find the correct correspondences of that pixel in other frames and views. Problems with correlation matching include ambiguities and occlusions, when more than one match or no match can be found. Constraints between depth and motion can help solve these problems. We have developed a closed-form solution through constructive geometry for a special case of the structure-from-motion problem with four rigid points. The solution allows the 3-D position of a point to be calculated from its projected 2-D motion and the 3-D positions and motions of three feature points without having to solve a non-linear system. These techniques have been tested with simulated and real image sequences. In particular, the affine approximation technique for optical flow estimation performs well comparing to many other commonly-used techniques on a set of test sequences developed exclusively for the purpose of testing optical flow techniques. Details of the experimental results are reported in this dissertation.
Computing System Failure Frequencies and Reliability Importance Measures Using OBDD
Authors: Yung-Ruei Chang, Suprasad V. Amari, Sy-Yen Kuo
Venue: IEEE Transactions on Computers (2004)

Abstract--The recent literature showed that, in many cases, Ordered Binary Decision Diagram (OBDD)-based algorithms are more efficient in reliability evaluation compared to other methods such as the Inclusion-Exclusion (I-E) method and the sum of disjoint products (SDP) method. This paper presents algorithms based on OBDD to compute system failure frequencies and reliability importance measures. Methods are presented to calculate both steady-state and time-specific frequencies of system-failure as well as system-success. The reliability importance measures discussed in this paper include the Birnbaum importance, the Criticality importance, and other indices for the risk evaluation of a system. In addition, we propose an efficient approach based on OBDD to evaluate the reliability of a nonrepairable system and the availability of a repairable system with imperfect fault-coverage mechanisms. The powerful capability of OBDD for reliability evaluation is fully exploited in this paper. Further, we extend all of the proposed algorithms in this paper to analyze systems with imperfect fault-coverage.
Assessing Vulnerability of Proposed Designs for Interdependent Infrastructure Systems
Authors: Earl E. Lee,  II, John E. Mitchell, William A. Wallace
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Recent events have heightened our awareness of the vulnerability of civil infrastructure systems. Most of the research on this topic has focused on individual systems, while more recent efforts have recognized the interconnectedness of systems. Infrastructure systems have become so highly interconnected that a failure in one system can propagate through many systems and affect large geographic areas. The focus of this research is on reducing vulnerability by adding redundancy while taking into account the interdependencies ofinfrastructure systems.The paper first presents background and definitions related to interdependent infrastructure systems. An algorithm is then presented that identifies vulnerabilities in the current and proposed designs due to interdependencies with other infrastructure systems. Anillustrative case, the reliance of telecommunications on power, is used to demonstrate the practicality of the proposed procedure. The paper concludes with a discussion of further research, both theoretical and operational.
2002 Copper Mountain Conference
Authors: Henk vander Vorst, Guest Editor
Venue: SIAM Journal on Scientific Computing (2003)

The Copper Mountain Conference on Iterative Methods, a biennial event organized by the University of Colorado in cooperation with SIAM, has become a tradition. The seventh edition took place March 24--29, 2002, and while traditions are often associated with graying hairs, the Copper Mountain keywords are still fresh, young, dynamic, and inspiring. It is the successful formula developed by Tom Manteuffel and Steve McCormick that keeps the event going strong. In publishing, one has to be prudent with traditions, but the formula led again in 2002 to an attractive mix of new, valuable material, and it was readily decided by the Program Committee to collect the best contributions as papers to form the kernel of a special issue. As in foregoing years, the committee members accepted the invitation to act as guest editors. SIAM accepted our proposal and offered us space in SISC. This special issue was well announced, even in advance of the conference, to offer those not attending the opportunity to contribute. In past years this open procedure had led to highly appreciated special issues. When the deadline for submission had expired, we found some 32 manuscripts on our desks, which after careful refereeing led to this eventual collection of 22 outstanding papers. (Some papers that failed to meet intermediate deadlines will find their way into regular issues of SISC.) These 22 papers reflect the best new ideas on various aspects of iterative methods, with continuing research efforts on preconditioning (seven manuscripts). The separation between multigrid and iterative techniques, once very strict, has become more vague, and so we find eight manuscripts that explore ideas based on the multigrid paradigm (including multilevel ideas). Iterative methods related to eigenproblems, an upcoming field in the 1990s, fell back to one or, with some goodwill, two papers. Personally I hope that this is a temporary dip. The other papers cover various ideas, such as improvements of the good old Gram--Schmidt orthogonalization procedure, inexact Newton methods, and continuation methods. The quality of this issue depends on the hard work and dedication of many people, among whom the authors are of course the most visible. We would like to thank the many anonymous referees for their hard work and their efforts to help meet the strict deadlines. We also thank the SIAM staff for their kind support and for all their efforts in editing and helping bring this issue to life. It is now up to the reader to discover the many jewels in this treasure box. We hope that this special issue will stimulate further progress in our exciting area of research.
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8
Authors: Gunnar Brinkmann
Venue: Combinatorics, Probability and Computing (1998)

In this paper we will give all Ramsey numbers r(K3, G) for connected graphs G of order 7 and 8. For smaller orders and non-connected graphs of order up to 8, the number of graphs with given Ramsey number is listed for all possible values.