ppxscal/embedding_network huggingface dataset:
Trust and technology in virtual teams
Authors: Steven A. Morris, Thomas E. Marshall, R. Kelly Rainer,  Jr.
Venue: Advanced topics in information resources management (2003)

Pressured by the growing need for fast response times, mass customization and globalization, many organizations are turning to flexible organizational forms, such as virtual teams. Virtual teams consist of cooperative relationships supported by information technology to overcome limitations of time and/or location. Virtual teams require their members to rely heavily on the use of information technology and trust in coworkers.This study investigates the impacts that the reliance on information technology (operationalized in our study via the user satisfaction construct) and trust have on the job satisfaction of virtual team members. The study findings reveal that both user satisfaction and trust are positively related to job satisfaction in virtual teams, while system use was not found to play a significant role. These findings emphasize that organizations seeking the benefits of flexible, IT-enabled virtual teams must consider both the level of trust among colleagues, and the users' satisfaction with the information technology on which virtual teams rely.
An E-Learning Module on Negotiation Analysis
Authors: Harri Ehtamo, Raimo P. Hämäläinen, Ville Koskinen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

We describe a web-site containing material and tools for learning mathematical models of negotiation analysis and discuss students' experiences of its use. The site is part of our general e-learning decision making site, www.dm.hut.fi.The negotiation analysis section provides an introduction to the theory and gives online practice in negotiation support. The material consists of theory sections, case studies and assignments. It also includes quizzes for self-evaluation and video clips illustrating the use of the Joint Gains software.Models of negotiation analysis are especially suitable for e-learning because of their interactive nature. The Joint Gains is an interactive negotiation support system for multi player multi issue negotiation problems and it is intended for real-life negotiations. Here, we apply the Joint Gains as an interactive tool for active learning through role-playing experiments in educational context."Introduction to game theory and negotiation" learning module was evaluated in a web-course on mathematical modeling. The experiences were encouraging and mainly positive; the students are willing to work in similar learning environments in the future.
JUnit in Action
Authors: Vincent Massol, Ted Husted
Venue:  (2003)

A guide to unit testing Java applications (including J2EE applications) using the JUnit framework and its extensions, this book provides techniques for solving real-world problems such as unit testing legacy applications, writing real tests for real objects, automating tests, testing in isolation, and unit testing J2EE and database applications. Using a sample-driven approach, various unit testing strategies are covered, such as how to unit test EJBs, database applications, JSPs, and Taglibs. Also addressed are testing strategies using freely available open source frameworks and tools, and how to unit test in isolation with Mock Objects. Testing J2EE applications by running tests from inside the container for performing integration unit tests is discussed, as is how to automate unit testing in automated builds (such as Ant and Maven) for performing continuous integration.
Extending TINA with Secure On-Line Accounting Services
Authors: Carlos Becker Westphall, Abderrahim Sekkaki, Luis Marco Cáceres Alvarez, Wagner Tatsuya Watanabe
Venue: Journal of Network and Systems Management (2003)

Concepts and principles of TINA (Telecommunications Information Networking Architecture) are introduced with the objective of correcting problems of the current centralized service control and service data model in an IN (Intelligent Network). It is becoming increasingly clear that the future sophisticated telecommunication services, e.g., multimedia, and multi-party conferencing, breaking away from the traditional telephony call model will need the solutions for rapid and efficient introduction, deployment, operations, and management.In this paper, we discuss accounting features and requirements, as well as security services in the TINA management context. We will introduce and present an implementation of a model for a security management, based on secure objects, cryptography and certificate distribution. In order to provide secure services, secure objects that have security functionality, such as authentication and access control, have been defined. Secure objects in our model are CORBA objects. The security domain is also called SBS (Security Base Server), provides security services and has an SMIB (Security Management Information Base) that contains security policies, cryptographic algorithms, and other relevant information. A prototype has been implemented and some experimental results are presented.
Verifying Haskell Programs by Combining Testing and Proving
Authors: Peter Dybjer, Qiao Haiyan, Makoto Takeyama
Venue: Proceedings of the Third International Conference on Quality Software (2003)

