ppxscal/embedding_network huggingface dataset:
Faster pattern matching with character classes using prime number encoding
Authors: Chaim Linhart, Ron Shamir
Venue: Journal of Computer and System Sciences (2009)

In pattern matching with character classes the goal is to find all occurrences of a pattern of length m in a text of length n, where each pattern position consists of an allowed set of characters from a finite alphabet @S. We present an FFT-based algorithm that uses a novel prime-numbers encoding scheme, which is logn/logm times faster than the fastest extant approaches, which are based on boolean convolutions. In particular, if m^|^@S^|=n^O^(^1^), our algorithm runs in time O(nlogm), matching the complexity of the fastest techniques for wildcard matching, a special case of our problem. A major advantage of our algorithm is that it allows a tradeoff between the running time and the RAM word size. Our algorithm also speeds up solutions to approximate matching with character classes problems-namely, matching with k mismatches and Hamming distance, as well as to the subset matching problem.
An optimal operating policy for the production system with rework
Authors: Ning Liu, Youngjoo Kim, Hark Hwang
Venue: Computers and Industrial Engineering (2009)

Rework, the transformation of defective products generated during production period into serviceable ones, is an important issue in reverse logistics. This paper studies a production inventory system with rework where a stationary demand is satisfied either by production setup with new raw materials or by rework setup with defective items coming from production process. Through the formulation of mathematical models, we find simultaneously the optimal number of production and rework setups in a cycle, their sequence, and the economic production quantity of each setup. Numerical examples are solved to illustrate the validity of the solution procedure proposed.
Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
Authors: Minoru Kuribayashi, Masakatu Morii, Hatsukazu Tanaka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A reversible watermark algorithm with large capacity has been developed by applying the difference expansion of a generalized integer transform. In this algorithm, a watermark signal is inserted in the LSB of the difference values among pixels. In this paper, we apply the prediction errors calculated by a predictor in JPEG-LS for embedding watermark, which contributes to increase the amount of embedded information with less degradation. As one of the drawbacks discovered in the above conventional method is the large size of the embedded location map introduced to make it reversible, we decrease the large size of the location map by vectorization, and then modify the composition of the map using the local characteristics. We also exclude the positions such that the modification in the embedding operation cannot increase the capacity but merely degrade the image quality, which can be applicable to the conventional methods.
A Pre-binding Update Fast Handover Control Using IEEE 802.21 MIH over 802.16e Networks
Authors: Hsu-Hung Huang, Jung-Shry Wu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Cross-layer design is proposed to facilitate network layer handover in RFC4068 fast handover mobile IPv6. However, when FMIPv6 operation enters into reactive mode or wrong handover anticipation, it will result in significant connection disruption and packet loss. Our research is focused on network layer handover issue based on IEEE 802.16e wireless network. We present an architecture which uses the idea of Binding Update in advance to accelerate FMIPv6 operation, and also uses 802.21 media independent handover services to trigger network layer handover to avoid incorrect handover prediction and reduce the transmission of signal. A simulation comparison with FMIPv6 over 802.16e is presented and a computational signal cost analysis is also performed to verify these different methods
Existence and stability of periodic solution of a predator-prey model with state-dependent impulsive effects
Authors: Linfei Nie, Zhidong Teng, Lin Hu, Jigen Peng
Venue: Mathematics and Computers in Simulation (2009)

According to integrated pest management for pests, we investigate the dynamic behavior of a class predator-prey system with state-dependent impulsive effects by releasing natural enemies and spraying pesticide at different thresholds. Using the Poincare map and the properties of the Lambert W function, we prove the sufficient conditions for the existence and stability of semi-trivial solutions and positive periodic solutions. Numerical results are carried out to illustrate the feasibility of our main results.
DGHPSim: supporting smart thinking to improve hospital performance
Authors: M. M. Günal, M. Pidd
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

