ppxscal/embedding_network huggingface dataset:
A vacation queue with setup and close-down times and batch Markovian arrival processes
Authors: Zhisheng Niu, Tao Shu, Yoshitaka Takahashi
Venue: Performance Evaluation (2003)

We consider a finite-capacity single-server vacation queue with close-down/setup times and batch Markovian arrival process (BMAP), where both the service time, the vacation time, the setup time, and the close-down time are generally distributed. The queueing model has potential applications in SVC (switched virtual connection)-based IP-over-ATM networks and multiple protocol label switched (MPLS) networks. By applying the supplementary variable technique, we develop a unified solution to both the single-vacation and multiple-vacation models and for either the PBAS (partial batch acceptance strategy) or the WBAS (whole batch acceptance strategy) service disciplines. For both models, we obtain the queue length distribution at batch arrival epochs and that at an arbitrary time instant, the loss probability of a whole batch or an arbitrary customer in a batch, server setup rate, server utilization ratio, and the LST of the waiting time distribution. Through the numerical examples, we find that: (1) there is a trade-off between the user's quality-of-service (e.g., loss probabilities, wanting times) and the system performance (e.g., server setup rate, server utilization ratio); (2) the system performance is closely related not only to the first and second order moments of the arrival process but also the pattern (distribution) of the customer arrivals; (3) mean batch size is a much more critical factor to influence the queueing system's performance than the type of batch size distribution. These conclusions are of instructive meanings in the design of IP-over-ATM or more generally MPLS-based networks.
Toolkits for Open Innovation -- The Case of Mobile Phone Games
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

User toolkits enable consumers to develop customized product applications without havingdedicated technical knowledge. Applied in the field of handheld computing, toolkits are a very powerful instrument to meet the growing demand for customized mobile applications. In this paper, the theoretical principles and functionalities of user interaction toolkits are translated into a technical software concept for mobile phone games. The presented toolkit is a new internet based application allowing users to create a customized game on their desktop computer and to transfer it to handheld devices. In contrast to well known open source software development projects, no programming expertise is required. Thus, participation of innovative users is comparatively easy. In line with the open source concept, but as an extending feature to the toolkit approach, the presented solution is embedded in an online community. Thus, contributions by innovative users can be stored in a library leading to a continuously growing information pool of available components. Games and components can be passed on easily between customers, facilitating the adoption of other users' contributions as well as collaborative development between users. The community feature of the toolkit does not only provide the common toolset of online communities allowing for user-to-user communication, e.g. chats and bulletin boards, or text based contributions, e.g. recommendations, product evaluations and voting tools, but it also enables users to exchange and jointly develop actual product prototypes. In this regard, the presented toolkit for open innovation' will be the foundation of a value web' in a unique manner: a value web in between consumers and users. The paper further derives economic benefits of the developedtoolkit for mobile phone game creation theoretically and integrates them into a diversified business model. The toolkit as a distinct performance feature has the potential to establish a social environment for its most enthusiastic users and thereby to strengthen user relationships with the provider and increase overall business success.
A Web-Based Game-Oriented College Selection System Employing Fuzzy Rule Trees
Authors: Sushil. K. Prasad, Raj Sunderraman, Yanqing Zhang, Atul Parvatiyar
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Our web-based interactive game-playing-oriented college selection system acts as an smart advisor/mentor and helps students, parents, and teachers use an effective graphical user interface to efficiently search college information and to make good decisions at each stage ofstudents' academic development. It is an expert agent with hierarchical fuzzy knowledge base using fuzzy logic. Users are expected to be able to use this agent as a trusted, involved and smart counselor, who remembers their profile and their past history and advises them through their high school years. It gives them increasingly better and specific nuggets of advice as they make progress through their schools, and guides them toward a selected set of colleges to apply that optimizes their potential. At the heart of this system is an assessment tree, which uses bottom-up fuzzy calculations to generate possibility of admission in various sets of colleges. The primary output is a short list of colleges to apply containing five kinds of colleges (highly-selective down to non-selective) with possibilities of acceptance in each college according to fuzzy rules provided. It is also a smart tool to play self-guided "what if" games toexplore what specific action one should be taking to have maximum impact on the selection of colleges one can get in and on his/her chances of admission. It employs a natural interactive interview process for a user (i.e., a user can play a game with the agent to gradually find outrational solutions), and produces advisories at different stages.
Instruction Scheduling for Low Power
Authors: A. Parikh, Soontae Kim, M. Kandemir, N. Vijaykrishnan, M. J. Irwin
Venue: Journal of VLSI Signal Processing Systems (2004)

