ppxscal/embedding_network huggingface dataset:
Set covering approach for reconstruction of sibling relationships
Authors: W. A. Chaovalitwongse, T. Y. Berger-Wolf, B. Dasgupta, M. V. Ashley
Venue: Optimization Methods Software (2007)

A new combinatorial approach for modelling and reconstructing sibling relationships in a single generation of individuals without parental information is proposed in this paper. Simple genetic constraints on the full-sibling groups, imposed by the Mendelian inheritance rules, are employed to investigate data from codominant DNA markers. To extract the minimum number of biologically consistent sibling groups, the proposed combinatorial approach is employed to formulate this minimization problem as a set covering problem, which is a well-known NP-hard combinatorial optimization problem. We conducted a simulation study of a relaxed version of the proposed algorithm to demonstrate that our combinatorial approach is reasonably accurate and the exact version of the sibling relationship construction algorithm should be pursued. In addition, the results of this study suggest that the proposed algorithm will pave our way to a new approach in computational population genetics as it does not require any a priori knowledge about allele frequency, population size, mating system or family size distributions to reconstruct sibling relationships.
About a system of anti-periodic trigonometric functions
Authors: E. Berriochoa, A. Cachafeiro, J. García-Amor
Venue: Computers Mathematics with Applications (2008)

In this paper we introduce the so-called second kind trigonometric system, which is a useful tool for the representation of 2@p ''anti-periodic'' functions. Using these functions we study a sequence of trigonometric polynomials, which are bi-orthogonal in the Szego's sense. We study the usual topics in the theory of Fourier series and we present a new connection with the orthogonal polynomials (OP) on the unit circle and some useful properties like: recurrence relations, kernel representations and a Favard's type theorem.
The dynamics of fuzzy cellular automata: rule 30
Authors: Angelo B. Mingarelli, Elzbieta Beres
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

We continue the investigation into the dynamics and evolution of fuzzy rules, obtained by the fuzzification of the disjunctive normal form, and initiated for Rule 90 in [3] and continued for Rule 110 in [5]. We present new results regarding the dynamics of fuzzy Rule 30 whose Boolean evolution is known to be chaotic [[7], p. 871]. In particular, we show that in the fuzzy case with a finite support configuration all temporal sequences are aperiodic, and their convergence is strongly dependent upon their positions along key diagonals. It follows that fuzzy Rule 30 is neither chaotic nor random. It turns out that the evolution and dynamics in this case differ radically from those in fuzzy Rule 90.
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Authors: Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin Bierman, Keith Wansbrough
Venue: Journal of Functional Programming (2008)

Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example, when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically, it is provided only by ad hoc mechanisms that lack clean semantics. In this paper, we adopt a foundational approach, developing core dynamic rebinding mechanisms as extensions to the simply typed call-by-value λ calculus. To do so, we must first explore refinements of the call-by-value reduction strategy that delay instantiation, to ensure computations make use of the most recent versions of rebound definitions. We introduce redex-time and destruct-time strategies. The latter forms the basis for a λmarsh calculus that supports dynamic rebinding of marshalled values, while remaining as far as possible statically typed. We sketch an extension of λmarsh with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed. Finally, we show that a high-level semantics for dynamic updating can also be based on the destruct-time strategy, defining a λupdate calculus with simple primitives to provide type-safe updating of running code. We show how the ideas of this simple calculus extend to more real-world, module-level dynamic updating in the style of Erlang. We thereby establish primitives and a common semantic foundation for a variety of real-world dynamic rebinding requirements.
CompariMotif
Authors: Richard J. Edwards, Norman E. Davey, Denis C. Shields
Venue: Bioinformatics (2008)