We propose a method for improving confidence in thecorrectness of Haskell programs by combining testing andproving. Testing is used for debugging programs and specificationbefore a costly proof attempt. During a proof development,testing also quickly eliminates wrong conjectures.Proving helps us to decompose a testing task in a way thatis guaranteed to be correct. To demonstrate the method wehave extended the Agda/Alfa proof assistant for dependenttype theory with a tool for random testing. As an examplewe show how the correctness of a BDD-algorithm written inHaskell is verified by testing properties of component functions.We also discuss faithful translations from Haskell totype theory.
The hierarchical language system
Authors: Nobuyoshi Terashima
Venue: ACM SIGPLAN Notices (1977)

The Hierarchical Language System HLS is presented. HLS consists of the structured programming language SPL and the extensible programming language EPL which is built upon SPL layer and provides statement and expression extention facilities, and provides to automate top down programming as much as possible by the following means.(1) To describe each breakdown process in the programming languages EPL and SPL, in order to eliminate ambiguity of each breakdown representations which are in general written in natural languages.(2) To generate the whole system which runs in the actual programming environment by this system.This paper describes HLS concepts and language specifications of its components.HLS effectiveness is to be presented in the near future.
Fault-tolerant cycle-emebedding of crossed cubes
Authors: Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
Venue: Information Processing Letters (2003)

The crossed cube CQn introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQn is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting fe and fv be the numbers of faulty edges and vertices in CQn, we show that a cycle of length l, for any 4 ≤ l ≤ |V(CQn)| - fv, can be embedded into a wounded crossed cube as long as the total number of faults (fv + fv) is no more than n - 2, and we say that CQn is (n - 2)-fault-tolerant pancyclic. This result is optimal in the sense that if there are n - 1 faults, there is no guarantee of having a cycle of a certain length in it.
Adaptive dynamic thread scheduling for simultaneous multithreaded architectures with a detector thread
Authors: Jean-Luc Gaudiot
Venue:  (2002)

Simultaneous Multithreading (SMT) attempts to attain the high resource utilization by allowing instructions from multiple independent threads to coexist in a processor and compete for shared resources. Earlier studies, however, have shown that the performance of a realistic SMT architecture begins to saturate as the number of hardware contexts increases beyond four or five. In this work, we attempt to prove our contention that a single fixed hardware thread scheduling strategy cannot provide optimal results for the various unpredictable thread combinations it faces. We propose an approach that partially schedules threads in software in the form of a detector thread at nominal hardware and software costs. Our approach offers the capability to adaptively switch thread scheduling policies depending on the situations which are likely to vary constantly in a hard-to-predict manner. We show that there is much room for performance improvement for the adaptive dynamic thread scheduling approach. The results we have obtained by simulating a realistic SMT architecture show that no single fetch policy is the best solution for more than 50% of the total time. We show that significant performance improvement for SMT with eight contexts can be attained by allowing switching of fetch policies. We propose a software architecture for the detector thread and evaluate various heuristics for determining better fetch policies which comprise the core function of the software. We found that, under a restrictive configuration, our approach could outperform a fixed scheduling by up to 30%.
Applying JAVA-triggers for X-link management in the industrial framework
Authors: Abraham Alvarez, Y. Amghar
Venue: Effective databases for text & document management (2003)

This chapter focuses on referential link integrity problems. In the industrial context, the life cycle of a document plays a central role in describing the "steps out" of a product. Users realize some manipulations like creation, edition, suppression and querying under a multi-user environment, risking possible destruction or the alteration of the document's integrity. A classical impact is the infamous "Error 404: file not found." However, the user needs a notification alert mechanism to prevent and warrant the coherence of manipulations over all the life cycle processes of a product. The main objective of this chapter is to provide a generic relationship validation mechanism to remedy this shortcoming. We believe in the combination of some standard features of XML, specifically XLL specification as a support for integrity management and Java-Triggers approach as an alert method. This study, compared with actual approaches, proposes a solution based on active functionalities.
Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
Authors: Tiziana Calamoneri, Miriam Di Ianni
Venue: Journal of Parallel and Distributed Computing (2003)

In this paper we propose compact routing schemes having space and time complexities comparable to a 2-interval routing scheme for the class of networks decomposable as layered cross product (LCP) of rooted trees. As a consequence, we are able to design a "quasi" 2-interval routing scheme (i.e. a 2-interval routing scheme plus a fast and small local algorithm) for butterflies, meshes of trees and fat trees. Then we show that a compact routing scheme for general networks which are LCP of cyclic graphs cannot be found by any method using only information about shortest paths on the factors. Nevertheless, we extend our scheme to Benes networks, although they cannot be decomposed as the LCP of trees.
Children's perception of computer programming as an aid to designing programming environments
Authors: Robert Sheehan
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

