ppxscal/embedding_network huggingface dataset:
Simulation optimization decision support system for ship panel shop operations
Authors: Allen G. Greenwood, Sucharith Vanguri, Burak Eksioglu, Pramod Jain, Travis W. Hill, Jeffery W. Miller, Clayton T. Walden
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation is a powerful tool that is used to understand and analyze the effect of changes on real systems. However, developing and using simulation models requires high-level engineering skills. The objective of this research is to put state-of-the-art problem-solving technologies into the hands of decision makers, e.g. planners and supervisors. This paper presents a Decision Support System (DSS) that utilizes discrete-event simulation models and heuristic optimization, yet permits effective use without detailed knowledge of the methodologies. The system is developed for the Panel Shop at Northrop Grumman Ship Systems' (NGSS) Pascagoula Operations; the shop is considered the bottleneck for the shipyard. This system focuses on two key opportunities for improvement: sequencing panel production and resource allocation among steps in the production processes. The DSS is designed to be reused in similar operations at other shipyards and portions of the DSS may be used to apply simulation optimization to most industries.
Gradient Methods with Adaptive Step-Sizes
Authors: Bin Zhou, Li Gao, Yu-Hong Dai
Venue: Computational Optimization and Applications (2006)

Motivated by the superlinear behavior of the Barzilai-Borwein (BB) method for two-dimensional quadratics, we propose two gradient methods which adaptively choose a small step-size or a large step-size at each iteration. The small step-size is primarily used to induce a favorable descent direction for the next iteration, while the large step-size is primarily used to produce a sufficient reduction. Although the new algorithms are still linearly convergent in the quadratic case, numerical experiments on some typical test problems indicate that they compare favorably with the BB method and some other efficient gradient methods.
Social Capital in Friendship-Event Networks
Authors: Louis Licamele, Lise Getoor
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we examine a particular form of social network which we call a friendship-event network. A friendship-event network captures both the friendship relationship among a set of actors, and also the organizer and participation relationships of actors in a series of events. Within these networks, we formulate the notion of social capital based on the actor-organizer friendship relationship and the notion of benefit, based on event participation. We investigate appropriate definitions for the social capital of both a single actor and a collection of actors. We ground these definitions in a real-world example of academic collaboration networks, where the actors are researchers, the friendships are collaborations, the events are conferences, the organizers are program committee members and the participants are conference authors. We show that our definitions of capital and benefit capture interesting qualitative properties of event series. In addition, we show that social capital is a better publication predictor than publication history.
A unified rational expansion method to construct a series of explicit exact solutions to nonlinear evolution equations
Authors: Yong Chen, Qi Wang
Venue: Applied Mathematics and Computation (2006)

A unified basic frame of rational expansion methods is presented, which leads to closed-form solutions of nonlinear evolution equations (NLEEs). The new unified algorithms are given to find exact rational formal polynomial solutions of NLEEs in terms of Jacobi elliptic functions, solutions of the Riccati equation and solutions of the generalized Riccati equation. They can be implemented in symbolic computation system Maple. As applications of the methods, we choose some physical significance NLEEs to illustrate the methods. As a consequence, we not only can successfully obtain the solutions found by most existing Jacobi elliptic function methods and tanh methods, but also find other new and more general solutions at the same time.
Selective profiling of Java applications using dynamic bytecode instrumentation
Authors: M. Dmitriev
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Instrumentation-based profiling provides a number of benefits, but can also cause high performance overhead. The negative impact of this overhead could be mitigated considerably if only a small part of the target application (e.g. one that has previously been identified as a bottleneck) is instrumented, possibly for a short time only, while the rest of the application code runs at full speed. In this paper we present an experimental profiling system called JFluid, which includes a modified Java/spl trade/ VM and a GUI tool, and addresses both of the above issues. Our tool supports dynamic instrumentation of a group of methods defined as an arbitrary "root" method plus all methods that it calls (a call subgraph). Methods that belong to a call subgraph are revealed and instrumented lazily, to minimise the number of methods instrumented unnecessarily. Measurements that we obtain when performing full and partial program profiling show that the overhead can be reduced substantially using this technique, and that it is more beneficial when used for large server-side Java applications as opposed to small benchmarks.
On the usefulness of vector representations in statistics training
Authors: Atsushi Terao
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The students who are majoring in psychology or other relevant disciplines have to study statistics. It seems to be a difficult task to understand statistical concepts for these students. Generally speaking, they are not very good at mathematics. All of the statistical theories, however, are constructed on the bases of mathematics. The teacher often has to try to help them construct or understand statistical concepts without high level mathematics. Thus, it is quite meaningful to examine how to teach statistical concepts for these students in statistics training.
Ramsey-type theorems for metric spaces with applications to online problems
Authors: Yair Bartal, Béla Bollobás, Manor Mendel
Venue: Journal of Computer and System Sciences (2006)