Summary: CompariMotif is a novel tool for making motif–motif comparisons, identifying and describing similarities between regular expression motifs. CompariMotif can identify a number of different relationships between motifs, including exact matches, variants of degenerate motifs and complex overlapping motifs. Motif relationships are scored using shared information content, allowing the best matches to be easily identified in large comparisons. Many input and search options are available, enabling a list of motifs to be compared to itself (to identify recurring motifs) or to datasets of known motifs. Availability: CompariMotif can be run online at http://bioware.ucd.ie/ and is freely available for academic use as a set of open source Python modules under a GNU General Public License from http://bioinformatics.ucd.ie/shields/software/comparimotif/ Contact: r.edwards@southampton.ac.uk Supplementary information: Further details are available at http://bioinformatics.ucd.ie/shields/software/comparimotif/
Evaluating rank joins with optimal cost
Authors: Karl Schnaitter, Neoklis Polyzotis
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practice that the inputs may be accessed in ranked order and the scoring function is monotonic. These conditions allow for efficient algorithms that solve the rank join problem without reading all of the input. In this paper, we present a thorough analysis of such rank join algorithms. A strong point of our analysis is that it is based on a more general problem statement than previous work, making it more relevant to the execution model that is employed by database systems. One of our results indicates that the well known HRJN algorithm has shortcomings, because it does not stop reading its input as soon as possible. We find that it is NP-hard to overcome this weakness in the general case, but cases of limited query complexity are tractable. We prove the latter with an algorithm that infers provably tight bounds on the potential benefit of reading more input in order to stop as soon as possible. As a result, the algorithm achieves a cost that is within a constant factor of optimal.
Single versus multi-hop wireless reprogramming in sensor networks
Authors: Rajesh Panta, Saurabh Bagchi, Issa Khalil, Luis Montestruque
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Wireless reprogramming of the sensor network is useful for uploading new code or for changing the functionality of the existing code. In recent years, the research focus has shifted from single hop reprogramming to multi-hop reprogramming primarily because of its ease of use. Practical experience from a multi-hop sensor network for monitoring water pollution, called CSOnet, deployed in South Bend, IN, indicates that single-hop reprogramming may be preferable under certain conditions to minimize reprogramming time and energy. In this, the user gets close to a node to be reprogrammed and wirelessly reprograms a single node at a time. The choice between single hop and multihop reprogramming depends on factors like network size, node density and most importantly, link reliabilities. We present a protocol called DStream having both single and multi-hop reprogramming capabilities. We provide mathematical analysis and results from testbed experiments and simulations to give insights into the choice of the two reprogramming methods.
Replay-based approaches to revision processing in stream query engines
Authors: Anurag S. Maskey, Mitch Cherniack
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Data stream processing systems have become ubiquitous in academic and commercial sectors, with application areas that include financial services, network traffic analysis, battlefield monitoring and traffic control. The append-only model of streams implies that input data is immutable and therefore always correct. But in practice, streaming data sources often contend with noise (e.g., embedded sensors) or data entry errors (e.g., financial data feeds) resulting in erroneous inputs and by implication, erroneous query results. Many data stream sources (e.g., Reuters ticker feeds) issue "revision tuples" (revisions) that amend previously issued tuples (e.g. erroneous share prices). A stream processing engine might reasonably respond to revision inputs by generating revision outputs that correct previously emitted query results. We know of no stream processing system that presently has this capability. In this paper, we describe how a stream processing engine can be extended to support revision processing via replay. Replay-based revision processing techniques assume that a stream engine maintains an archive of recent data seen on each of its input streams. These archives are then queried in response to a revision, with the resulting tuples replayed through the system so as to generate corrected query outputs. We first present the design and implementation of the revision processing engine for the Borealis stream processing engine [1]. We then compare techniques for archiving streams to support replay, and then compare the performance and overhead of two revision processing techniques that replay input tuples to recompute and thereby revise previously output query results. These experiments reveal scalability issues due to the overhead required to maintain stream archives, and has motivated our current research on using sampling and data summarization (e.g., histograms) to reduce the data that must be stored in a stream archive.
Coupons: A Multilevel Incentive Scheme for Information Dissemination in Mobile Networks
Authors: Anargyros Garyfalos, Kevin C. Almeroth
Venue: IEEE Transactions on Mobile Computing (2008)

Integrating mobile computing and localized user interaction into the Internet requires more than simply overcoming pure routing challenges. Apart from issues such as intermittent connectivity and unreliable nodes, the human factor is becoming increasingly important. To date, user behavior has only been considered in terms of mobility patterns and incentives for encouraging cooperation. Moreover, the focus has always been on systems that aim to enforce fairness by either bringing an indirect equilibrium or by punishing "misbehaving" users. The goal of this paper is therefore to present "Coupons". "Coupons" is an idea to "define", "evaluate" and "implement" algorithms for the emerging class of social network and information sharing applications. "Coupons" is a system designed to allow users to opportunistically interact and share data through a wireless medium, to overcome highly variable Internet access through adaptive localized interaction, and to incorporate an incentive scheme to make the system usable and encourage participation.
Intrusion Detection System Based on Data Mining
Authors: Zhan Jiuhua
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Analyzed recent IDS models, the development of IDS (Intrusion Detection System), and the current and gives a brief introduction to DM (Data Mining) technology. Presented a framework of IDS based on data mining for resolving the current problems IDS is facing. The system that performs anomaly detection can detect intrusions known and unknown, reduce omissions and misstatements, improve accuracy and speed of intrusion detection and has good adaptive capacity and scalability.
After the gold rush: toward sustainable scholarship in computing
Authors: Raymond Lister
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

