ppxscal/embedding_network huggingface dataset:
Work-Team Implementation and Trajectories of Manufacturing Quality: A Longitudinal Field Study
Authors: Rajiv D. Banker, Joy M. Field, Kingshuk K. Sinha
Venue: Manufacturing Service Operations Management (2000)

The study examines the sustainability of manufacturing quality improvements following the implementation of work teams on production lines. We posit that the impact on manufacturing quality, measured as the defect rate trajectory, is monotonically nonincreasing over time and may, more specifically, assume the shape of an inverted S-curve. Employing a longitudinal research design, we investigate four work teams over a 28-month period in a field setting. Each team corresponds to one of the four interconnected production lines in an electromechanical assembly plant operated by a Fortune 500 firm. Results of our empirical analysis support the sustainability of quality improvements associated with work team implementation and partially support the S-shaped trajectory as the particular form of sustainability. However, variations in the manufacturing quality trajectories reflect the characteristics of the work team and the production line on which each the team is instituted. From the standpoint of practice, this study highlights the importance of work-team design and implementation decisions, especially the need to be proactive in identifying and resolving initial implementation difficulties.
Spectral Differencing with a Twist
Authors: Richard Baltensperger, Manfred R. Trummer
Venue: SIAM Journal on Scientific Computing (2002)

Spectral collocation methods have become very useful in providing highly accurate solutions to differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. To obtain optimal accuracy these matrices must be computed carefully. We demonstrate that naive algorithms for computing these matrices suffer from severe loss of accuracy due to roundoff errors. Several improvements are analyzed and compared. A number of numerical examples are provided, demonstrating significant differences between the sensitivity of the forward problem and the inverse problem.
Analysis and design of a web-based authoring tool generating intelligent tutoring systems
Authors: Maria Moundridou, Maria Virvou
Venue: Computers Education (2003)

Authoring tools for intelligent tutoring systems (ITSs) are meant to provide environments where instructors may author their own ITSs in varying domains. In this way, painful constructions of ITSs, which are not reusable, may be avoided. However, the construction of an authoring tool is associated with many problems, such as the generality of the techniques incorporated, domain-independence, effectiveness for the prospective authors (instructors), and effectiveness for the students who will use the resulting ITSs. In this paper we will report on an empirical study that we conducted in order to design and develop WEAR, an ITS authoring tool for Algebra-related domains. In the study we investigated several aspects concerning the attitude and behaviour of both students and instructors. The study revealed important issues and was then used for the specification of the design of WEAR. A brief description of the developed system is also included in the paper so that the way that the design specifications were put into practice may be shown. However, a lot of the authoring tool's requirements that came to light could be applicable to other authoring tools as well. The most important requirement of this kind was the need for an instructor modelling component so that adaptivity could be provided to human instructors (authors). The provision of such facility is a novelty in the area of ITS authoring tools.
Optimal search for rationals
Authors: Stephen Kwek, Kurt Mehlhorn
Venue: Information Processing Letters (2003)

We present a Θ(log2 M)-time algorithm that determines an unknown rational number x in QM = {p/q: p, q ∈ {1, ..., M}} by asking at most 2log2 M + O(1) queries of the form "Is x ≤ y?".
An unencumbering, localized olfactory display
Authors: Yasuyuki Yanagida, Haruo Noma, Nobuji Tetsutani, Akira Tomono
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Olfaction is considered to be an important sensory modality in next-generation virtual reality (VR) systems. We currently focus on spatiotemporal control of odor, rather than capturing and synthesizing odor itself. If we simply diffused the odor into the atmosphere, it would be difficult to clean it away in a short time. Several olfactory displays that inject the scented air under the nose through tubes have been proposed to realize spatiotemporal control of olfaction, but they require the user to wear something on one's face. Here, we propose an unencumbering olfactory display, by conveying a clump of scented air from a certain remote place to the user's nose. To implement this concept, we used an "air cannon" that generates toroidal vortices of the scented air. We conducted a preliminary experiment to examine the possibility of this method's ability to display scent to a restricted space. The result shows that we could successfully display incense to the target user.
Nowhere to hide
Authors: Espen Andersen
Venue: Ubiquity (2002)

Companies will need to make themselves components of their customers' lives rather than trying to make customers a component of their organizations. To do this, they need to stop kidding themselves when it comes to electronic integration.
Interagent Communication and Synchronization Support in the DaAgent Mobile Agent-Based Computing System
Authors: Shivakant Mishra, Peng Xie
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