A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied K-server problem. The proof is based on Ramsey-type theorems for metric spaces, that state that every metric space contains a large subspace which is approximately a hierarchically well-separated tree (and in particular an ultrametric). These Ramsey-type theorems may be of independent interest.
An Enterprise Security Management System as an ASP Solution
Authors: Yoonsun Lim, Myung Kim, Anmo Jeong
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Advances in Internet technologies have enabled not only large corporations but also small/medium businesses to utilize the Internet for their businesses. While enterprises can be more competitive with such high-tech tools, they are now inevitably exposed to various security risks and threats. In order to protect their information assets, large corporations purchase and operate enterprise security management systems which provide enterprise-level integrated security. However, they are so expensive that small/medium businesses can hardly afford to utilize one. We hold that one way of providing integrated security to small/medium businesses in a costeffective manner is by means of an ASP solution. In this paper, we justify our proposition by analyzing the market trends for ASP in conjunction with security management software. We also propose a web-based security management system that can be used as an ASP solution. To the best of our knowledge, it is the first such system and is currently running as a commercial solution at a Korean ASP which provides services to 3,000 small/medium businesses.
Smooth Playout Control for Video Streaming over Error-Prone Channels
Authors: Yi-Hsuan Yang, Meng-Ting Lu, Homer H. Chen
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The quality of media streaming over best-effort networks suffers from network delays and packet losses. The latter is more profound for wireless video. To enhance the QoS of streaming services, adaptive media playout (AMP) has been developed to adjust the playout interval. With AMP, the risk of delay and buffer underflow is reduced. However, the smoothness of playback is not guaranteed. In this paper, we propose a novel AMP control that enables smooth playout and meanwhile maintains reliable visual quality. Our AMP control adjusts the playout interval based on an estimation of channel quality, so it is more adaptive than conventional AMP controls that are based on buffer fullness. Experimental results are provided to justify our approach. Even at 20% packet loss rate, the proposed AMP control is still able to provide smooth and reliable playback.
A DHT-Based Infrastructure for Sharing Checkpoints in Desktop Grid Computing
Authors: Patricio Domingues, Filipe Araujo, Luis Moura Silva
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper we present Chkpt2Chkpt, a desktop grid system that aims to reduce turnaround times of applications by replicating checkpoints. We target desktop computing projects with applications that are comprised of longrunning independent tasks, executed in hundreds or thousands of computers spread over the Internet. While these applications typically do local checkpointing to deal with failures, we propose to replicate those checkpoints in remote places to make them available to other worker nodes. The main idea is to organize the worker nodes of a desktop grid into a peer-to-peer Distributed Hash Table. Worker nodes can take advantage of this P2P network to keep track, share, manage and reclaim the space of the checkpoint files. We used simulation to validate our system and we show that remotely storing replicas of checkpoints can considerably reduce the turnaround times of the tasks, when compared to the traditional approaches where nodes manage their own checkpoints locally. These results make us conclude that the application of P2P techniques seems to be quite helpful in wide-scale desktop grid environments.
Fuzzy confidence interval for fuzzy process capability index
Authors: A. Parchami, M. Mashinchi, H. R. Maleki
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2006)

