ppxscal/embedding_network huggingface dataset:
Shared Leadership and Group Interaction Styles in Problem-Solving Virtual Teams
Authors: Pierre Balthazard, David Waldman, Jane Howell, Leanne Atwater
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Despite their prevailing growth, little systematic evidence exists regarding the effectiveness of computer-mediated "virtual" teams (VTs), especially in relation to their traditional counterpart, face-to-face teams (FtFTs). A Partial Least Squares (PLS) analysis revealed that FtFTs were more likely to demonstrate higher levels of shared leadership and a constructive interaction style than were VTs. In turn, shared leadership and a constructive interaction style were shown to positively predict cohesion, whereas a defensive interaction style was shown to negatively predict cohesion. Shared leadership was also positively associated with a constructive interaction style and negatively associated with a defensive interaction style. Finally, task performance was shown to be a function of group cohesion.
Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis
Authors: Belén Melián, Manuel Laguna, José A. Moreno-Pérez
Venue: Computers and Operations Research (2004)

In this paper we provide an arc-path formulation for the problem of locating and sizing wavelength division multiplexing (WDM) and optical cross-connect (OXC) equipment in a fiber optic network. The problem is heuristically solved by limiting the number of paths for each demand and applying CPLEX to the resulting formulation. The results obtained are then compared to those given by a metaheuristic method previously developed for this problem. A set of real and randomly generated instances with different characteristics associated with actual telecommunication networks are used to assess the performance of both solution approaches.
Integrating Data Flow Equations with UML/Realtime
Authors: Lutz Bichler, Ansgar Radermacher, Andreas Schürr
Venue: Real-Time Systems (2004)

Object-oriented (OO) modeling languages, tools, and methods more and more attract the interest of embedded (real-time) system developers. This is especially true if embedded (real-time) system software has to cooperate with interactive multimedia software, as it is more and more the case in automotive systems. It is still an open question whether and how the standard OO modeling language UML and its accompanying tools have to be adapted to the regarded application domain. This paper evaluates the development of a rapid prototype for an air condition controller with the popular CASE tool Rational Rose/RT&reg;. We point out some weaknesses of the presented solution and propose an extension to Rose/RT&reg;, which overcomes the weaknesses by combining Rose/RT&rsquo;s UML dialect with data flow equations.
Hadamard matrices, orthogonal designs and construction algorithms
Authors: Stelios Georgiou, Christos Koukouvinos, Jennifer Seberry
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

We discuss algorithms for the construction of Hadamard matrices. We include discussion of construction using Williamson matrices, Legendre pairs and the discret Fourier transform and the two circulants construction.Next we move to algorithms to determine the equivalence of Hadamard matrices using the profile and projections of Hadamard matrices. A summary is then given which considers inequivalence of Hadamard matrices of orders up to 44.The final two sections give algorithms for constructing orthogonal designs, short amicable and amicable sets for use in the Kharaghani array.
Non-approximability of precedence-constrained sequencing to minimize setups
Authors: Craig A. Tovey
Venue: Discrete Applied Mathematics (2004)

It is a basic scheduling problem to sequence a set of precedence-constrained tasks to minimize the number of setups, where the tasks are partitioned into classes that require the same setup. We prove a conjecture in (Ph.D. Thesis, School of ISyE, Georgia Institute of Technology, August 1986; Oper. Res. 39 (1991) 1012) that no polynomial-time algorithm for this problem has constant worst-case performance ratio unless P = NP. A very simple algorithm has performance ratio √n.
Email classification for contact centers
Authors: Ani Nenkova, Amit Bagga
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The explosive growth of the Internet has made email an integral part of business communication. Therefore, business customer service centers, or contact centers, are processing larger amounts of email interactions with customers. In this paper we discuss a preliminary email routing and classification system that filters and classifies incoming email messages upon their content. A module first attempts to identify and filter those email messages that do not require immediate (if any) responses. We call such email messages single messages. The emails that do require immediate responses are called root messages. A second module classifies messages in categories that characterize the type of interaction between the contact center operators and the customers. Emails that are involved in such interactions form a thread and can be classified broadly into one of three categories: root, inner, and leaf. Root messages are those that start a thread while a leaf message is the final email sent in an interaction. All other emails in the interaction are considered to be inner messages.
Preparation of 0.5 &#x00B5;m thick self-patternable PZT films by sol-gel procedure for applying to the micro-detection system
Authors: Jae-Seob Hwang, Woo Sik Kim, Hyung-Ho Park, Tae-Song Kim
Venue: Microelectronic Engineering (2003)

