ppxscal/embedding_network huggingface dataset:
Hierarchical model-based reinforcement learning: R-max + MAXQ
Authors: Nicholas K. Jong, Peter Stone
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Hierarchical decomposition promises to help scale reinforcement learning algorithms naturally to real-world problems by exploiting their underlying structure. Model-based algorithms, which provided the first finite-time convergence guarantees for reinforcement learning, may also play an important role in coping with the relative scarcity of data in large environments. In this paper, we introduce an algorithm that fully integrates modern hierarchical and model-learning methods in the standard reinforcement learning setting. Our algorithm, R-maxq, inherits the efficient model-based exploration of the R-max algorithm and the opportunities for abstraction provided by the MAXQ framework. We analyze the sample complexity of our algorithm, and our experiments in a standard simulation environment illustrate the advantages of combining hierarchies and models.
High resolution electron beam lithography of PMGI using solvent developers
Authors: Bo Cui, Teodor Veres
Venue: Microelectronic Engineering (2008)

We report in this paper that typical solvent developers for PMMA can be used to develop PMGI (polydimethyl glutarimide) with a contrast much higher than that reported using base developers. Three developers were studied: methyl isobutyl ketone (MIBK), 2-ethoxyethanol (cellosolve), and methyl ethyl ketone (MEK). MIBK developer results in the highest contrast of 6.7 which is comparable to that of PMMA, followed by MEK (4.0) and then by cellosolve (2.6). The sensitivity is around 1000@mC/cm^2, roughly four times that of PMMA and almost independent of the developers. Higher resist baking temperature leads to higher contrast for MEK and cellosolve, whereas for MIBK the optimum baking temperature is 200^oC. Both MIBK and MEK (but not cellosolve) developers can resolve 50nm pitch grating with slight line distortion which is similar to that achievable by PMMA. Using a single step development, a double layer of PMMA and PMGI could be employed to facilitate the liftoff process or to fabricate a T-shaped gate structure, while a multilayer stack can be used to produce 3D metal structures by electroplating.
Effective asymmetric XML compression
Authors: Przemysław Skibiński, Szymon Grabowski, Jakub Swacha
Venue: Software&mdash;Practice Experience (2008)

The innate verbosity of the extensible markup language (XML) remains one of its main weaknesses, especially when large documents are concerned. This problem can be solved with the aid of dedicated XML compression algorithms. In this work, we describe XML word-replacing transform (XML-WRT), a fast and fully reversible XML transform, which, when combined with generally used LZ77-style compression algorithms, allows to attain high compression ratios, comparable to those achieved by the current state-of-the-art XML compressors. The resulting compression scheme is asymmetric in the sense that its decoder is much faster than the coder. This is a desirable practical property, as in many XML applications data are read much more often than written. The key features of the transform are dictionary-based encoding of both document structure and content, separation of different content types into multiple streams, and dedicated encoding of specific patterns, including numbers and dates. The test results show that the proposed transform improves the XML compression efficiency of general-purpose compressors on average by 35&percnt; in case of gzip, and 17&percnt; in case of LZMA. Compared with the current state-of-the-art SCMPPM algorithm, XML-WRT with LZMA attains over 2&percnt; better compression ratio, while being 55&percnt; faster. Copyright &copy; 2007 John Wiley & Sons, Ltd.
From sockets and RMI to web services
Authors: Mark A. Holliday, J. Traynham Houston, E. Matthew Jones
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Traditional coverage of network programming techniques in a computer networking course addresses sockets, remote procedure call, and object-oriented remote procedure call. We propose two innovations to that coverage. The first is to emphasize the historical development of those techniques as a sequence with each technique evolving from the previous one. The second innovation is to extend the historical development and the techniques to the important current technique of web services.
Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor
Authors: Pei Gu, Uzi Vishkin
Venue: Journal of Embedded Computing (2006)

Explicit-multi-threading (XMT) is a parallel programming approach for exploiting on-chip parallelism. Its fine-grained single program multiple data (SPMD) programming model is suitable for many computing intensive applications. In this paper, we present a parallel gate level logic simulator implemented on an XMT platform and study its performance. Test results show potential for achieving more than a hundred-fold speedup over a serial implementation. This indicates an interesting possibility for a certain type of a single chip multicore architecture: use an existing easy-to-program API, such as VHDL or Verilog, for reduced application-software development time and better performance over serial performance-driven languages, such as C.
On the P&oacute;sa-Seymour conjecture
Authors: János Komlós, Gábor N. Sárközy, Endre Szemerédi
Venue: Journal of Graph Theory (1998)