Process capability indices are used to determine whether a production process is capable of producing items within specification tolerance. In practice these indices are estimated using sample data, often with quite small sample sizes. Thus, it is of interest to obtain confidence limits for capability index given a sample estimate. Most of the traditional methods for assessing the capability of manufacturing processes are dealing with crisp quality. In this paper we obtain 100(1 - α)% fuzzy confidence interval for C˜p fuzzy process capability index, where instead of precise quality we have two membership functions for specification limits. We present several interpretations for introduced fuzzy confidence interval. Some numerical examples are given to clarify the method.
Resource Monitoring with Globus Toolkit 4
Authors: Vijay Sahota, Maozhen Li, Wenming Guo
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The past few years have seen the Grid rapidly evolving towards a service-oriented computing infrastructure. With the OGSA facilitating this evolution, it is expected that WSRF will be acting as the main an enabling technology to drive the Grid further. Resource monitoring plays a critical role in managing a large-scale Grid system. This paper presents GREMO, a lightweight resource monitor developed with Globus Toolkit 4 (GT4) for monitoring CPU and memory of computing nodes in a Windows and Linux environments.
Image mosaics base on homogeneous coordinates
Authors: Xi Shao, Changsheng Xu, Joo Hwee Lim
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

The need to combine pictures into panoramic mosaics has existed since the beginning of photography, as the camera's field of view is always smaller than the human field of view. Photo mosaicing, a technique to paste together several pictures to create a panoramic mosaic, gives us a more complete view of the scene. In this paper, an image mosaic approach is proposed. Homogeneous coordinates are used to represent points. The overlapped points for each RGB channel are interpolated to generate mosaics after projecting the points from different images to the reference image. Experiments illustrate that the proposed approach can obtain an ideal mosaic result.
COPE: traffic engineering in dynamic networks
Authors: Hao Wang, Haiyong Xie, Lili Qiu, Yang Richard Yang, Yin Zhang, Albert Greenberg
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.
Teaching students to evaluate source reliability during internet research tasks
Authors: Christopher A. Sanchez, Jennifer Wiley, Susan R. Goldman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Despite the overwhelming use of the Internet as an educational/informational resource, research has found that learners are woefully in need of guidance on how to use this resource effectively, and subsequently identify reliable sources of information from unreliable. This study seeks to address this issue through the SEEK training program, which encourages learners to evaluate the source and quality of the information, and also how well it resonates with their existing prior knowledge. Learners were either trained or not trained using the SEEK program when they completed an initial Internet research task. Learners were then asked to complete a second Internet research task in another domain without any additional guidance several days later. Results indicate that learners who had received the SEEK training not only were better able to identify relevant from irrelevant sources, but also showed both higher overall levels of learning, and also greater learning gains.
Algorithm Partitioning and SoC Design for OFDM Communication Systems Using Multiple Application Specific Processors
Authors: Paul Gruijters, Bertrand Vandewiele
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper we present an algorithm partitioning and SoC design approach for OFDM communication systems using multiple application specific processors. Solutions that are programmable are desirable for many OFDM applications, in order to improve time to market for emerging standards, as well as to reduce the cost of maintaining product lines like for example in multiple geographic regions. While today's ASIC solutions are commonplace, we describe in this paper how algorithm partitioning allows the creation and use of a set of specialized, embedded programmable digital signal processors that compose a practical system with respect to both silicon area and power consumption. By this approach, we achieve a high degree of programmability at silicon cost and power comparable to ASIC solutions.
Addressing Un-cooperation of Routers in Wireless Patient Monitoring
Authors: Upkar Varshney
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Patient Monitoring using ad hoc networks has been proposed to overcome the coverage problems of infrastructure-oriented wireless networks, such as wireless LANs and cellular-oriented wireless networks. Although highly innovative and interesting solution to provide patient monitoring, such ad hoc networks rely on the co-operation of other patient monitoring devices as routers. The end-to-end delivery of messages carrying vital signs of patients will be negatively affected by un-cooperation and/or failure of routers. In this paper, we address how to overcome the uncooperation and failure of routers in patient monitoring. More specifically, network routing schemes are presented for delivery of messages from the source device to one of healthcare professionals using ad hoc wireless networks. The performance results show that the impact of un-cooperative nodes in wireless patient monitoring can be minimized by using broadcast and reliable routing schemes. We also present several incentives that can be used in obtaining co-operation from other devices.
A Hierarchical Development Architecture for Customizing AO Methodologies
Authors: Zeng Zhifeng, Xue Xiao, Cui Ying
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The agent-oriented (AO) methodology is an effective means for constructing complex systems. The concept of HDA (hierarchical development architecture) is proposed to solve the problem of "a variety in number, difficult to use" in AOSE. The paper presents supporting rules and fundamental elements in HDA for customizing a new AO methodology according to the given project. To exemplify its feasibility and effectiveness, the construction of C4I system is presented as a case study.
Timing Verification of UML Activity Diagram Based Code Block Level Models for Real Time Multiprocessor System-on-Chip Applications
Authors: Dipankar Das, Rajeev Kumar, P. P. Chakrabarti
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