Primary school pupils of two different age groups were asked to draw pictures of people programming computers and then asked questions to reveal their understanding of computer programming. As was expected neither group showed great understanding of how computer programs are produced. Programming was seen as the productions of visual and audio effects. The older children recognised that programming was something to do with controlling the computer. These understandings are used to produce a list of four recommendations for the design of programming environments for children.
Generative processes and the electronic arts
Authors: Alan Dorin
Venue: Organised Sound (2001)

This paper gives a personal perspective on the application and relevance of generative processes to art production. This view is that of a computer programmer, rather than that of a user of computer programs written (or hardware constructed) by others. The programmer is in the unique position of being able to describe and manipulate abstract processes which may be used as a unique means of artistic expression. This gives a greater amount of freedom to the programmer/artist than is the case when he or she is limited by programmed procedures defined by others.Prior to the development of a formal means of specifying visual and aural events, a concrete machine or set of rules for their manipulation and a means of bringing these representations back into the world as physical events, abstract processes were things to be contemplated but not experienced. Musical and spatial notations employed by artists, engineers and others, in concert with the programming of computing hardware, have opened the way for those who wish to manipulate processes in their artistic practice.In order to focus study and practice in the area of such generative computer art, the Center for Electronic Media Art (CEMA) has been established in Melbourne, Australia. The Center has spawned an international conference series on generative/process-based electronic art called Iteration. The perceived roles of the Center and Iteration conferences are discussed in this paper.
An Application of Parallel Discrete Event Simulation Algorithms to Mixed Domain System Simulation
Authors: D. K. Reed, S. P. Levitan, J. Boles, J. A. Martinez, D. M. Chiarulli
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We present our system-level co-simulation environment for mixed domain microsystems. Theenvironment provides synchronization and cosimulation between the Chatoyant MOEMS (Micro-Electro Mechanical Systems) simulator and ModelTech ModelSim. By using shared memory IPC (Inter-Process Communication) and PDES (Parallel Discrete Event Simulation) techniques, we achieve two orders of magnitude speedup over standard pipe/socket communication.
Obtaining complete 2&#x00BD;D view representation of polyhedra using concept of seedling single-view area
Authors: M. Kowalczyk, W. S. Mokrzycki
Venue: Computer Vision and Image Understanding (2003)

This article deals with construction of complete 2½D exact view models of polyhedral objects for visual identification systems. In particular, a new method and an algorithm views generation using the view sphere with perspective concept are described. A set of views generated by this method forms a complete view representation of the object. The method of ensuring completeness of the view representation by controlling covering of the view space (by single-view areas) is used in the presented algorithm. The perspective projection used for calculating the views, the total, tight covering of the view sphere by the single-view areas and 2½-dimensionality of the views ensure, in our opinion, unambiguous and proper identification of polyhedral objects. The method consists in calculating single (any) view, determining the corresponding single-view area (so-called seedling single-view area) and then spiral propagation of neighbouring single-view areas until the whole view sphere is covered by them (i.e., until the border register containing the border between the covered and uncovered parts of the view sphere becomes empty). Having a complete set of single-view areas, we get a complete set of views as well. A method of determining single-view areas for convex polyhedra is also presented.
Composers' views on mapping in algorithmic composition
Authors: Paul Doornbusch
Venue: Organised Sound (2002)

Mapping concerns the connection between gestures, or structures and audible results in a musical performance or composition. While this is of intense interest to performers of new instruments and instrument designers, it has also been an area of interest for some composers. Algorithmic composition is sometimes the process of imagining a gesture or structure - perhaps physical or visual - and then applying a mapping process to turn that &lsquo;gesture&rsquo; of the conceptual domain into sound which may display the original conception in some way. This article looks at mapping from the point of view of algorithmic composition, particularly where persistence is an issue, such that the gesture (conceptual domain) is embodied and perceptible in the musical result.
Managing e-transformation in the public sector: an e-government study of the inland revenue authority of Singapore (IRAS)
Authors: Chee Wee Tan, Shan L. Pan
Venue: European Journal of Information Systems (2003)