This paper describes the design, implementation, and evaluation of interagent communication and synchronization models in the DaAgent mobile-agent based computing system. Based on the requirements of some sample Internet computing applications, eight system-level models of interagent communication and synchronization are proposed. A new synchronization mechanism called location synchronization that is relevant for interacting mobile agents is also proposed. This paper evaluates the eight models based on their utility, performance, level of communication and synchronization support, and applicability in the Internet computing environment. A prototype implementation and detailed performance evaluation of these models based on two interacting, multiagent applications is also presented.
On the reconfigurability of single-hub WDM ring networks
Authors: Kayi Lee, Kai-Yeung Siu
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

We study the benefit of reconfigurability for wavelength division multiplexed (WDM) ring networks with dynamic single-hubbed traffic. We showthat the ability to reconfigure wavelength add-drop multiplexers helps to reduce the number of expensive line terminating equipment (LTEs) by a factor of W, where W is the number of wavelengths in the network. In addition, we show that for a general class of traffic, optical networks using reconfigurable wavelength add-drop multiplexers guarantee to be almost as bandwidth efficient as full wavelength add-drop networks, that is, opaque networks. For such traffic, we introduce several fast algorithms that achieve or approximate the optimal performance guarantees. The comparison between reconfigurable networks and opaque networks is quantified using a performance metric called capacity ratio, which captures the relative throughput performance of a reconfigurable network compared to the opaque network.
The digital set-top box as a virtual channel provider
Authors: Konstantinos Chorianopoulos
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This research is based on the realization that the desktop computing paradigm is not appropriate for television, because it is adapted to fundamentally different user aspirations and activities. Instead, the virtual channel is a model that aids the organization and dynamic presentation of digital television programming from a combination of live broadcasts, prerecorded content and Internet resources at each set-top box. The goal is to design the respective framework of user interface patterns that consider the affective nature of television usability and facilitate the diversity of viewing situations.
Semi-online scheduling with machine cost
Authors: Yong He, Shengyi Cai
Venue: Journal of Computer Science and Technology (2002)

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently Imreh and Nogaproposed to add the concept of machine cost to scheduling problems and considered the so-called List Model problem. An online algorithm with a competitive ratio 1.618 was given while the lower bound is 4/3. In this paper, two different semi-online versions of this problem are studied. In the first case, it is assumed that the processing time of the largest job is known a priori. A semi-online algorithm is presented with the competitive ratio at most 1.5309 while the lower bound is 4/3. In the second case, it is assumed that the total processing time of all jobs is known in advance. semi-online algorithm is presented with the competitive ratio at most 1.414 while the lower bound is 1.161. It is shown that the additional partial available information about the jobs leads to the possibility of constructing a schedule with a smaller competitive ratio than that of online algorithms.
End-to-end WAN service availability
Authors: Michael Dahlin, Bharat Baddepudi V. Chandra, Lei Gao, Amol Nayate
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for improving end-to-end service availability. Using several large-scale connectivity traces, we develop a model of network unavailability that includes key parameters such as failure location and failure duration. We then use trace-based simulation to evaluate several classes of techniques for coping with network unavailability. We find that caching alone is seldom effective at insulating services from failures but that the combination of mobile extension code and prefetching can improve average unavailability by as much as an order of magnitude for classes of service whose semantics support disconnected operation. We find that routing-based techniques may provide significant improvements but that the improvements of many individual techniques are limited because they do not address all significant categories of network failures. By combining the techniques we examine, some systems may be able to reduce average unavailability by as much as one or two orders of magnitude.
Suppressed fuzzy c-means clustering algorithm
Authors: Jiu-Lun Fan, Wen-Zhi Zhen, Wei-Xin Xie
Venue: Pattern Recognition Letters (2003)

Based on the defect of rival checked fuzzy c-means clustering algorithm, a new algorithm: suppressed fuzzy c-means clustering algorithm is proposed. The new algorithm overcomes the shortcomings of the original algorithm, establishes more natural and more reasonable relationships between hard c-means clustering algorithm and fuzzy c-means clustering algorithm.
Security problems in 802.11-based networks
Authors: Russ Housley, William Arbaugh
Venue: Communications of the ACM (2003)

Assessing inherent wireless network security deficiencies and seeking solutions.
Coordination of Production/Distribution Networks with Unbalanced Leadtimes
Authors: Julien Bramel, Shobhna Goyal, Paul Zipkin
Venue: Operations Research (2000)