Lead zirconate titanate (PbZrxTi1-xO3; PZT) (x=0.52) films using photosensitive PZT solution were formed on platinum(111)-coated Si substrate by sol-gel method. A relative thick self-patternable PZT film using photosensitive stock solution with 15% of excess Pb and UV (365 nm) irradiation has reached an advanced state in the application area of micro-detection system. Well-developed physical and electrical properties were observed after final anneal treatment due to the adaptation of optimized intermediate anneal treatment to remove organic groups in the film without the formation of pyrochlore phase. The 510 nm thick PZT film with smooth surface showed remnant polarization (Pr) of 25 µC/cm2, coercive field (Ec) of 45 kV/cm, and piezoelectric coefficient of d33 = 183 pC/N. The film showed a little leaky behavior when comparing with conventional PZT films prepared by sol-gel procedure and it was due to the incomplete removal of organic bonds through the intermediate anneal treatment. From the consideration of thickness, microstructure, and ferroelectric/piezoelectric properties of this self-patternable PZT film, it could be applicable to the micro-detecting system.
On enumeration of the perfect binary codes of length 15
Authors: S. A. Malyugin
Venue: Discrete Applied Mathematics (2004)

We suggest the following construction of codes. In the Hamming code Hn, we first choose a collection of m disjoint iq-components, q = 1,...,m. Then, for each q, we inverse the iqth coordinate in all vectors of the iq-component of this collection. The family of perfect codes obtained in such a way contains Vasil'ev's codes and also a number of other codes, possessing various interesting properties: the nonsystematic codes, the codes of full rank, and the codes with trivial automorphism group. In the present article we enumerate all perfect codes of length 15 obtained by means of such a construction from the Hamming code H15; their number is shown to be equal to 131224492.
Virtual native speakers of english for an increasingly global need: factors affecting participation in a key-pal program for language exchange
Authors: Shiao-Chuan Kung
Venue:  (2003)

Authentic interactions, especially with native speakers, who can respond to and stimulate the language learner to use the target language as a communication tool is extremely important for successful language learning. However, English as a foreign language (EFL) settings seldom allow extensive interaction with native speakers due to their geographical separation from adequate numbers of native speakers. Computer-mediated communication can overcome this difficulty to a certain extent by providing at least a digital exposure to native speakers. Technology can bring students and native speakers together beyond the temporal and spatial constraints of a classroom. It can provide a collaborative learning environment where native speakers and students digitally use the target language in cross-cultural learning activities without being in the same temporal and physical space. This study sought to determine the efficacy of an online collaborative model designed to allow meaningful, authentic interaction between college EFL students and adult native speakers of English. The researcher qualitatively examined the participants' interactions while using an electronic discussion board and their perceptions of the experience. Previous studies have demonstrated various problems with online exchange programs such as diminished participation due to a number of reasons. This study employed 4-member teams and collaborative activities to address these problems. Through a content analysis of the participants' postings on an electronic bulletin board and their e-mail messages to the facilitator, the factors that enhance and detract from the experience were identified. The answers to questionnaires and interviews with each participant revealed the motivations and perceived rewards of the experience. The factors that enhanced the experience can be regarded as the conditions necessary for the formation of successful groups. The factors that detracted from the experience were the causes of failure in becoming a cohesive group of key-pals. The data indicated that using salutations and closings, sharing personal information and thoughts, acknowledging the content of previous messages, posing interesting questions, participating in suggested activities, addressing specific interlocutors, and corresponding frequently were the practices that sustained participation in this key-pal program. The study had implications for the design and implementation of location-independent collaborative learning environments for foreign language practice, particularly in native speaker sparse locations around the world. The findings provided insights into how a framework for computer-mediated language exchange may be designed based on actual practices observed.
Distributed scientific computing in Java: observations and recommendations
Authors: Humphrey Sheil
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The search for techniques to process growing mountains of data efficiently continues apace, nowhere more so than in the field of bioinformatics. Distributed processing represents a practical solution to the search for more powerful architectures that can harness the power of multiple machines to solve a given problem.However this approach brings with it associated problems - selecting the most appropriate language to use in developing the software, development platform and system architecture.This paper addresses some of these issues and also details observations gathered during the design and construction of one such distributed system [1] built using Java to solve a well-known bioinformatics problem [2] in a parallel processing environment using artificial neural networks. This paper does not provide a detailed discussion of the problem itself or results obtained, however the inquisitive reader will find further details in [1].
Camel: A Mobile Applications Framework
Authors: Adnan M. Al-Bar, Ian Wakeman
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