Continuous organizational transformation is becoming a common phenomenon as public agencies rapidly embrace new information technologies (IT) to streamline and re-invent their obsolete operations. However, due to the overwhelming extent of the necessary changes as well as the sheer diversity of stakeholders involved in transforming corporate functions practitioners are finding it difficult to manage the level of dynamism required in the effort. In an attempt to shed some light on the phenomenon of managing e-transformation, this paper examines in-depth an e-government initiative. Through the study of how one organization in the public sector adapts to the dynamic customer relations brought about by e-transformation, the case serves to identify the governing factors for successful organization-stakeholder relations, and how these may have a bearing on the development of effective e-transformation strategies. An important contribution of this study is the proposal of a development model of relationships in organizations for an understanding into how organization-stakeholder relationships can be efficiently managed to bring about an effective overhaul of business processes.
Novelty detection: a review&mdash;part 2: neural network based approaches
Authors: Markos Markou, Sameer Singh
Venue: Signal Processing (2003)

Novelty detection is the identification of new or unknown data or signal that a machine learning system is not aware of during training. In this paper we focus on neural network-based approaches for novelty detection. Statistical approaches are covered in Part 1 paper.
The LAPACK for Clusters Project: An Example of Self Adapting Numerical Software
Authors: Zizhong Chen, Jack Dongarra, Piotr Luszczek, Kenneth Roche
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

This article describes the context, design, and recent development of the LAPACK for Clusters (LFC) project (LAPACK stands for Linear Algebra PACKage). It has been developed in the framework of Self-Adapting Numerical Software (SANS) since we believe such an approach can deliver the convenience and ease of use of existing sequential environments bundled with the power and versatility of highly-tuned parallel codes that execute on clusters. Accomplishing this task is far from trivial as we argue in the paper by presenting pertinent case studies and possible usage scenarios.
Visualizing the pulse of a classroom
Authors: Milton Chen
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Effective classroom teaching often requires an instructor to be acutely aware of every student. The instructor must rapidly look from student to student to catch fleeting gestures or facial expressions. To facilitate the tracking of communicative actions in a remote classroom, we built a multiparty videoconferencing system that automatically determine whether students are speaking, making gestures, or moving in their seats. These activity indicators are displayed over the video such that the instructor can see into the recent past. The activity indicators are also grouped into a visualization of the classroom interaction dynamics, thereby providing a measure of the pulse of the classroom.We conducted a user study where teachers used our system in a simulated class. The teachers found that the activity indicators to be a useful teaching aid during class; however, the indicators are most useful as a record of the class. In a student survey, we found that if audio, video, or activity indicators must be recorded, students overwhelmingly prefer activity indicators since the indicators mask the content of the communication and thus are less intrusive to the students' privacy.
Conflict-aware replication for dynamic content web sites
Authors: Cristiana Amza
Venue:  (2003)

Conflict-aware replication is a novel lazy replication technique for scaling the back-end database of a dynamic content web server using a cluster of commodity computers. This technique provides both throughput scaling and 1-copy serializability. It has generally been believed that this combination is hard to achieve through replication because of the growth of the number of conflicts. Conflict-aware replication interposes a (possibly replicated) scheduler between the database and application server tiers. The conflict-aware scheduler directs incoming queries in such a way that the overall execution is serializable and the number of conflicts is reduced. The technique requires that the incoming transactions specify the tables that they access at the beginning of the transaction. Using this information, conflict-aware replication provides both scaling and 1-copy serializability, while it avoids making any changes to the application server or database. We have implemented a prototype of the conflict-aware scheduler in a cluster-based dynamic content site. We have also implemented various other scheduler algorithms in this prototype for comparison purposes, including conflict-aware and oblivious, with 1-copy serializability and with different looser consistency models. We have evaluated this method using the industry standard TPC-W e-commerce benchmark, an auction site benchmark, modeled after eBay.com, and a bulletin board benchmark, modeled after slashdot.org. For these applications, we have found that pre-specifying what tables are accessed involves very little work on behalf of the programmer and could easily be automated. For clusters with small number of database machines (up to 8) we have measured an implementation of the algorithms. We use simulation to extend our measurement results to larger clusters, faster database engines, and lower conflict rates. This dissertation shows that conflict-awareness brings considerable benefits in terms of both overall throughput scaling and latency reduction compared to both eager and conflict-oblivious lazy replication for a large range of cluster configurations and conflict rates. Furthermore, for all our applications, except those with very high conflict rates, the performance of conflict-aware replication equals or approaches that of looser consistency models. The dissertation also shows that the cost of conflict-aware replication is minimal in terms of data availability and fault tolerance.