Paul Seymour conjectured that any graph G of order n and minimum degree at least $\frac{k}{k+1}n$ contains the kth power of a Hamilton cycle. We prove the following approximate version. For any &epsilon; &ge; 0 and positive integer k, there is an n0 such that, if G has order n &ge; n0 and minimum degree at least $(\frac{k}{k+1} + \epsilon )n$, then G contains the kth power of a Hamilton cycle. &copy; 1998 John Wiley Sons, Inc. J. Graph Theory 29: 167176, 1998
The empirical performances of the selection criteria for nonparametric regression using smoothing spline
Authors: Dursun Aydin, Rabia Ece Omay
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper, the smoothing parameter selection problem has been examined in nonparametric regression using smoothing spline method for different data sets. For that reason a Monte Carlo simulation study has been performed with a program that coded in MATLAB. This simulation study provides a comparison of the five popular smoothing parameter selection criteria. Thus, the emprical performances of the five selection criteria have been investigated and suitable criteria, which used for smoothing parameter selection, have been obtained.
A development environment for distributed synchronous collaborative programming
Authors: Kristy Elizabeth Boyer, August A. Dwight, R. Taylor Fondren, Mladen A. Vouk, James C. Lester
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

While collaborative approaches in the classroom have been shown to be highly beneficial for students of computer science, obstacles inherent in today's academic environment often prevent collocated collaborative approaches from being implemented. One solution to the collocation problem may lie with tools that facilitate distributed collaboration. This paper presents RIPPLE (Remote Interactive Pair Programming and Learning Environment), a development environment for distributed synchronous collaborative programming. RIPPLE is an open source software tool. Initial user tests demonstrate positive responses from students, and the potential for long term learning, motivation, and retention benefits is significant. In addition to its benefits for students, RIPPLE is a tool for computing education researchers who wish to collect data on collaborative programming.
A biased survey of map enumeration results
Authors: Timothy R. Walsh
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This is a survey paper presenting map enumeration results obtained by the author, either alone or jointly with other researchers, as well as some of the other results in the literature that are the most relevant to the author's work. The results discussed in this paper include counting and generating maps and hypermaps of various types on orientable surfaces. The counting is achieved by means of closed-form formulas where possible, and otherwise - again, if possible - by computationally efficient algorithms.
Supporting deadline monotonic policy over 802.11 average service time analysis
Authors: Ines El Korbi, Leila Azouz Saidane
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario where two stations with different delay constraints contend for the channel. For this scenario a Markov chain based analytical model is proposed. From the mathematical model, we derive expressions of the average medium access delay called service time. Analytical results are validated by simulation results using the ns-2 network simulator.
The Moving Target Induced Dosimetric Effect vs. Beam Direction in Proton Radiotherapy of Moving Lung Tumors
Authors: Li Zhao, George Sandison, Jonathan Farr, Huanmei Wu, Markus Fitzek
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The treatment of moving targets is a primary challenge of radiotherapy. Internal margin has been widely used to account for the geometric displacement of moving targets. However, it has not been fully addressed if internal margin is beam specific, rather than purely geometric. A tissue equivalent thorax phantom with a tumor placed in the right lung is used in our study. The simulated tumor moves in three directions, superior-inferior (SI), anterior-posterior(AP), right-left (RL) with 6 and 12 mm displacements. Thedose distribution was recalculated for each position simulated. The resultant dose distribution is analyzed to provideinsights of internal margin setup. Our results show thatthe internal motion induced dose error is considerably lessalong the beam axis than it is laterally. Therefore, the beam direction needs to be considered when the internal margin is used to account for the tumor motion in the treatment of lung cancer with proton therapy.
Video Customization System Using Mpeg Standards
Authors: Svetlana Kim, Yongik Yoon
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

To generate dynamically a personalized video summary, a video customization system is designed and implemented incorporating usage environment. The customization system uses the three tier architecture to adapt and deliver some media contents for the user. The multimedia contents delivery includes today many challenges. There are increasing the diversity of user devices and network interface devices, and the pressure to satisfy the user preferences. These situations encourage the need of the customized contents for the user. In this paper, we describe the customization of multimedia contents, like video. For the customization of content, we propose the Hybrid Multimedia Access (HMA) model that uses the multimedia content descriptions such as MPEG-7 standard and MPEG-21 multimedia framework.
A Fast 3D Volume Reconstruction for Confocal Micro-rotation Cell Imaging
Authors: Yong Yu, Alain Trouvé, Bernard Chalmond
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