The ability to migrate executing programs from one machine to another has many applicability in mobile computing technology. Users can have their applications travel with them, as they move from one computing environment to another.This paper presents the overall design of a framework to support migratory applications in a networked-environment, called Camel. The framework for adaptive migratory applications, Camel, is an attempt not only to implement migratory applications in Java, but to do this in a way which provides the support for mobile code. Furthermore, the Camel framework is designed speci.cally to support dynamic and adaptive migratory applications. Camel supports adaptation by migrating the application to another node to avoid congested link, and thus provide an understanding of the adaptation through migration technique.
A fixpoint theory for non-monotonic parallelism
Authors: Yifeng Chen
Venue: Theoretical Computer Science (2003)

This paper studies parallel recursion. The trace specification language used in this paper incorporates sequentially, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski's theorem to determine the fixpoints of recursions, we need to identify a well-founded partial order. Several orders are considered, including a new order called the lexical order, which tends to simulate the execution of a recursion in a similar manner as the Egli-Milner order. A theorem of this paper shows that no appropriate order exists for the language. Tarski's theorem alone is not enough to determine the fixpoints of parallel recursions. Instead of using Tarski's theorem directly, we reason about the fixpoints of terminating and nonterminating behaviours separately. Such reasoning is supported by the laws of a new composition called partition. We propose a fixpoint technique called the partitioned fixpoint, which is the least fixpoint of the nonterminating behaviours after the terminating behaviours reach their greatest fixpoint. The surprising result is that although a recursion may not be lexical-order monotonic, it must have the partitioned fixpoint, which is equal to the least lexical-order fixpoint. Since the partitioned fixpoint is well defined in any complete lattice, the results are applicable to various semantic models. Existing fixpoint techniques simply become special cases of the partitioned fixpoint. For example, an Egli-Milner-monotonic recursion has its least Egli-Milner fixpoint, which can be shown to be the same as the partitioned fixpoint. The new technique is more general than the least Egli-Milner fixpoint in that the partitioned fixpoint can be determined even when a recursion is not Egli-Milner monotonic. Examples of non-monotonic recursions are studied. Their partitioned fixpoints are shown to be consistent with our intuition.
On evaluation of numerical values of definite integrals
Authors: Bong Kyu Park
Venue: Neural, Parallel Scientific Computations (2003)

Using the ellipse passing through three points (xk, yk), k = 2i, 2i + 1, 2i + 2 on the curve y = f(x), we derive a quartic equation, called an ellipse quartic. This quartic leads a new algorithm for the numerical integration whose error is very small.
A Distributed Tokens-Based Distance-Vector Routing Algorithm for Mobile Ad-hoc Networks
Authors: Lei Wang, Ya-ping Lin, Zhi-ping Chen
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

A mobile ad-hoc network is a multi-hop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. In this paper, an innovative distance vector routing algorithm TDVRA based on tokens for mobile ad-hoc networks is proposed, which is proved to be loop-free and of no problem of counting-to-infinity existed in those traditional distance-vector routing algorithms such as RIP and BF. Furthermore, compared with the algorithm DSDV, the new algorithm TDVRA can overcome the drawback of routing fluctuations existed in DSDV and can spread the bad news as quickly as the good news.
Solving isomorphism problems for t-designs
Authors: Reinhard Laue
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

Designs usually provide examples for very hard isomorphism problems. So, instead of solving the general isomorphism problem here the problem is solved for many cases where the designs are constructed with a common prescribed group of automorphisms by Kramer and Mesner's approach [30]. The method is based on an analysis of group actions and improves on Burnside's table of marks approach [15]. In particular, no knowledge of the full subgroup lattice of the symmetric group on the point set is needed.
Path and Oracle Discovery Protocol for Centralized Bandwidth Reservation Mechanisms
Authors: Teck Meng Lim, Bu Sung Lee, Chai Kiat Yeo
Venue: Journal of Network and Systems Management (2003)

The introduction of Differential Service architecture has initiated interests in centralized bandwidth reservation via an oracle with each network domain defining its own oracle. The centralized bandwidth reservation mechanism requires knowledge of network topology and reservation paths in the domain to control access to premium services as well as log usage. We propose a new reactive protocol, Path and Oracle Discovery Protocol (PODP), to facilitate the management of networks with centralized bandwidth reservations. This protocol discovers the routers traversed by the network connection request and the respective domain oracle. PODP is able to respond to network path changes at minimum network overhead and storage requirements compared to other methods. A prototype router and oracle supporting the PODP has been successfully developed and tested across multiple domains.
Experiences in program understanding
Authors: Erich Buss, John Henshaw
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