Reducing energy consumption has become an important issue in designing hardware and software systems in recent years. Although low power hardware components are critical for reducing energy consumption, the switching activity, which is the main source of dynamic power dissipation in electronic systems, is largely determined by the software running on these systems.In this paper, we present and evaluate several instruction scheduling algorithms that reorder a given sequence of instructions taking into account the energy considerations. We first compare a performance-oriented scheduling technique with three energy-oriented instruction scheduling algorithms from both performance (execution cycles of the resulting schedules) and energy consumption points of view. Then, we propose three scheduling algorithms that consider energy and performance at the same time. Our experimentation with these scheduling techniques shows that the best scheduling from the performance perspective is not necessarily the best scheduling from the energy perspective. Further, scheduling techniques that consider both energy and performance simultaneously are found to be desirable, that is, these techniques are quite successful in reducing energy consumption and their performance (in terms of execution cycles) is comparable to that of a pure performance-oriented scheduling. We also illuminate the inherent approximations and difficulties in building energy models for enabling energy-aware instruction scheduling and explore alternative options using cycle-accurate energy simulator. The simulation results show that the energy-oriented scheduling reduces energy consumption by up to 30% compared to the performance-oriented scheduling.
An alternative routing algorithm for the pyramid structures
Authors: Zhizhang Shen
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

A pyramid structure of size n has a diameter of log n, which immediately leads to an optimal routing algorithm, using only parent-child links. However, shortest paths between nodes may be unavailable because of the existence of faulty nodes. On the other hand, there exist many other potential communication paths using links in the associated meshes.In this paper, we present an alternative routing algorithm making use of both mesh links and parent-child links, and study a set of bypassing paths associated with this algorithm.
The black-box Niederreiter algorithm and its implementation over the binary field
Authors: Peter Fleischmann, Markus Chr. Holder, Peter Roelse
Venue: Mathematics of Computation (2003)

The most time-consuming part of the Niederreiter algorithm for factoring univariate polynomials over finite fields is the computation of elements of the nullspace of a certain matrix. This paper describes the so-called "black-box" Niederreiter algorithm, in which these elements are found by using a method developed by Wiedemann. The main advantages over an approach based on Gaussian elimination are that the matrix does not have to be stored in memory and that the computational complexity of this approach is lower. The black-box Niederreiter algorithm for factoring polynomials over the binary field was implemented in the C programming language, and benchmarks for factoring high-degree polynomials over this field are presented. These benchmarks include timings for both a sequential implementation and a parallel implementation running on a small cluster of workstations. In addition, the Wan algorithm, which was recently introduced, is described, and connections between (implementation aspects of) Wan's and Niederreiter's algorithm are given.
Extracting semantics from data cubes using cube transversals and closures
Authors: Alain Casali, Rosine Cicchetti, Lotfi Lakhal
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In this paper we propose a lattice-based approach intended for extracting semantics from datacubes: borders of version spaces for supervised classification, closed cube lattice to summarize the semantics of datacubes w.r.t. COUNT, SUM, and covering graph of the quotient cube as a visualization tool of minimal multidimensional associations. With this intention, we introduce two novel concepts: the cube transversals and the cube closures over the cube lattice of a categorical database relation. We propose a levelwise merging algorithm for mining minimal cube transversals with a single database scan. We introduce the cube connection, show that it is a Galois connection and derive a closure operator over the cube lattice. Using cube transversals and closures, we define a new characterization of boundary sets which provide a condensed representation of version spaces used to enhance supervised classification. The algorithm designed for computing such borders improves the complexity of previous proposals. We also introduce the concept of closed cube lattice and show that it is isomorph to on one hand the Galois lattice and on the other hand the quotient cube w.r.t. COUNT, SUM. Proposed in [16], the quotient cube is a succinct summary of a datacube preserving the Rollup/Drilldown semantics. We show that the quotient cube w.r.t. COUNT, SUM and the closed cube lattice have a similar expression power but the latter has the smallest possible size. Finally we focus on the multidimensional association issue and introduce the covering graph of the quotient cube which provides the user with a visualization tool of minimal multidimensional associations.
Laser direct-write and its application in low temperature Co-fired ceramic (LTCC) technology
Authors: Chengping Zhang, David Liu, Scott A. Mathews, John Graves, Timothy M. Schaefer, Barry K. Gilbert, Rohit Modi, Huey-Daw Wu, Douglas B. Chrisey
Venue: Microelectronic Engineering (2003)