We investigate multiproduct, multilocation production/distribution networks with deterministic, stationary demands. Most research on such systems assumes zero leadtimes. Methods using fixed reorder intervals that are power-of-two multiples of a base planning period have proved to be very successful for such systems. The same methods apply to networks with positive leadtimes, provided the leadtimes arebalanced in a specific sense. We explore networks with general,unbalanced leadtimes. A key result is a lower bound on the cost of any feasible policy. Other results concern policy heuristics and their performance. For a large class of networks, we construct a policy whose cost is within 45% of the lower bound. For general networks, the performance guarantee is 1:02v(1+?), where ? is a number dependent on the network topology only. In general, the best performance bound is obtained by systematically reducing the order intervals derived from the corresponding zero-leadtime system.
The CorotInstrument's Software: Towards Intrinsically Reconfigurable Real-Time Embedded Processing Software in Space-Born Instruments
Authors: Damien Cailliau, Remy Bellenger
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

In this work-in-progress paper we present the first step on the first attempt to design intrinsically reconfigurable software for single-processor instruments of scientific satellites. After disserting on the specifications particular of the space field for the reconfiguration, we argue that the most suitable reconfigurability level is overloading tasks and functions of the application. Dynamic to semi-dynamic reconfiguration will fulfill most of the common needs. We state that the reconfiguration of real-time embedded software for space-borne systems relies on an intrinsically reconfigurable software design and well-defined ground segment operations. A promising technique seems to be to design the reconfigurable parts of the software as a set of proxy-accessible objects. We present the first step in designing such software for the French astrophysical satellite Corot.
Environment and Movement Model for Mobile Terminal Location Tracking
Authors: M. McGuire, K. N. Plataniotis, A. N. Venetsanopoulos
Venue: Wireless Personal Communications: An International Journal (2003)

Mobile terminal position location, tracking and prediction are becoming important areas of research for advanced cellular communications. Methods for mobile terminal location are evaluated using simulations. To obtain accurate simulation results, the simulation environment and terminal motion model must be as realistic as possible. This paper describes a simulation system for mobile terminals located within vehicles in dense urban environments. These are the mobiles with the greatest need for location predictions in the environments of greatest interest to network providers. The radio propagation model is based on well known multipath radio propagation models. The motion model combines an accurate kinematic model for vehicular motion with a driver decision model to mimic human driving decisions. Simulated mobile terminal motion tracks are presented, showing how realistic motions are generated.
Specification of a capability-based IT classification framework
Authors: Paul Mulligan
Venue: Information and Management (2002)

The effort discussed here examined the issue of information technology (IT) classification within the financial services industry. Phase I utilized a Delphi study, involving 31 participants from 11 organizations, to provide initial specification of a capability-based typology of IT. Phase II of the research was a multiple case study that further refined the construct specifications and explored issues in technology application. Results of the Delphi and case study analysis suggested that differentiation within the IT construct occurred along a capability-based continuum that incorporated four primary IT attributes. These attributes included system scope, system focus, system accessibility, and the level of IT integration.
Bounds for probabilistic integer programming problems
Authors: Darinka Dentcheva, András Prékopa, Andrzej Ruszczyński
Venue: Discrete Applied Mathematics (2002)

We consider stochastic integer programming problems with probabilistic constraints. The concept of p-efficient points of a probability distribution is used to derive various equivalent problem formulations. Next we introduce new methods for constructing lower and upper bounds for probabilistically constrained integer programs. We also show how limited information about the distribution can be used to construct such bounds. The concepts and methods are illustrated on an example of a vehicle routing problem.
Swords into Plowshares: Nuclear Weapon Dismantlement, Evaluation, and Maintenance at Pantex
Authors: Edwin A. Kjeldgaard, Dean A. Jones, George F. List, Mark A. Turnquist, James W. Angelo, Richard D. Hopson, John Hudson, Terry Holeman
Venue: Interfaces (2000)

The end of the Cold War changed the missions of facilities in the US nuclear weapons complex. They ceased production of new weapons and focused on dismantling old weapons and maintaining the safety, security, and reliability of those remaining. The Pantex Plant, operated for the US Department of Energy (DOE) by the Mason and Hanger Corporation, is the sole assembly and disassembly facility for dismantlement, evaluation, and maintenance activities for the US nuclear stockpile. We developed a decision support tool, the Pantex Process Model (PPM), to help Pantex plan capacity and deploy resources to meet its new requirements. Using the PPM, Pantex has provided critical input to help the US form and defend positions during arms-control-treaty negotiations. It has changed the way Pantex and the DOE evaluate resource requirements in planning future workloads. It has also led to an innovative cooperative agreement among Pantex, the Transportation Safeguards Division of DOE, and the Department of Defense (DOD) that resulted in Pantex exceeding weapon-dismantlement goals.
A type system for bounded space and functional in-place update
Authors: Martin Hofmann
Venue: Nordic Journal of Computing (2000)