DGHPSim is a suite of discrete event simulation models that enable managers and clinicians to investigate improvement scenarios for UK general hospitals. The models were developed in Micro Saint Sharp and are configured using hospital data and nationally available health episode statistics. The models can be separately but function best as a single, overall system model that allow users to develop understanding of the interaction effects of possible changes. An example of the use of DGHPSim is given, using UK NHS data, demonstrating how it can be used to investigate improvement options whilst keeping an eye on side effects.
Existence of (2, 8) GWhD(v) and (4, 8) GWhD(v) with $${v \equiv 0,1 (mod 8)}$$
Authors: R. Julian Abel, Norman J. Finizio, Malcolm Greig, Luis B. Morales
Venue: Designs, Codes and Cryptography (2009)

(2, 8) Generalized Whist tournament Designs (GWhD) on v players exist only if $${v \equiv 0,1 (mod 8)}$$. We establish that these necessary conditions are sufficient for all but a relatively small number of (possibly) exceptional cases. For $${v \equiv 1 (mod 8)}$$ there are at most 12 possible exceptions: {177, 249, 305, 377, 385, 465, 473, 489, 497, 537, 553, 897}. For $${v \equiv 0 (mod 8)}$$ there are at most 98 possible exceptions the largest of which is v = 3696. The materials in this paper also enable us to obtain four previously unknown (4, 8)GWhD(8n+1), namely for n = 16,60,191,192 and to reduce the list of unknown (4, 8) GWhD(8n) to 124 values of v the largest of which is v = 3696.
Computer communication in NTT remote computing services
Authors: Masatoshi Iwayama, Atsumu Fujiwara
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Today, NTT's RCS has higher-level and more varied functions than when it started. It occupies a more and more important position in computerization in Japan.
Improved scatter search for the global optimization of computationally expensive dynamic models
Authors: Jose A. Egea, Emmanuel Vazquez, Julio R. Banga, Rafael Martí
Venue: Journal of Global Optimization (2009)

A new algorithm for global optimization of costly nonlinear continuous problems is presented in this paper. The algorithm is based on the scatter search metaheuristic, which has recently proved to be efficient for solving combinatorial and nonlinear optimization problems. A kriging-based prediction method has been coupled to the main optimization routine in order to discard the evaluation of solutions that are not likely to provide high quality function values. This makes the algorithm suitable for the optimization of computationally costly problems, as is illustrated in its application to two benchmark problems and its comparison with other algorithms.
GFO-Bio: A biological core ontology
Authors: Robert Hoehndorf, Frank Loebe, Roberto Poli, Heinrich Herre, Janet Kelso
Venue: Applied Ontology (2008)

The rapid increase in the number and use of biological ontologies necessitates developing systems for their integration. In this paper we present a core ontology for biology, and outline its application for integrating biological domain ontologies. Our ontology rests on a foundational ontology, which offers higher-order categories and a theory of levels of reality. The core ontology is implemented in two separate components, each of which adheres to OWL-DL. These can be used independently with efficient DL reasoners, but they will be most effective when used together, which necessitates working with an OWL-Full ontology. The ontology is freely available from our website at: http://bioonto.de/pmwiki.php/Main/GFO-Bio.
Tight rank lower bounds for the Sherali–Adams proof system
Authors: Stefan Dantchev, Barnaby Martin, Mark Rhodes
Venue: Theoretical Computer Science (2009)

We consider a proof (more accurately, refutation) system based on the Sherali-Adams (SA) operator associated with integer linear programming. If F is a CNF contradiction that admits a Resolution refutation of width k and size s, then we prove that the SA rank of F is @?k and the SA size of F is @?(k+1)s+1. We establish that the SA rank of both the Pigeonhole Principle PHP"n"-"1^n and the Least Number Principle LNP"n is n-2. Since the SA refutation system rank-simulates the refutation system of Lovasz-Schrijver without semidefinite cuts (LS), we obtain as a corollary linear rank lower bounds for both of these principles in LS.
A global Particle Swarm-Based-Simulated Annealing Optimization technique for under-voltage load shedding problem
Authors: N. Sadati, T. Amraee, A. M. Ranjbar
Venue: Applied Soft Computing (2009)