Seeking better efficiency and faster turn-around in microelectronics manufacturing, a maskless laser direct-write process has been developed and applied to fabricate practical devices. The process uses a short pulse UV laser to transfer material from a source layer, or "ribbon", to a substrate. Patterning is achieved by scanning the laser beam, translating the receiving substrate, or both. No wet chemistry is required. This technique has a minimum resolution of 10 µn. Using low temperature Co-fired ceramic materials and the laser direct-write process, a multi-layer laminated band pass filter was fabricated. The inductors, resistors, and capacitors were fabricated on separate layers. The connections between the layers were made through interlayer vias. Test results show fully functional band pass filters with center frequency around 1.15 GHz. Simulation results are also discussed.
Efficient algorithms for solving static hamilton-jacobi equations
Authors: Dan Meiron
Venue:  (2003)

We present an algorithm for computing the closest point, transform to an explicitly described manifold on a rectilinear grid in low dimensional spaces. The closest point transform finds the closest point on a manifold and the Euclidean distance to a manifold for the points in a grid. We consider manifolds composed of simple geometric shapes, such as, a set of points, piecewise linear curves or triangle meshes. The algorithm solves the eikonal equation |&nabla;u| = 1 with the method of characteristics. For many problems, the computational complexity of the algorithm is linear in both the number of grid points and the complexity of the manifold. Many query problems can be aided by using orthogonal range queries (ORQ). There are several standard data structures for performing ORQ's in 3-D, including kd-trees, octrees, and cell arrays. We develop additional data structures based on cell arrays. We study the characteristics of each data structure and compare their performance. We present a new algorithm for solving the single-source, non-negative weight, shortest-paths problem. Dijkstra's algorithm solves this problem with computational complexity O ((E + V)log V) where E is the number of edges and V is the number of vertices. The new algorithm, called Marching with a Correctness Criterion (MCC), has computational complexity O (E + RV), where R is the ratio of the largest to smallest edge weight. Sethian's Fast Marching Method (FMM) may be used to solve static Hamilton-Jacobi equations. It has computational complexity O (N log N), where N is the number of grid points. The FMM has been regarded as an optimal algorithm because it is closely related to Dijkstra's algorithm. The new shortest-paths algorithm discussed above can be used to develop an ordered, upwind, finite difference algorithm for solving static Hamilton-Jacobi equations. This algorithm requires difference schemes that difference not only in coordinate directions, but in diagonal directions as well. It has computational complexity O(RN), where R is the ratio of the largest to smallest propagation speed and N is the number of grid points.
Visualizing polycrystalline orientation microstructures with spherical color maps
Authors: Boris Yamrom, John A. Sutliff, Andrew P. Woodfield
Venue: Proceedings of the conference on Visualization '94 (1994)

Spherical color maps can be an effective tool in the microstructure visualization of polycrystals. Electron backscatter diffraction pattern analysis provides large arrays of the orientation data that can be visualized easily using the technique described in this paper. A combination of this technique with the traditional black and white scanning electron microscopy imaging will enable scientists to better understand the correlation between material properties and their polycrystalline structure.
An Adaptive Data-Shipping Architecture for Client Caching Data Management Systems
Authors: Kaladhar Voruganti, M. Tamer Özsu, Ronald C. Unrau
Venue: Distributed and Parallel Databases (2004)