In just thirty years, we have gone from punched cards to Second Life. But, as the American National Science Foundation (NSF) recently noted, "undergraduate computing education today often looks much as it did several decades ago" (NSF, 2006). Consequently, today's "Nintendo Generation" have voted with their feet. We bore them. The contrast between the changes wrought via computer research over the last 30 years, and the failure of computing education to adapt to those changes, is because computing academics lead a double life. In our research lives we see ourselves as part of a community that reaches beyond our own university. We read literature, we attend conferences, we publish, and the cycle repeats, with community members building upon each other's work. But in our teaching lives we rarely discuss teaching beyond our own university, we are not guided by any teaching literature; instead we simply follow our instincts. Academics in computing, or in any other discipline, can approach their teaching as research into how novices become experts. Several recent multi-institutional research collaborations have studied the development of novice programmers. This paper describes some of the results from those collaborations. The separation of our teaching and research lives diminishes not just our teaching but also our research. The modern practice of stripping away all 'distractions' to maximize research output is like the practice of stripping away rainforest to grow beef -- both practices appear to work, for a little while, but not indefinitely. Twenty-first century academia needs to bring teaching and research together, to form a scholarship of computing that is an integrated, sustainable, ecological whole.
Meeting adjourned: off-line learning interfaces for automatic meeting understanding
Authors: Patrick Ehlen, Matthew Purver, John Niekrasz, Kari Lee, Stanley Peters
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Upcoming technologies will automatically identify and extract certain types of general information from meetings, such as topics and the tasks people agree to do. We explore interfaces for presenting this information to users after a meeting is completed, using two post-meeting interfaces that display information from topics and action items respectively. These interfaces also provide an excellent forum for obtaining user feedback about the performance of classification algorithms, allowing the system to learn and improve with time. We describe how we manage the delicate balance of obtaining necessary feedback without overburdening users. We also evaluate the effectiveness of feedback from one interface on improvement of future action item detection.
Interactive aesthetics: culture and games
Authors: Tsen Wang
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Rhythm Action Games [RAG] are designed specially for musical and physical interaction. The experience of the RAG genre encourages each player have the ability to participate the virtual world in the game. No matter whether in RAG games or the KTV experience, we all share the human desire to extend our powers and, by coping with and adapting to the technology, escape from the reality of social structure and jump into the aesthetics of the screen imagery, the virtual world. As famous scholar, Jody Berland claims "The technical reconstruction is instrumental in the changing topography of social, cultural and political space." [7] Through the common cultural codings exchange in the practice of games, the aesthetic has been established and recognized. Just like singing in KTV, where the users share the collective aesthetic and cultural values through their interaction in the cubicles, here they share playing the games.
An Imperceptible Watermarking Scheme Using Variation and Modular Operations
Authors: Shu-Fen Tu, Ching-Sheng Hsu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The aim of this paper is to propose an imperceptible wavelet-based watermarking scheme. In our scheme, we use variation to define the degree of transparence of coefficients of LL band and further determine transparent coefficients of HL3 and LH3 bands. Then, the watermark is embedded into those coefficients. In addition, the modular operation is utilized during watermark embedding. In the experimental results, we simulate some common attacks on the watermarked image. It is shown that our scheme is robust against most attacks; moreover, the watermarked image is highly imperceptible.
Exploring an unknown graph
Authors: Xiaotie Deng, Christos H. Papadimitriou
Venue: Journal of Graph Theory (1999)

We wish to explore all edges of an unknown directed, strongly connected graph. At each point, we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited, but we cannot tell where each leads until we traverse it. We wish to minimize the ratio of the total number of edges traversed divided by the optimum number of traversals, had we known the graph. For Eulerian graphs, this ratio cannot be better than two, and two is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. Our main result is an algorithm that achieves a bounded ratio when the deficiency is bounded. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 265&ndash;297, 1999
Three-step BLAGE iterative method for two-dimensional elliptic boundary value problems with singularity
Authors: R. K. Mohanty
Venue: International Journal of Computer Mathematics (2007)