We propose a fast reconstruction algorithm for non-adherent living cell images from micro-rotational confocal microscopy. This procedure is called bi-protocol. Its key point consists in coupling micro-rotation data and conventional z-stack. Doing so, the estimation of the micro-rotation slice positions becomes a slice-to-volume registration allowing to reduce drastically the computing time. The validation of our procedure is performed on real data which gives significant improvement compared with the conventional z-stacking imaging.
BioSemantic System: Applications of Structured Natural Language to Biological and Biochemical Research
Authors: David Hecht, Rouh-Mei Hu, Rong-Ming Chen, Jong-Waye Ou, Chao-Yen Hsu, Haitao Gong, Ka-Lok Ng, Han C. W. Hsiao, Jeffrey J. P. Tsai, Phillip C. -Y. Sheu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Recent advances and new technologies in biological and medical research have resulted in a rapid accumulation of enormous amounts and types of data and data analysis tools. Although most of these databases and tools are available through the internet and are easily accessible for users, they are highly heterogeneous making it difficult to integrate into efficient workflows. In this paper, we present a natural-language, object-based computing system, BioSemantic System (BSS), for seamlessly integrating these diverse bioinformatics databases and tools into efficient workflows that will increase the productivity of end-user researchers. Below, we present vocabulary, including nouns, verbs and adjectives as well as several examples of applications to biological and biomedical research problems.
Performance analysis on mobile agent-based parallel information retrieval approaches
Authors: Wenyu Qu, Masaru Kitsuregawa, Keqiu Li
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The main concern of the Internet user-base has shifted from what kind of information are available to how to find the desired information on the Internet thanks to the explosive growth of the WWW and the increasing amount of data available via the Internet. Since mobile agent technology is expected to be a promising technology for information retrieval, there are a number of mobile agent based-information retrieval approaches have been proposed in recent years. For a better understanding and efficiency improvement of these approaches, performance evaluation of great importance. However, most of existing evaluation results are experimental and there is a lack of theoretical performance analysis which is helpful to reveal the insight of the working mechanisms. In this paper, we further the study in [14] in which some primary studies on the performance of several mobile agent-based information retrieval approaches are provided and provide the exact probability distributions of execution time for each approach. Our results reveal the insight of mobile agent-based information retrieval approaches and our analytical method provides a useful tool for further research to information retrieval.
MODELING AND SIMULATION FOR INTELLIGENT CONTROL OF EXPANSION VALVE IN VAPOUR COMPRESSION REFRIGERATION SYSTEM
Authors: Jagdev Singh, Nirmal Singh, J. K. Sharma
Venue: Cybernetics and Systems (2007)

Conventional control techniques are not able to accomplish the stable cooling in VCRS (vapour compression refrigeration system) of air conditioning system. This article describes the fuzzy modeling and simulation for intelligent control to regulate the opening area of expansion valve for better and stable refrigerant flow even in the presence of operating condition change. Fuzzy logic control of expansion valve can make a quick response to the abrupt changes of operating parameters in VCRS. The expansion valve opening trend depending upon differential pressure across it (delP) and refrigerant mass flow rate is analyzed with fuzzy modeling using ANFIS. Differential pressures in the range of 3-7 bar are sustained across the valve. Flow rates up to 0.15 kg/sec for the refrigerant R-134a have been demonstrated. The performance of the model is evaluated by comparing the predicted results with the standard mathematical model.
Automaton in or out: run-time plan optimization for XML stream processing
Authors: Hong Su, Elke A. Rundensteiner, Murali Mani
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is first used to locate all query patterns in the input stream and compose the matched tokens into XML element nodes. These XML nodes are then passed to the tuple-based algebraic operators for further filtering or restructuring. This common processing style is however not always optimal. At times it is more efficient to retrieve only a subset of the patterns in the automaton while retrieving the rest of the patterns on the XML element nodes. In this paper, we use a cost-based solution to explore this novel optimization opportunity. We design three plan optimization algorithms, namely, MinExhaust, GreedyBasic and FastPrune. We also study how to migrate from a currently running plan to a new plan in a safe and efficient manner. Our experimentations have shown that the GreedyBasic or FastPrune algorithm can quickly find a plan that is close to optimal in most scenarios. Also we illustrate that the overhead in our approach for run-time statistics collection and plan migration are very lightweight.
Systemic computation: A model of interacting systems with natural characteristics
Authors: Peter J. Bentley
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