Data-shipping is an important form of data distribution architecture where data objects are retrieved from the server, and are cached and operated upon at the client nodes. This architecture reduces network latency and increases resource utilization at the client. Object database management systems (ODBMS), file-systems, mobile data management systems, multi-tiered Web-server systems and hybrid query-shipping/data-shipping architectures all use some variant of the data-shipping. Despite a decade of research, there is still a lack of consensus amongst the proponents of ODBMSs as to the type of data shipping architectures and algorithms that should be used. The absence of both robust (with respect to performance) algorithms, and a comprehensive performance study comparing the competing algorithms are the key reasons for this lack of agreement. In this paper we address both of these problems. We first present an adaptive data-shipping architecture which utilizes adaptive data transfer, cache consistency and recovery algorithms to improve the robustness (with respect to performance) of a data-shipping ODBMS. We then present a comprehensive performance study which evaluates the competing client-server architectures and algorithms. The study verifies the robustness of the new adaptive data-shipping architecture, provides new insights into the performance of the different competing algorithms, and helps to overturn some existing notions about some of the algorithms.
Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs
Authors: Rong Zhou, Eric A. Hansen
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We describe a novel heuristic search algorithm, called Sweep A*, that exploits the regular structure of partially ordered graphs to substantially reduce the memory requirements of search. We show that it outperforms previous search algorithms in optimally aligning multiple protein or DNA sequences, an important problem in bioinformatics. Sweep A* also promises to be effective for other search problems with similar structure.
Distributed Information Organization and Management Framework for Regulation Compliance
Authors: Jie Wang, James O. Leckie, Kincho H. Law, Gio Wiederhold
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Regulation compliance is one of the critical services to citizens and businesses for E-government, as identified by the U. S. Office of Management and Budget. Regulation compliance is a complex process and offers many challenges in the design and implementation of a regulatory information management system that is able to support the regulation compliance process. It is important to first gain an understanding of the information flow in the regulation and compliance process, and to develop appropriate IT tools for building such a system. Focusing on environmental regulations related to hazardous waste management, we investigate the issues towards building an information infrastructure for a compliance assistance framework. This paper will describe a prototype distributive regulationframework for: (1) the management of regulations and related information to support compliance assistance; (2) an Internet-based information management system; and (3) supporting the interoperability among the parties (regulatory agencies, businesses and thirdparty waste handling facilitators), who are involved in the environmental regulation compliance process.
Time and sample efficient discovery of Markov blankets and direct causal relations
Authors: Ioannis Tsamardinos, Constantin F. Aliferis, Alexander Statnikov
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Data Mining with Bayesian Network learning has two important characteristics: under conditions learned edges between variables correspond to casual influences, and second, for every variable T in the network a special subset (Markov Blanket) identifiable by the network is the minimal variable set required to predict T. However, all known algorithms learning a complete BN do not scale up beyond a few hundred variables. On the other hand, all known sound algorithms learning a local region of the network require an exponential number of training instances to the size of the learned region.The contribution of this paper is two-fold. We introduce a novel local algorithm that returns all variables with direct edges to and from a target variable T as well as a local algorithm that returns the Markov Blanket of T. Both algorithms (i) are sound, (ii) can be run efficiently in datasets with thousands of variables, and (iii) significantly outperform in terms of approximating the true neighborhood previous state-of-the-art algorithms using only a fraction of the training size required by the existing methods. A fundamental difference between our approach and existing ones is that the required sample depends on the generating graph connectivity and not the size of the local region; this yields up to exponential savings in sample relative to previously known algorithms. The results presented here are promising not only for discovery of local causal structure, and variable selection for classification, but also for the induction of complete BNs.
A Hybrid Data-Mining Approach in Genomics and Text Structures
Authors: Horia-Nicolai Teodorescu, Lucian Iulian Fira
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We introduce a genetic sequence identifier based on ahierarchical system using fuzzy and classic (crisp) neuralnetworks. The system is based on a set of predictors andon a decision network. The prediction of the structure ofthe genes is addressed using a new method and tools,involving the sequence of distances between bases andneuro-fuzzy predictors. The method and system have beensuccessful in predicting genomic sequences and textstructures.
Candytop: a Web3D interface to visualize growth of multimedia documents
Authors: Akira Wakita, Naofumi Yoshida, Jun Miyazaki, Hiroaki Chiyokura
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Candytop is a web3D interface to visualize growth of multimedia documents along with a time line. Users can easily realize the relation among documents and catch up the context behind the projects. We use X3D VRML97 Profile for modeling and visualization.
The winds of change: students' comfort level in different learning environments
Authors: Kathy Lynch, Selby Markham
Venue: ACM SIGCSE Bulletin (2003)

The information technology workforce now more than ever requires graduates to be ready to 'produce' the instant they 'hit the ground'. The core discipline knowledge and skills haven't changed dramatically over the years, but the 'soft skills' have changed and have become more important than ever. Undergraduate information technology degree must prepare graduates for the workforce, and not just transmit the discipline knowledge for them to achieve 'academically'. To ward off this, a change is required in the pedagogy, and consequently the learning environment for information technology students. With this is mind, Monash University introduced a studio model of teaching and learning into its Bachelor of Information Systems degree program. During the three years of the program students are confronted with two very different pedagogical models of teaching and learning. Seventy five percent of the program is taught in a traditional manner, the remaining twenty five percent is taught within a studio context.The first section of the paper briefly outlines a crude description of the traditional learning environment and the studio learning environment underpinning the IT studio-model that is used in the Bachelor of Information Systems at Monash University. The second section of the paper reports on a quantitative research study that examined students' opinions of which type of model (studio or non-studio) best meets their learning needs.