The UML Activity Diagram language is the de facto language for behavioral modeling capable of block level modeling of real time multiprocessor SoC applications where timing behavior is a critical aspect. Although there are several tools for timing verification of logics with branching time semantics, there are no known model checkers for timing verification of logics with linear time semantics as needed for many verification tasks. This work deals with timing verification of UML Activity Diagram models of applications. We propose a subset of TPTL (Timed Propositional Temporal Logic) for specifying timing queries. We develop an automata based model checker for verifying such queries. We present a comparison of the proposed timing verification with the state of the art for random testcases.
Multiprotocol Label Switching Meta-Frames
Authors: Radu Dragos, Martin Collier
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

MPLS is one of the most attractive solution for traffic engineering. With MPLS, the advantages of a label switching technology in the core of the Internet are complemented by its applicability at the edge especially for deploying secure and robust Virtual Private Networks. The existence of MPLS at the edge of the Internet also allows new label forwarding based solutions to be deployed. We propose a framework that uses larger MPLS frames called MPLS meta-frames to increase the throughput of MPLS networks. Such an approach could also help future Terabit speed GMPLS optical core switches by increasing the average length of the packets traversing the Internet core and so reducing the performance requirements of these switches. Processing packets at the network edge in this way, where it can be done with low-performance hardware such as software routers, results in more "core-friendly" Internet traffic.
Simple movement and detection in discrete event simulation
Authors: Arnold H. Buss, Paul J. Sánchez
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Many scenarios involving simulation require modeling movement and sensing. Traditionally, this has been done in a time-stepped manner, often because of a mistaken belief that using a pure discrete event approach is infeasible. This paper discusses how simple motion (linear, uniform, two-dimensional) and simple sensing can be modeled with a pure Discrete Event approach. We demonstrate that this approach is not only feasible, it is often more desirable from several standpoints.
Artificial compressibility, characteristics-based schemes for variable density, incompressible, multi-species flows. Part I. Derivation of different formulations and constant density limit
Authors: Evgeniy Shapiro, Dimitris Drikakis
Venue: Journal of Computational Physics (2005)

The paper presents various formulations of characteristics-based schemes in the framework of the artificial-compressibility method for variable-density incompressible flows. In contrast to constant-density incompressible flows, where the characteristics-based variables reconstruction leads to a single formulation, in the case of variable density flows three different schemes can be obtained henceforth labeled as: transport, conservative and hybrid schemes. The conservative scheme results in pseudo-compressibility terms in the (multi-species) density reconstruction. It is shown that in the limit of constant density, the transport scheme becomes the (original) characteristics-based scheme for incompressible flows, but the conservative and hybrid schemes lead to a new characteristics-based variant for constant density flows. The characteristics-based schemes are combined with second and third-order interpolation for increasing the computational accuracy locally at the cell faces of the control volume. Numerical experiments for constant density flows reveal that all the characteristics-based schemes result in the same flow solution, but they exhibit different convergence behavior. The multigrid implementation and numerical studies for variable density flows are presented in Part II of this study.
Uniformization with representatives: comprehensive transient analysis of infinite-state QBDs
Authors: Anne Remke, Boudewijn R. Haverkort, Lucia Cloth
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

A large variety of computer and communication systems can be modeled adequately as infinite-state continuous-time Markov chains (CTMCs). A highly structured class of such infinite-state CTMCs is the class of Quasi-Birth-Death processes (QBDs), on which we focus in this paper. We present an efficient variant of uniformization for computing the transient probability Vi,j(t) of being in each state j of the QBD for any possible initial state i at time t. Note that both the set of starting states and the set of goal states have infinite size. All the probabilities Vi,j(t) are needed in the context of probabilistic model checking. The key idea of our algorithm is to split the infinite set of starting states into a finite part and an infinite (repeating) part. The transient probabilities for the infinite part are then computed using the new notion of representatives. We present the required data structures and algorithm, as well as an application-dependent optimal stopping criterion. In a simple case study we show the feasibility of our approach, as well as the efficiency gain due to the optimal stopping criterion.