Natural systems provide unique examples of computation in a form very different from contemporary computer architectures. Biology also demonstrates capabilities such as adaptation, self-repair and self-organisation that are becoming increasingly desirable for our technology. To address these issues a new computer model and architecture with natural characteristics is presented. Systemic computation is Turing Complete; it is designed to support biological algorithms such as neural networks, evolutionary algorithms and models of development, and shares the desirable capabilities of biology not found in conventional architectures. Systemic computation may also be implemented using natural systems, enabling the potential for future computational analysis and control of biology.
An improved TDOA positioning method using pattern matching for CDMA networks
Authors: Dilshod Akbarov, Sunmi Kim, Yongwan Park, Gyuyoung Han
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, an improved time difference of arrival (TDOA) positioning method using pattern matching (PM) is proposed to achieve a high positioning accuracy of mobile station (MS) in CDMA networks where GPS is not satisfactory. Iterative TDOA method is used for its high accuracy and good robustness. Since the performance of iteration method depends highly on the initial estimation, the proposed method uses the location information from PM to estimate initial value. There is no need to change the hardware of MS. PM's results and other data such as received signal value, time delay are measured by using diagnostic monitoring (DM) software in real environment. The results show that proposed method can provide a better accuracy and outperforms a conventional PM algorithm.
The consistency among facilitating factors and ERP implementation success: A holistic view of fit
Authors: Eric T. G. Wang, Sheng-Pao Shih, James J. Jiang, Gary Klein
Venue: Journal of Systems and Software (2008)

Traditionally, various ERP implementation factors have been deemed critical to success within diverse business environments. The interaction relationships among these ERP implementation success factors, however, have been overlooked. The objective of this study is to explore the interaction patterns among the ERP implementation success factors from a covariation (co-alignment) perspective. We conceptualize the ''consistency'' among the factors that facilitate ERP implementation and evaluate them in terms of their positive impact on successful ERP implementation. The results from a field survey of 90 Taiwanese manufacturing firms show that the ''consistency'' among these facilitating factors of ERP implementation had a significant positive impact on ERP implementation success. The factors examined in this study include vendor support, consultant competence, ERP project team member competence, ERP project manager leadership, top management support, and user support. Implications for managers and researchers conclude this study.
Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs
Authors: Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

A hamiltonian cycle C of a graph G is described as áu1, u2, . . . , un(G), u1ñ to emphasize the order of vertices in C. Thus, u1 is the start vertex and ui is the i-th vertex in C. Two hamiltonian cycles of G start at a vertex x, C1 = áu1, u2, . . . , un(G), u1ñ and C2 = áv1, v2, . . . , vn(G), v1ñ, are independent if x = u1 = v1 and ui ¹ vi for every i, 2 ≤ i ≤ n(G). A set of hamiltonian cycles {C1, C2, . . . , Ck} of G are mutually independent if any two different hamiltonian cycles are independent. The mutually independent hamiltonicity of graph G, IHC(G), is the maximum integer k such that for any vertex u of G there exist k-mutually independent hamiltonian cycles of G starting at u. In this paper, we are going to study IHC(G) for the n-dimensional pancake graph Pn and the n-dimensional star graph Sn. We prove that IHC(Pn) = n − 1 if n ≥ 4 and IHC(Sn) = n − 1 if n ≥ 5.
Input vector control for post-silicon leakage current minimization in the presence of manufacturing variability
Authors: Yousra Alkabani, Tammara Massey, Farinaz Koushanfar, Miodrag Potkonjak
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We present the first approach for post-silicon leakage power reduction through input vector control (IVC) that takes into account the impact of the manufacturing variability (MV). Because of the MV, the integrated circuits (ICs) implementing one design require different input vectors to achieve their lowest leakage states. We address two major challenges. The first is the extraction of the gatelevel characteristics of an IC by measuring only the overall leakage power for different inputs. The second problem is the rapid generation of input vectors that result in a low leakage for a large number of unique ICs that implement a given design, but are different in the post-manufacturing phase. Experimental results on a large set of benchmark instances demonstrate the efficiency of the proposed methods. For example, the leakage power consumption could be reduced in average by more than 10.4%, when compared to the previously published IVC techniques that did not consider MV.
Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
Authors: Alfredo Buttari, Jack Dongarra, Jakub Kurzak, Piotr Luszczek, Stanimir Tomov
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. These ideas can be applied to sparse multifrontal and supernodal direct techniques and sparse iterative techniques such as Krylov subspace methods. The approach presented here can apply not only to conventional processors but also to exotic technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the Cell BE processor.