We present a new three-step block alternating group explicit (BLAGE) algorithm for solving block symmetric linear systems derived from both five-point second-order and nine-point fourth-order discretizations to solve the two-dimensional elliptic equation in both rectangular and cylindrical polar coordinates. The three-step BLAGE algorithm should save time compared with the two-step BLAGE algorithm as the aim of the procedure is to eliminate the evaluation of two similar terms which appear in the algorithm. The convergence theory of the algorithm is reported briefly. Numerical results obtained from three test problems are presented to demonstrate the utility of the proposed three-step BLAGE method compared with the corresponding two-step BLAGE iterative method and the block successive over-relaxation (BSOR) iterative method.
Open source computer algebra systems: Axiom
Authors: David Joyner
Venue: ACM Communications in Computer Algebra (2008)

This survey will look at Axiom, a free and very powerful computer algebra system available. It is a general purpose CAS useful for symbolic computation, research, and the development of new mathematical algorithms. Axiom is similar in some ways to Maxima, covered in the survey [J1], but different in many ways as well. Axiom, Maxima, and SAGE [S], are the largest of the general-purpose open-source CAS's. If you want to "take a test drive," Axiom can be tested without installation via the web interface [AS] or the SAGE online interface [S].
Low Cost RF Receiver Parameter Measurement with On-Chip Amplitude Detectors
Authors: Chaoming Zhang, Ranjit Gharpurey, Jacob A. Abraham
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

This paper describes the theory and chip measurements of a built-in test technique for RF receivers which uses simple RF amplitude detectors. The method has been used to measure the performance parameters of a 940 MHz RF receiver front-end with a mixer and LNA. The detector has small area overhead with low frequency output. The sampled output waveform is analyzed using an FFT, and the low frequency measurements are used to deduce the conversion gain and Third Order Intercept point (TOI, IIP3) of the receiver. A test chip was fabricated in a commercial 0.18um CMOS process. By using two detectors, both the system performance and specifications of discrete components have been accurately measured. Measurement results show accurate prediction of system and component specifications.
Features extraction method for Arabic characters based on pixel orientation technique
Authors: Mohamed A. Ali, Kasmiran Bin Jumari, Salina Abd. Samad
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper presents a features extraction module for isolated handwritten Arabic characters. The collected core features are based on pixels orientations according to Freeman chain code. The input to this module is Arabic character (in its basic-shapes i.e. without diacritics). The features extractor module, fed with a skeleton of an isolated character basic-shape, yields global and local features. Feature vector of 12 elements are used. Two features are global while the remaining 10 elements are locals. Neural network classifier is used for aggregating the features for classification decision making.
Ajax in Oracle JDeveloper, 1 edition
Authors: Deepak Vohra
Venue:  (2008)

Asynchronous JavaScript and XML (Ajax) is a web technique used to transfer data between a browser and server asynchronously without posting the web page to the server. "Asynchronously" implies that the processing of the web page continues while the Ajax request is sent to the server and a response is received from the server. The web page, or section(s) of the web page,is refreshed with the Ajax response without reposting the web page. Ajax has the following advantages over non-Ajax web applications. - Reduced response time and reduced server load, as the complete web page is not reposted. - Reduced bandwidth of web applications as only data is transferred and the HTML format is applied in the browser. - Separation of data, format and style. The book covers web search and RSS Feed with Ajax as well as form validation with Ajax frameworks for Java, JSP, JSF, and PHP. It discusses using Ajax in Oracle JDeveloper and is IDE based. JDeveloper has the following advantages over Eclipse IDE. - JDeveloper 11g provides an integrated JavaScript Editor for Ajax/Web development. - It also provides a PHP extension. - JDeveloper has a built-in support for JSF and for JDBC.
Forward and non-forward symplectic integrators in solving classical dynamics problems
Authors: Siu A. Chin
Venue: International Journal of Computer Mathematics (2007)

Forward time step integrators are splitting algorithms with only positive splitting coefficients. When used in solving physical evolution equations, these positive coefficients correspond to positive time steps. Forward algorithms are essential for solving time-irreversible equations that cannot be evolved using backward time steps. However, forward integrators are also better in solving time-reversible equations of classical dynamics by tracking as closely as possible the physical trajectory. This work compares in detail various forward and non-forward fourth-order integrators using three, four, five and six force evaluations. In the case of solving the 2D Kepler orbit, all non-forward integrators are optimized by simply minimizing the size of their backward time steps