In this paper, a new approach based on hybrid Particle Swarm-Based-Simulated Annealing Optimization technique (PSO-B-SA) is proposed for solving under-voltage load shedding (UVLS) problem. Under-voltage load shedding (UVLS) is one of the most important tools for avoiding voltage instability. In this paper, the UVLS problem is formulated based on the concept of the static voltage stability margin and its sensitivity at the maximum loading point or the collapse point. The voltage stability criterion is modeled directly into the load-shedding scheme. In any UVLS scheme finding the global point is very important for having cost effective economy. The proposed PSO-B-SA methodology is implemented in the under-voltage load shedding scheme for IEEE 14 and 118 bus test systems. In addition to having better solution, the global property of the proposed approach plays an important role in on-line applications. Simulation results show the efficacy and advantage of the proposed scheme.
Text search in document images based on Hausdorff distance measures
Authors: Andrey Andreev, Nikolay Kirov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The Hausdorff type distances between the sets of points on the plane are the commonly used similarity measures for binary images. In this work we present several such measures in a unified manner and introduce a new, naturally arisen variant of Hausdorff distance. The matching performance of all similarity measures is compared by computer experiments, using real word images from a scanned book.
Analysis of skill acquisition process: A case study of arm reaching task
Authors: Kahori Kita, Ryu Kato, Hiroshi Yokoi, Tamio Arai
Venue: Robotics and Autonomous Systems (2009)

Analysis of continuous process of motor learning gives a lot of useful knowledge for the recovery of human motion activities, and functional adaptability in new environment. This paper proposes a valuation index for degree of proficiency, and shows results of motor skill analysis for several arm reaching tasks. The motor skills were evaluated by using the reproducibility of muscle activation patterns, which were represented by using the variance value of the Electromyographic (EMG) signal patterns, and the motion accuracy. We confirm that the reproducibility is high when the motion accuracy is high, and the various skill acquisition processes exist due to individual difference. We conclude that, the reproducibility is one of the important indices for evaluating the degree of proficiency.
Capacity-approaching block-based transceivers with reduced redundancy
Authors: Leonardo Rey Vega, Cecilia G. Galarza
Venue: Digital Signal Processing (2009)

We present a transceiver structure for a frequency selective channel that allows the introduction of reduced redundancy. At the same time we optimize the transmitter and receiver in this structure to maximize the information rate. We show that we can decouple the problem of optimizing the transmitter and the receiver in two different problems by using to the data processing inequality of information theory. The problem of finding the transmitters is a difficult non-linear optimization problem. For that reason we present two simple algorithmic procedures in order to obtain suboptimal solutions. We present simulation results that show that the proposed design outperforms other existing ones in the literature. We also show that the proposed scheme is asymptotically optimal in the sense that it approaches the channel capacity.
Open Source Approaches in Spatial Data Handling, 1 edition
Authors: G. Brent Hall, Michael G. Leahy
Venue: Advances In Geographic Information Science (2008)

This book focuses on the nature and characteristics of open source geospatial (OSG) software. Therole of OSG approaches in spatial data handling is the cross-cutting theme of the book. Various sub-themes are explored that introduce readers unfamiliar to OSG software to the nature, purpose and applications of OS programming, and to the key new OS tools and their application within the geospatial data domain. The book also includes a discussion of new tools, approaches and applications for those already using OS approaches to software development.
Oxide nanolayer improving RRAM operational performance
Authors: Hisashi Shima, Yukio Tamai
Venue: Microelectronics Journal (2009)