We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place.We present this both as a "design pattern" for writing C-code in a functional style and as a compilation process from linearly typed first-order functional programs into malloc ()-free C code.The main technical result is the correctness of this compilation.The crucial innovation over previous linear typing schemes consists of the introduction of a resource type ♦ which controls the number of constructor symbols such as cons in recursive definitions and ensures linear space while restricting expressive power surprisingly little.While the space efficiency brought about by the new typing scheme and the compilation into C can also be realised by with state-of-the-art optimising compilers for functional languages such as OCAML [16], the present method provides guaranteed bounds on heap space which will be of use for applications such as languages for embedded systems or automatic certification of resource bounds.We show that the functions expressible in the system are precisely those computable on a linearly space-bounded Turing machine with an unbounded stack. By a result of Cook this equals the complexity class 'exponential time'. A tail recursive fragment of the language captures the complexity class 'linear space'.We discuss various extensions, in particular an extension with FIFO queues admitting constant time catenation and enqueuing, and an extension of the type system to fully-fledged intuitionistic linear logic.
Layered Queueing Models for Enterprise JavaBean Applications
Authors: Te-Kai Liu, Santhosh Kumaran, Zongwei Luo
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Traditional capacity sizing of enterprise systems relies on benchmarking a system using benchmark clients that generate a workload pattern similar to real-world workload. When new functions are added to the system or when the workload pattern changes, benchmarking has to be performed again. This is a costly and time-consuming approach for capacity planning. Layered queueing models have been used to study the performance of software systems. The approach is able to identify major performance parameters of software systems. Given a workload pattern, the models can be solved analytically to predict the system performance quickly. This paper proposes a layered queueing model for predicting the performance of distributed enterprise applications built on Enterprise JavaBeans (EJB) technology. We show how such models can be applied for capacity sizing of distributed enterprise systems. We demonstrate this by using this methodology to predict the performance of a sample application built on an EJB-based business-to-business e-commerce platform. We compare deployment options and study the effect of different workload patterns on system capacity.
Scroll ring performance evaluation
Authors: Elaine Wherry
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This study compares a touchpad scroll ring to a mouse scroll wheel and touchpad scroll zone using a Fitts' Law testing methodology. Time, error, and subjective results reveal that the scroll ring offers the most performance advantages over the scroll wheel and scroll zone.
Quasi-birth-and-death processes, level-geometric distributions: an aggregation/disaggregation approach
Authors: Ivo Marek
Venue: Journal of Computational and Applied Mathematics (2003)

A special class of homogeneous continuous time quasi-birth and death (QBD) Markov chains (MCs) which possess level-geometric (LG) stationary distribution are considered. A functional analytic approach is applied which provides not only a clear analytic interpretation of the concepts introduced elsewhere but also represents a suitable basis for computations. An iterative aggregation/disaggregation method is proposed as tool for numerical computations.
W3QS - A System for WWW Querying
Authors: David Konopnicki, Oded Shmueli
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

W3QL is a, SQL-like, high level language for accessing World-Wide Web (WWW) resident data and services. W3QL is declarative. A W3QL query specifies a graph to be matched with portions of the WWW (graph nodes corresponding to WWW pages, edges to hypertext links). A query can specify complex conditions on nodes' contents and their relationships. A W3QL query may use existing search services (e.g. AltaVista). W3QL is extensible as users may use their own data analysis tools (e.g. image analysis). W3QS is a system that manages W3QS queries. W3QS is accessible via the WWW or by using a programming based interface (API). On the WWW, W3QS provides several interfaces: intuitive graphic interfaces, templates of frequently posed queries, and direct programming.
Conditional possibility and necessity
Authors: Bernadette Bouchon-Meunier, Giulianella Coletti, Christophe Marsala
Venue: Technologies for constructing intelligent systems: tools (2002)

We introduce the definition of a conditional possibility (and a conditional necessity by duality) as a primitive concept, i.e. a function whose domain is a set of conditional events. The starting point is a definition of conditional event E|H which differs from many seemingly "similar" ones adopted in the relevant literature, which makes the third value depending on E|H. It turns out that this function t(E|H) can be taken as a conditional possibility by requiring "natural" property of closure of truth-values of the conditional events with respect to max and min. We show that other definitions of conditional possibility measures, present in the literature, are particular cases of the one proposed here. Moreover, we introduce a concept of coherence for conditional possibility and a relevant characterization theorem, given in terms of a class of unconditional possibility measures.