ppxscal/embedding_network huggingface dataset:
An object-oriented representation for efficient reinforcement learning
Authors: Carlos Diuk, Andre Cohen, Michael L. Littman
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object-Oriented MDPs (OO-MDPs), a representation based on objects and their interactions, which is a natural way of modeling environments and offers important generalization opportunities. We introduce a learning algorithm for deterministic OO-MDPs and prove a polynomial bound on its sample complexity. We illustrate the performance gains of our representation and algorithm in the well-known Taxi domain, plus a real-life videogame.
Selection of the basic parameters of the lens for the optic-electronic target recognition system
Authors: Martin Macko, Teodor Baláž
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This article deals with determination of lens parameters of the optic-electronic system for detection, recognition and identification of moving military targets in dependency on their distance. There are basic assumptions for determination of the most important parameters of the lenses suitable for systems of automatic target acquisition described in the article.
Irredundance perfect and P6-free graphs
Authors: Joël Puech
Venue: Journal of Graph Theory (1998)

The domination number &gamma;(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known that ir(G) &le; &gamma;(G) holds for all graphs G, which leads us to consider the concept of irredundance perfect graphs: graphs that have all their induced subgraphs satisfying the equality between the previous two parameters. In this article, we investigate two subclasses of irredundance perfect graphs that are defined in terms of forbidden subgraphs, where in each case, one of the forbidden subgraphs is the path P6. In particular, we prove two conjectures, the first one due to Faudree, Favaron, and Li [Faudree et al., J Combin. Math., 1997], and the second one due to Favaron [Favaron, J Graph Theory, 1986]. &copy; 1998 John Wiley Sons, Inc. J Graph Theory 29: 239255, 1998
A Framework for Software Engineering Experimental Replications
Authors: Manoel G. Mendonça, José C. Maldonado, Maria C. F. de Oliveira, Jeffrey Carver, Sandra C. P. F. Fabbri, Forrest Shull, Guilherme H. Travassos, Erika Nina Höhn, Victor R. Basili
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Experimental replications are very important to the advancement of empirical software engineering. Replications are one of the key mechanisms to confirm previous experimental findings. They are also used to transfer experimental knowledge, to train people, and to expand a base of experimental evidence. Unfortunately, experimental replications are difficult endeavors. It is not easy to transfer experimental know-how and experimental findings. Based on our experience, this paper discusses this problem and proposes a Framework for Improving the Replication of Experiments (FIRE). The FIRE addresses knowledge sharing issues both at the intra-group (internal replications) and inter-group (external replications) levels. It encourages coordination of replications in order to facilitate knowledge transfer for lower cost, higher quality replications and more generalizable results.
High etch selectivity for plasma etching SiO2 with AlN and Al2O3 masks
Authors: K. Kolari
Venue: Microelectronic Engineering (2008)

SiO"2 has been etched with high etching selectivity to Al"2O"3 and AlN masks using inductively coupled plasma. This offers a possibility to use very thin masks for deep etching of glass for e.g. microfluidic devices. Furthermore, SiO"2 can be etched with very low etching selectivity to the mentioned masks, indicating a possibility to pattern the Al"2O"3 and AlN with SiO"2 or photoresist mask. A process based on a mixture of SF"6 and C"4F"8 was observed to etch SiO"2 with a rate of about 100nm/min at 250V bias (peak-to-peak) voltage, when Al"2O"3 and AlN had a zero etch rate. A process based on pure C"4F"8 was observed to etch Al"2O"3 and AlN with about 350V bias, when SiO"2 etch rate was still zero.
A novel algorithm for straightening highly curved images of human chromosome
Authors: Mehrsan Javan Roshtkhari, Seyed Kamaledin Setarehdan
Venue: Pattern Recognition Letters (2008)

An effective chromosome image processing algorithm for straightening highly curved chromosomes is presented. This will extend the domain of application of most of the previously reported algorithms to the curved chromosomes. The proposed algorithm is based on the calculating and analyzing the vertical and horizontal projection vectors of the binary image of the chromosome obtained at various rotation angles. The binary image is obtained by thresholding the input image after histogram modification. By minimizing a rotation score S which is defined based on the relative amplitude of the main peaks in the horizontal projections of the rotated pictures, the most appropriately rotated image is identified. This picture is used to determine the bending axis and from which the bending centre of the chromosome, which is then used to artificially straighten the curved chromosome. When applied to the real images of highly curved chromosomes the proposed algorithm could straighten all of the chromosome images within the dataset. To assess the effectiveness of the proposed algorithm, the automatically extracted bending centers are compared to the manually defined ones on the whole data set. Moreover, the density profiles of the chromosomes (a one-dimensional vector obtained by intensity sampling of the chromosome along its longitudinal axis), which is the most important and most commonly used feature for classification purposes, are identified and compared before and after chromosome straightening. The quantitative analysis of the results in both cases showed a close correlation between the two.
A Hierarchical MDS-Based Localization Algorithm for Wireless Sensor Networks
Authors: Gwo-Jong Yu, Shao-Chun Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In many applications of wireless sensor networks, location is very important information. Conventional location information comes from manual setting or GPS device. However, manual location setting requires huge cost of human time, and GPS location setting requires expensive device cost and large device size. Furthermore, GPS can not operate in indoor environment. Both approaches are not applicable to localization task of wireless sensor networks. In this paper, an accurate and efficient localization algorithm based on multidimensional scaling (MDS) is proposed in hierarchical network environment. Through localized computation of multidimensional scaling within a cluster, the computation overhead can be distributed to each cluster. On the other hand, MDS-based localization approach requires the estimation of multihop distance. Through restricting estimation of multihop distances within a cluster, the proposed localization algorithm achieves better accuracy and can operate in non-convex network environment. Experimental results reveal that the proposed HMDS localization algorithm outperforms MDSMAP algorithm in terms of accuracy.
Dynamic inference of likely data preconditions over predicates by tree learning
Authors: Sriram Sankaranarayanan, Swarat Chaudhuri, Franjo Ivančić, Aarti Gupta
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We present a technique to infer likely data preconditions forprocedures written in an imperative programming language. Given a procedure and a set of predicates over its inputs, our technique enumerates different truth assignments to the predicates, deriving test cases from each feasible truth assignment. The predicates themselves are derived automatically using simple heuristics. The enumeration of truth assignments is performed using a propositional SAT solver along with a theory satisfiability checker capable of generating unsatisfiable cores. For each assignment of truth values, a corresponding set of test cases are generated and executed. Based on the result of the execution, the truth assignment is classified as being safe or buggy. Finally, a decision tree classifier is used to generate a Boolean formula over the input predicates that explains the data obtained from the test cases. The resulting Boolean formula is, in effect, a likely data precondition for the procedure under consideration. We apply our techniques on a wide variety of functions from the standard C library. Our experiments show that the proposed technique is quite robust. For most cases, it successfully learns a precondition that captures a safe and permissive calling environment.
Multi-cumulant, multi-objective structural control: a circuit analog
Authors: Ronald W. Diersing, Michael K. Sain
Venue: Analog Integrated Circuits and Signal Processing (2008)

Cost cumulant control has been gaining momentum in recent years and has proven to be competitive with other controllers when applied to various structural control problems. These control methods have generalized the well-known LQG control. Similarly, in this paper cost cumulants are used to generalize the $$H_2/H_{\infty}$$ control problem. Initially the development will be done for a class of nonlinear systems. The treatment will then consider the case when the system is linear and the costs are quadratic. The multi-cumulant, multiobjective control strategy, as well as the worst case disturbance, will be found through a Nash game approach. Uncertainties in the stiffness and damping coefficients will be taken into account and this control strategy will be applied to a four story building subject to a seismic disturbance. Also, a connection of the building problem to circuits will be given.
Optimum design of cyclic storage systems; distributed parameter approach: 1-system definition and model formulation
Authors: Saeed Alimohammadi, Abbas Afshar
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

A cyclic storage system is a conjunctive use system, containing two major sub-systems: surface water and groundwater, which could meet the guaranteed demands via an interactive trade-off cycle. Considering the literatures may lead us that, these kinds of systems neither has been of a great concern in general topics, nor in particular fields such as distributed optimization of design, and operating rules. In order to optimize these systems, one must consider the hydraulic interactions between all of the components. Unfortunately, it has been neglected in most studies. In these two companion papers (both have published in this issue); a distributed parameter approach has been implemented for optimum planning of cyclic storage systems. For this purpose the modified and generalized form of unit response matrix has been developed and used to connect the distributed parameter groundwater simulation model to the optimization model. The resulted optimization model has a form of a nonlinear programming. In order to validate the model, it has been implemented in a hypothetical simple cyclic storage system. The results show that the modified unit response matrix method is a robust and powerful method for optimum planning of cyclic storage systems.
Automated recognition of cellular phenotypes by support vector machines with feature reduction
Authors: Z. Xia, X. Zhou, Z. Yin, Y. Sun, S. T. C. Wong, Y. Mao
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

In this paper, wrapper based feature selection by support vector machine is used for cellular multi-phenotypic mitotic analysis (MMA) in high content screening (HCS). Haralick texture feature subset and Zernike polynomial moment subset are used respectively or combined together as extracted digital feature set for original cellular images. Feature reduction is done by support vector machine based recursive feature elimination algorithm on these feature sets. With optimal feature subset selected, fuzzy support vector machine are adopted to judge the cellular phenotype. The results indicate Haralick texture feature subset is complementary with Zernike polynomial moment subset, when these two feature subsets are combined together; the cellular phase identification system achieved 99.17% accuracy, which is better than only one feature subset of them is used. The recognition accuracy with feature reduction is better than that achieved when no feature reduction done or using PCA as feature recombination tool on these datasets.
Physiological modeling of tumor-affected renal circulation
Authors: Johanne Bézy-Wendling, Marek Kretowski
Venue: Computer Methods and Programs in Biomedicine (2008)

One way of gaining insight into what can be observed in medical images is through physiological modeling. For instance, anatomical and functional modifications occur in the organ during the appearance and the growth of a tumor. Some of these changes concern the vascularization. We propose a computational model of tumor-affected renal circulation that represents the local heterogeneity of different parts of the kidney (cortex, medulla). We present a simulation of vascular modifications related to vessel structure, geometry, density, and blood flow in case of renal cell carcinoma. We also use our model to simulate computed tomography scans of a kidney affected by the renal cell carcinoma, at two acquisition times after injection of a contrast product. This framework, based on a physiological model of the organ and physical model of medical image acquisition, offers an opportunity to help radiologists in their diagnostic tasks. This includes the possibility of linking image descriptors with physiological perturbations and markers of pathological processes.
Proceedings of the tenth conference on Australasian computing education - Volume 78
Authors: Simon Hamilton, Margaret Hamilton
Venue: Conferences in Research and Practice in Information Technology Series; Vol. 315 (2008)

Welcome to the Tenth Australasian Computing Education Conference (ACE2008), held as part of Australasian Computer Science Week 2008 in Wollongong, Australia. This year's ACE promises to continue the tradition of a high quality conference providing the opportunity for educators from all areas of computing to meet and share their research and innovations in computing education. The full papers presented in these proceedings represent a good cross-section of leading-edge developments in the field of computing education research and innovation. An international call for papers resulted in the submission of 39 papers from Australia, Costa Rica, Finland, Germany, Jordan, New Zealand, Sweden, the UK and the USA. Each paper was refereed double blind by three or four referees, and 18 papers (46%) were finally selected for publication and presentation.
ProLink: a semantics-based social network for software projects
Authors: Juan Miguel Gomez-Berbis, Ricardo Colomo-Palacios, Angel Garcia-Crespo, Belen Ruiz-Mezcua
Venue: International Journal of Information Technology and Management (2008)

One of the core challenges in the IT world is to harness the possibilities of reusing knowledge, expertise and lessons learned from previous software projects. In this paper, we present ProLink, a semantic-based social network, a proof-of-concept architecture and implementation of how this approach could foster expertise sharing and its potentially tremendous impact on work organisation and software development.
Procedure for Information Collection on High-Speed, High-Bandwidth Communication Systems to Enable Network Management
Authors: Paul C. Hershey, Charles B. Silio Jr.
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

This paper presents a procedure for information collection on high-speed, high-bandwidth communi-cation systems to enable network management. Such systems transport large quantities of data at rates that inhibit user interpretation and response and, therefore, effective network management. This procedure allows the user to recognize patterns of importance amidst the plethora of available data so that the relevant content may be filtered and reduced to “information” that may be acted upon quickly to meet customer service requirements. A concrete example is provided to demonstrate an implementation of this procedure for a standards-based Media Access Control (MAC) layer protocol. Application of this procedure to higher-speed communication systems is straightforward by transforming incoming packets using a Time Transformed Machine (TTM).
FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol
Authors: Yi Luo, D. Manivannan
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper, first we discuss two critical data structures used in the Communication-Induced Checkpointing (CIC) protocols and their distinct roles in guaranteeing Z-Cycle Free (ZCF) property by tracking the checkpoint and communication pattern (CCPAT) in a distributed computation that can lead to Z-cycles and preventing them. Then, we provide our Transitive Dependency Enabled TimeStamp (T DE_TS) mechanism by which we can both timestamp each event and get the transitive dependency information upon receiving a message. Finally, based on this timestamping mechanism, we present our Fully Informed aNd Efficient (FINE) checkpointing algorithm which can not only improve the performance of Fully Informed (FI) CIC protocol proposed by Helary et al. but also decrease the overhead of piggybacked information.
Chip Multiprocessor Traffic Models Providing Consistent Multicast and Spatial Distributions
Authors: Dietmar Tutsch, Daniel Lüdtke
Venue: Simulation (2008)

Chip multiprocessors (CMPs) have become the center of attention in recent years. They consist of multiple processor cores on a single chip. These cores are connected on-chip by a bus or, if many cores are involved, by an appropriate network. To investigate how a multicore processor behaves dependent on the chosen network-on-chip topology, a corresponding model must be established for performance evaluation. Modeling and simulating the entire system would lead to high model complexity. Thus, it is more reasonable to exclude the cores and to simply model stochastically the detached network. The cores are replaced by traffic generators which must provide reasonable CMP traffic. It usually consists of multicasts and a particular spatial distribution. Because the traffic is not known exactly, both multicasts and spatial traffic are described as stochastic distributions for model input. The easiest way is to specify the spatial distribution of the traffic and the kind of multicasts independently of each other. However, not all multicast distributions can be achieved with a particular desired spatial distribution and vice versa. It is therefore important to check for the compatibility of the spatial distribution and the multicasts that the modeler is willing to investigate. Such a compatibility check is provided by the algorithm presented in this paper. It prevents inconsistent traffic parameters while modeling.
Application of an integrated decision support process for supplier selection
Authors: R. A. de Carvalho, H. G. Costa
Venue: Enterprise Information Systems (2007)

In many firms the value of purchased materials and components accounts for 50-80% of total cost of goods sold. For those firms, purchasing decisions cause enterprise wide side effects, and, therefore, should be treated as an integration matter. Supplier selection is a problem that deals with both qualitative and quantitative issues that must be measured using information that is normally spread within the enterprise. To see how this problem was addressed in a small construction company in Brazil, an integrated procurement process, which is a simplification of a more complex methodology, is presented. The case study shows the importance of simpler, yet efficient, solutions to address the decision making problems of smaller enterprises in development countries-a research and commercial niche not well developed yet.
Streaming SIMD Extensions applied to boundary element codes
Authors: M. T. F. Cunha, J. C. F. Telles, F. L. B. Ribeiro
Venue: Advances in Engineering Software (2008)

Nowadays processor architectures include Streaming SIMD Extensions (SSE) originally developed for multimedia applications, not so well explored for scientific computing. This fact has called the attention of the present authors and this paper introduces the application of SSE, also known as multimedia instructions, to boundary element codes. Since SSE instructions are not widespread among boundary element programmers, the authors present this technique applied to a well-known Fortran program for the solution of two-dimensional elastostatic problems. The vectorization guidelines provided here may also be extended to other numerical methods. Numerical experiments show the effectiveness of the proposed approach.
Unravel four hairpins!
Authors: Atsushi Kameda, Masahito Yamamoto, Azuma Ohuchi, Satsuki Yaegashi, Masami Hagiya
Venue: Natural Computing: an international journal (2008)

DNA machines consisting of consecutive hairpins, which we have previously described, have various potential applications in DNA computation. In the present study, a 288-base DNA machine containing four consecutive hairpins was successfully constructed by ligation and PCR. PAGE and fluorescence spectroscopy experiments verified that all four hairpins were successfully opened by four opener oligomers, and that hairpin opening was dependent on the proper openers added in the correct order. Quantitative analysis of the final results by fluorescence spectroscopy indicated that all four hairpins were open in about 1/4 to 1/3 of the DNA machines.
A semantic overlay network for unstructured peer-to-peer protocols
Authors: Junfeng Xie, Zhenhua Li, Guihai Chen
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Peer-to-Peer computing has become a popular networking paradigm for file sharing, distributed computing, collaborative working, etc. The widely used unstructured Peer-to-Peer protocols mainly face two problems arecting their working efficiency: 1) inefficient flooding-based search, 2) topology mismatch between the overlay network and its underlying network. In this paper, we propose to organize nodes into a semantic overlay network called CON which is composed of special interest groups based on nodes&#x2019; contents. CON guides the content search with semantic information so that it avoids most of the flooding cost. In order to alleviate the mismatch problem, nodes in CON initialize links according to their underlay proximity. Simulation results show that our mechanism efficiently increases the query success rate and reduces the traffic cost and query latency. We also compare CON with the similar work, which illuminates that CON performs better in many aspects.