The microstructure of Co-O, the interface between Co-O and electrodes, and the resistance switching in Co-O have been investigated. The Co-O film on the Pt electrode has quite dense crystallized grains and smooth surface, making it appropriate for the ultrahigh density non-volatile memory. About 5nm thick interfacial oxide nanolayer including Ta2O5 was confirmed at the Co-O/Ta interface, which was spontaneously formed owing to the low oxygen potential of Ta. The low current resistance switching and operational stability in Pt/Co-O/Ta are attributed to the interfacial layer acting as the embedded load resistance component in the forming process. The engineering for the nanoregion at the interface is crucial in order to improve the performance of the resistance switching random access memory.
Non-mitotic sets
Authors: Christian Glaβer, Alan L. Selman, Stephen Travers, Liyu Zhang
Venue: Theoretical Computer Science (2009)

We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that *1-tt-mitoticity and m-mitoticity differ on NP. *T-autoreducibility and T-mitoticity differ on NP (this contrasts the situation in the recursion theoretic setting, where Ladner showed that autoreducibility and mitoticity coincide). *2-tt-autoreducibility does not imply weak 2-tt-mitoticity (from this it follows that autoreducibility and mitoticity are not equivalent for all reducibilities between 2-tt and T, although the notions coincide for m- and 1-tt-reducibility).
DracoSTM: a practical C++ approach to software transactional memory
Authors: Justin E. Gottschlich, Daniel A. Connors
Venue: Proceedings of the 2007 Symposium on Library-Centric Software Design (2007)

Transactional memory (TM) is a recent parallel programming concept which reduces challenges found in parallel programming. TM offers numerous advantages over other synchronization mechanisms, yet many current TM systems require complex hardware, programming language extensions, specific compiler support or enforce impractical software design, making these models unrealistic as an immediate TM solution for early adopters. Our new software transactional memory (STM) system, DracoSTM, is a high performance lock-based C++ STM research library. DracoSTM uses only native object-oriented language semantics, increasing its intuitiveness for developers while maintaining high programmability via automatic handling of composition, locks and transaction termination. DracoSTM is the STM first solution to (1) implement both direct and deferred updating and (2) enable run-time alternation between these updating policies. DracoSTM requires no language extension, specific development environment or platform, widening its usability and increasing the novelty of its design. This paper describes DracoSTM from an architectural infrastructure viewpoint. TM-specific and library-specific aspects are discussed, as are their cross-cutting design concerns. Finally, performance benchmarks are presented, showing DracoSTM outperform another high performing C++ STM library, by upwards of two orders of magnitude.
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Authors: Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are integers such that 0 ≤ l ≤ u. One wishes to partition G into connected components by deleting edges from G so that the total weight of each component is at least l and at most u. Such an "almost uniform" partition is called an (l, u)-partition. We deal with three problems to find an (l, u)-partition of a given graph: the minimum partition problem is to find an (l, u)-partition with the minimum number of components; the maximum partition problem is defined analogously; and the p-partition problem is to find an (l, u)-partition with a given number p of components. All these problems are NP-hard even for series-parallel graphs, but are solvable for paths in linear time and for trees in polynomial time. In this paper, we give polynomial-time algorithms to solve the three problems for trees, which are much simpler and faster than the known algorithms.
EMPACT&trade;: a distributed database application
Authors: Alan Norman, Mark Anderton
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

EMPACT&trade;, TANDEM Computers' manufacturing information control system, is an application that uses a distributed database. The requirements of the system include supporting multiple sites, providing continuous availability to the data, and controlling updates to communal information. The approach taken to satisfy these needs involves the use of both partitioned and replicated data. Presented in this paper is a discussion of the application requirements, the design and architecture of the database, and the algorithms used for updates and inserts.
AspectKAOS: integrating early-aspects into KAOS
Authors: André Gil, João Araujo
Venue: Proceedings of the 15th workshop on Early aspects (2009)