The application of reverse engineering technologies to large-scale legacy software systems offers the opportunity to regain a measure of control and understanding of the software. This activity can leverage the software developer's actions and knowledge, and augment the software development and maintenance processes.This paper motivates the use of program understanding technologies through a description of our experiences to date in the Program Understanding project. Following a project introduction, an overview of work to date is outlined, followed by a review of many of the applied research opportunities available in this area and a discussion of the issues that have occurred as a result of the ongoing applied research project. Future research directions and summary comments are then detailed.Further information detailing the authors' initial research experiences are in [1].
Dynamic Virtual Storage Grid for Mobile Web Access
Authors: Harish Kammanahalli, Srividya Gopalan, V. Sridhar
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Advancement in wireless infrastructure for data access through third generation wireless and wi-fi technologies makes it possible to use mobile devices for various activities and transactions involving Internet. Several proposals have been made to provide data nearer to user. In this paper, we propose multiple overlay networks to provide a network infrastructure to support quick and efficient mobile access to the web. The proposed overlay networks are storage overlay network to provide immediate access to personal information, xspot serveroverlay network to manage hotspots and to deliver both personal and public information, and cache overlay network to act as a vehicle for proactive and reactive information dissemination.
Hybrid integrate-and-fire model of a bursting neuron
Authors: Barbara J. Breen, William C. Gerken, Robert J. Butera,  Jr.
Venue: Neural Computation (2003)

We present a reduction of a Hodgkin-Huxley (HH)-style bursting model to a hybridized integrate-and-fire (IF) formalism based on a thorough bifurcation analysis of the neuron's dynamics. The model incorporates HH-style equations to evolve the subthreshold currents and includes IF mechanisms to characterize spike events and mediate interactions between the subthreshold and spiking currents. The hybrid IF model successfully reproduces the dynamic behavior and temporal characteristics of the full model over a wide range of activity, including bursting and tonic firing. Comparisons of timed computer simulations of the reduced model and the original model for both single neurons and moderately sized networks (n ≤ 500) show that this model offers improvement in computational speed over the HH-style bursting model.
An Information Platform for Scenario Analysis in Technology Foresight Problems
Authors: M. Z. Zgurovskii, N. D. Pankratova
Venue: Cybernetics and Systems Analysis (2003)

The most efficient practical methods of technology foresight problem solution are systematized. Formalized procedures and mathematical expert estimation methods, used for expert estimation of different-nature objects and processing of examination results, are proposed. They form the basis of an information platform for solution to foresight problems. An example of coordination of expert estimates is given.
A methodology to provide and use interchangeable services
Authors: Brian Fenicle, Tim Wahls
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Computing today requires the use of many software packages, but only a few packages are used on a daily basis. This infrequent usage pattern often does not justify purchasing full licenses and therefore motivates a need for a more flexible way to use and pay for the usage of software. This paper describes a design philosophy in which similar services provide the same interface to clients. Services based on this design are interchangeable, allow payment per use, handle payment conveniently, are platform independent, and frequently do not require local installation. Clients can therefore easily utilize resources based on application needs and services available at the time that the application is executing. An example implementation using this methodology is also discussed.
Calibration and estimation of redundant signals for real-time monitoring and control
Authors: Asok Ray, Shashi Phoha
Venue: Signal Processing (2003)

This paper presents a filtering algorithm for calibration and estimation of redundant signals for real-time condition monitoring and control of continuous plants. The redundancy may consist of sensor signals and/or analytical measurements that are derived from other sensor signals and physical characteristics of the plant. The redundant measurements are simultaneously calibrated by additive corrections that are recursively estimated based on the principle of linear least-squares filtering. A weighted least-square estimate of the measured variable is generated in real time from the calibrated signals. The weighting matrix is adaptively adjusted as a function of the a posteriori probability of failure of the calibrated measurements. The effects of intra-sample failure and probability of false alarms are taken into account in the formulation of the recursive filter that has been tested for on-line calibration of four redundant sensors of the throttle steam temperature in a commercial-scale fossil power plant. The calibration and estimation filter is potentially applicable to the Instrumentation & Control System Software in tactical and transport aircraft, and nuclear and fossil power plants.