In KAOS, a goal-oriented requirements engineering approach, requirements are obtained from the goals a system must accomplish. When modeling goals some of them will be tangled and scattered all over the system. This will increase the complexity of the system, thus diminishing the understandability of it. Identification of cross-cutting concerns at requirements enables us to separate those concerns from the very beginning and provide a simpler and enhanced design of the system so it will have a better evolution. By combining goals and aspects we will improve the system's maintainability, reusability and evolution over time.
Completed analysis of cellular networks with PH-renewal arrival call
Authors: Yung-Chung Wang, Chwan-Lu Tseng, Ren-Guey Chu, Shu-Ming Tseng
Venue: Computer Communications (2009)

In this paper, we apply the PH-renewal process to model new call and handoff processes, and apply the matrix-analytic approach to explore the performance measures of the drop and block probabilities. We examine the bursty nature of handoff call drops by means of conditional statistics with respect to alternating block and non-block periods. Five related performance measures are derived from conditional statistics, including the long-term new call block and handoff call drop probabilities, and the three short-term measures of average length of a block period and a non-block period, as well as the conditional handoff call drop probability during a block period. These performance measures greatly assist the priority reservation handoff mechanism in determining a proper threshold guard channel in the cell. Furthermore, we derive the handoff call drop probability from the short-term performance measures of average length of a block period and a non-block period, as well as the conditional handoff call drop probability during a block period. The results presented in this paper can provide guidelines for designing adaptive algorithms to adjust the threshold in the guard channel reservation handoff scheme.
Nothing to Hide Biometrics, Privacy and Private Sphere
Authors: Emilio Mordini
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

Biometrics could overcome - or at least have the potential for overcoming - all previous human recognition schemes, this may have unexpected consequences also for identity definition. There is an inextricable link between the construction of the private sphere and the public recognition of individuals. We exist as individuals as far as we are able to represent ourselves as autonomous subjects. This is possible only as long as we are able to use recognized identities. Basically people need to create an inner space, which is called "private". It is not essential that this space holds anything, yet it is essential that each individual has the impression that they own the keys to enter this space and have the power to open and close the door of this private realm. Privacy is not in what we hide but in having the power to hide something.
Perceived technology clusters and ownership of related technologies: The case of consumer electronics
Authors: Frank J. Van Rijnsoever, Carolina Castaldi
Venue: Journal of the American Society for Information Science and Technology (2009)

We contribute to the understanding of how technologies may be perceived to be part of technology clusters. The value added of the paper is both at a theoretical and an empirical level. We add to the theoretical understanding of technology clusters by distinguishing between clusters in perceptions and clusters in ownership, and by proposing a mechanism to explain the existence of clusters. Our empirical analysis combines qualitative and quantitative methods to investigate clusters of consumer electronics for a sample of Dutch consumers. We find that perceived clusters in consumer electronics are mostly determined by functional linkages, and that perceived technology clusters are good predictors of ownership clusters, but only for less widely diffused products. &copy; 2009 Wiley Periodicals, Inc.
Cubic group-III nitride-based nanostructures-basics and applications in optoelectronics
Authors: D. J. As
Venue: Microelectronics Journal (2009)

Molecular beam epitaxy (MBE) of cubic group-III nitrides is a direct way to eliminate the polarization effects which inherently limits the performance of optoelectronic devices containing quantum well or quantum dot active regions. In this contribution the latest achievement in the MBE of phase-pure cubic GaN, AlN, InN and their alloys will be reviewed. A new reflected high-energy electron beam (RHEED) control technique enables to carefully adjust stoichiometry and to severely reduce the surface roughness, which is important for any hetero-interface. The structural, optical and electrical properties of cubic nitrides and AlGaN/GaN will be presented. We show that no polarization field exists in cubic nitrides and demonstrate 1.55@mm intersubband absorption in cubic AlN/GaN superlattices. Further the progress towards the development and fabrication of cubic hetero-junction field effect transistors (HFETs) is discussed.