ppxscal/embedding_network huggingface dataset:
BorderFlow: A Local Graph Clustering Algorithm for Natural Language Processing
Authors: Axel-Cyrille Ngonga Ngomo, Frank Schumacher
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

In this paper, we introduce BorderFlow, a novel local graph clustering algorithm, and its application to natural language processing problems. For this purpose, we first present a formal description of the algorithm. Then, we use BorderFlow to cluster large graphs and to extract concepts from word similarity graphs. The clustering of large graphs is carried out on graphs extracted from the Wikipedia Category Graph. The subsequent low-bias extraction of concepts is carried out on two data sets consisting of noisy and clean data. We show that BorderFlow efficiently computes clusters of high quality and purity. Therefore, BorderFlow can be integrated in several other natural language processing applications.
Teaching computational thinking through bioinformatics to biology students
Authors: Hong Qin
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Modern biology has transformed from an insular entity into an interdisciplinary science, which in turn demands interdisciplinary and cross-disciplinary training for future work force in biology and life sciences. Computational thinking is a way of thinking that uses concepts and methodologies of computing to address questions in a broad range of subjects, and as such, computational thinking offers an important skill set in modern sciences. Despite its importance, the concept of computational thinking has generally been side-stepped in undergraduate biology education. Many students in life sciences are often weak in quantitative/computing skills and tend to avoid computing-orient courses. To address these issues, we incorporated computational thinking into a bioinformatics course for undergraduate life science majors. We developed comprehensive computer laboratory exercises that offer hands-on learning experience for the targeted student pool, and employed peer-assisted collaborative learning environment. Preliminary results of these explorative efforts will be helpful for others to teach computational thinking to biology students.
Fragments of a conversation: constructing narratives with tangible illuminated cubes
Authors: Lyndl Hall
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

In this paper, I describe Fragments of a Conversation: an art installation of a set of tangible electronic paper cubes for composing visual narratives. I present my design and fabrication processes, how the cubes simple circuit drives the viewer interaction and related discussion.
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Authors: Yo-Sub Han, Kai Salomaa, Derick Wood
Venue: Fundamenta Informaticae (2009)

We investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.
Impact of lithography-friendly circuit layout
Authors: Pratik J. Shah, Jiang Hu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Current lithography techniques use a light wavelength of 193nm to print sub-65nm features. This introduces process variations which cause mismatches between desired and actual wafer feature sizes. However, the circuit layout can be modified in a manner which can make it more lithography-friendly. These modifications are implemented as a series of perturbation iterations on the initial layout generated by the CAD tool. The iterations are performed based on estimates of the highest feature variations which are calculated offline for standard cell pairs and stored in a Look-up table (LUT). The iterations are directed by a Simulated Annealing algorithm. In the process we observe the impact of the iterations performed on the initial solution in terms of wirelength, vias and routing congestion. The procedure is validated on ISCAS85 benchmark circuits and a reduction of greater than 20% in the number of instances with the highest cell boundary feature variations is observed. The wirelength and the number of vias showed an increase of roughly 2.2-8.8% and 1.2-7.8% respectively for different circuits.
SR-1: a simulation-based algorithm for the capacitated vehicle routing problem
Authors: Javier Faulin, Miquel Gilibert, Angel A. Juan, Xavier Vilajosana, Rubén Ruiz
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good solution", such as the one provided by the classical Clarke and Wright heuristic, in order to obtain observations for the variable "distance between two consecutive nodes in a route". These observations are then fitted by a statistical distribution, which characterizes the inter-node distances in good solutions. Then, the fitted distribution is employed to generate a large number of new random solutions with similar edge-size distribution. Thus, a random but oriented local search of the space of solutions is performed, and a list of "best solutions" is obtained. This list allows considering several properties per solution, not only aprioristic costs, which can be practically used when making multiple-criteria decisions. Several tests have been performed to discuss the effectiveness of this approach.
Fast communication: Force-directed hybrid PSO-SNTO algorithm for acoustic source localization in sensor networks
Authors: Zhijun Yu, Jianming Wei, Haitao Liu
Venue: Signal Processing (2009)

As a smart combination of particle swarm optimization (PSO) and sequential number-theoretic optimization (SNTO), a new hybrid PSO-SNTO algorithm is proposed to handle the initialization dependence of basic PSO algorithm. We then apply the hybrid algorithm to the acoustic source localization problem in sensor networks, which is modeled as a maximum likelihood estimation problem. Furthermore, a heuristic method based on virtual force is used to direct the particles of PSO to the global optimum, which can efficiently speed up the algorithm convergence. Simulation results demonstrate that the hybrid algorithm can achieve robust convergence with sophisticated estimation performance, and the convergence rate can be largely enhanced with the assistance of the force-directed heuristics.
BEIRA: An Area-based User Interface for Map Services
Authors: Osamu Masutani, Hirotoshi Iwasaki
Venue: World Wide Web (2009)

This paper introduces BEIRA, an area-based map user interface for location-based contents. Recently, various web map services are widely used to search for location-based contents. However, browsing a large number of contents that are arranged on a map as points may be troublesome. We tackle this issue by using area-based representations instead of points. AOI (Area of Interest), which is core concept of BEIRA, is an arbitrary shaped area boundary with text summary information. With AOI, users can instantly grasp area characteristics without examining each point. AOI is deduced by performing geo-semantic co-clustering of location-based contents. Geo-semantic co-clustering takes both geographic and semantic features of contents into account. We confirm that the ratio of the geo-semantic blend is the key to deducing an appropriate boundary. We further propose and evaluate location-aware term weighting to obtain an informative summary.
Teaching security concepts using hands-on and open source products
Authors: Cristian Balan
Venue: Journal of Computing Sciences in Colleges (2009)

Today's undergraduate students are visual learners with a great aptitude for application of concepts. Short presentations and lectures interlaced with a great deal of hands-on activities is the preferred method of learning for many career oriented undergraduates. More so, students that are currently working in the IT field would like to learn skills that they can immediately apply to their work environment. Many students often ask about remote access and VPNs as a relevant need for companies in which they hold entry level IT positions. Students learn how to provide basic and advanced security for a small to medium size company to include firewall, intrusion detection and prevention, proxing, VPNs and implementing security policies. Some of the students have configured IPCop firewalls for small business in the Burlington area as a result of this class. Professor Balan teaches students how to setup profitable consulting business in network administration and information security field by using Open Source products. Professor Balan will be joined by some of his students in this presentation. The students will help participants get an IPCop firewall up and running and connected to the classroom network. Additionally, the participants will setup site-to-site and "road-warrior" VPNs. Professor Balan will discuss classroom techniques for teaching using hands-on activities and how to prompt students to ask pertinent questions about topics that lead to meaningful discussions and presentation on security topics. Professor Balan will use donated Pentium II systems that will be transformed into firewalls during the tutorial/workshop. Bringing a laptop to the tutorial is useful but not required.
Multi Site Cardiac Rehabilitation Programming for Residents of Northwestern Ontario
Authors: Gwen Third, Lori Marshall, Caterina Kmill, Catherine Collinson, Laurie Sherrington, Darlene Steven
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Northwestern Ontario (NWO), Canada is a geographical region with a landmass equivalent to the country of France. The region is comprised of approximately 250,000 residents with 50% residing in sparsely populated rural areas, each challenged by limited professional resources to provide health-based programs for their residents. In 2003, the Northwestern Ontario District Health Council (NWODHC) identified inequities in the delivery of Cardiac Services in NWO and made specific reference to the benefits of Cardiac Rehabilitation participation. Previously, these services were limited to patients living within the proximity of Thunder Bay Regional Health Sciences Centre (TBRHSC), the sole acute care referral centre. Given the prevalence of cardiac disease in NWO, it was imperative that a cost-effective means of ensuring regional access to this program be developed and evaluated. Through the use of telemedicine technology we have enabled this disadvantaged population to gain full access to a life-changing program.
Initial value technique for singularly perturbed two point boundary value problems using an exponentially fitted finite difference scheme
Authors: Mohan K. Kadalbajoo, Devendra Kumar
Venue: Computers Mathematics with Applications (2009)

In this paper, we present an approximate method (Initial value technique) for the numerical solution of quasilinear singularly perturbed two point boundary value problems in ordinary differential equations having a boundary layer at one end (left or right) point. It is motivated by the asymptotic behavior of singular perturbation problems. The original problem is reduced to an asymptotically equivalent first order initial value problem by approximating the zeroth order term by outer solution obtained by asymptotic expansion, and then this initial value problem is solved by an exponentially fitted finite difference scheme. Some numerical examples are given to illustrate the given method. It is observed that the presented method approximates the exact solution very well for crude mesh size h.
A framework for predictive dynamic temperature management of microprocessor systems
Authors: Omer Khan, Sandip Kundu
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The sustained push for performance, transistor count and instruction level parallelism has reached a point where IC thermal issues are at the forefront of design constraints. Many of the current systems deploy dynamic voltage and frequency scaling (DVFS) to address thermal emergencies. DVFS has certain limitations in terms of response lag, scalability and being reactive. On the other hand, several hardware based control theoretic schemes have been proposed to deliver optimal performance, but such schemes come at high cost and lack flexibility and scalability. In this paper, we present an alternative thermal monitoring and management system that utilizes software and hardware components, based on virtual machine concept. The proposed scheme delivers targeted, localized, and preemptive thermal management at low cost, adapts well to a multitasking environment, while delivering maximum performance under thermal stress.
Virtual genetic coding and time series analysis for alternative splicing prediction in C. elegans
Authors: Michele Ceccarelli, Antonio Maratea
Venue: Artificial Intelligence in Medicine (2009)

Motivation: Prediction of alternative splicing has been traditionally based on the study of expressed sequences, helped by homology considerations and the analysis of local discriminative features. More recently, machine learning algorithms have been developed that try avoid or reduce the use of a priori information, with partial success. Objective and method: With the aim of developing a fully automatic procedure of recognition of alternative splicing events based only on the genomic sequence, we first introduce a virtual genetic coding scheme to numerically modeling the information content of sequences in an effective way, then we use time series analysis to extract a fixed-length set of features from each sequence and finally we adopt a supervised learning method, namely the support vector machine, to predict alternative splicing events. Results: On the base of real C. elegans data, we show that it is possible within this purely numeric framework to obtain results better than the state of the art, without any explicit modeling of homology or positions in the splice site, nor any use of other local features. Conclusion: The virtual genetic coding together with time series analysis allows us to introduce an effective and powerful sequence coding scheme, that may be useful in various areas of genomics and transcriptomics.
Dualities for Constraint Satisfaction Problems
Authors: Andrei A. Bulatov, Andrei Krokhin, Benoit Larose
Venue: Complexity of Constraints: An Overview of Current Research Themes (2008)

In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality, and bounded treewidth duality.
Wireless-LAN Based Distributed Digital Lighting System for Digital Home
Authors: Xu Huaiyu, Su Ruidan, Jiang Linying, Jin Song
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The wireless-LAN-based distributed digital lighting system has been implemented for digital home. Effectiveness and reality of such a system that is composed of hardware system, software system and wireless LAN has been demonstrated in this paper. Although the digital lighting is distributed in the digital home, latency-free color-changing have become possible through Internet due to the server-client's flexible architecture. The efficiency of system is improved by applying Field Programming Gate Array (FPGA) is studied. How integrate the Software system, hardware system and Bluetooth to work effectively is also discussed. A wireless LAN based application through Internet for digital lighting is also realized and demonstrated.
A Novel Class of Zero-Correlation Zone Sequence Sets Constructed from a Perfect Sequence
Authors: Takafumi Hayashi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The present paper describes a method for the construction of a zero-correlation zone sequence set from a perfect sequence. Both the cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence sets are zero for phase shifts within the zero-correlation zone. These sets can be generated from an arbitrary perfect sequence, the length of which is the product of a pair of odd integers ((2n + 1)(2k + 1) for k ≥ 1 and n ≥ 0). The proposed sequence construction method can generate an optimal zero-correlation zone sequence set that achieves the theoretical bounds of the sequence member size given the size of the zero-correlation zone and the sequence period. The peak in the out-of-phase correlation function of the constructed sequences is restricted to be lower than the half of the power of the sequence itself. The proposed sequence sets could successfully provide CDMA communication without co-channel interference, or, in an ultrasonic synthetic aperture imaging system, improve the signal-to-noise ratio of the acquired image.
Diagonal tracks in FPGAs: a performance evaluation
Authors: Sumanta Chaudhuri
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This article presents the performance evaluation of two new diagonal routing tracks in FPGAs. We discuss the automatic detailed architecture generation issues and propose changes in the conventional placement and routing to suit these architectures better. We conduct a series of experiments on these architecture with MCNC Benchmarks, where key parameters are varied over practical ranges and we conclude that the results are well in accordance, as predicted by the theory.
New Multiclass Traffic Equilibrium Assignment Model with Similarity Measure
Authors: Xingdong Deng, Xiaoceng Wu, Jianmin Xu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

A novel user equilibrium traffic assignment model in view of the drivers' different familiar levels with the network is presented in this paper. In the model, drivers are divided into classes according as their knowledge about the network traffic condition and travel-decision characteristics are the same within each class, but differ among classes. Some new concepts, such as OD perceived cost and familiar level with the traffic condition, are introduced based on $\alpha-$cut of fuzzy set. The equilibrium principle is defined based on the similarity measure and can be regarded as a generalization of Wardrop's user equilibrium (UE). A proposed numerical example show that the new model obtains more realistic results than the other two models, UE and SUE.
Authoring and Viewing Video Documents Using an SGML Structure
Authors: A. Chakraborty, P. Liu, L. Hsu
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In recent years, videos have become immensely popular. They are being generated at an enormous rate everyday. To be able to use this information in a meaningful way in conjunction with all the other media types, i.e. text, images, audio etc., it is important to segment and structure the video and to create appropriate links between objects in different sections of a video and pertinent information in other media forms. This enables the users to view relevant information from a video sequence regarding a particular object within the context of a much larger multimedia document. In this paper we describe a novel system for structuring video based on their content and creating and navigating links between objects of interest in the video and related information elsewhere.
Design of a 26GHz Phase-Locked Frequency Synthesizer in 0.13um CMOS
Authors: Chen Yueyang, Zhong Shun'an, Dang Hua
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A 26GHz Phase-Locked Frequency Synthesizer in 0.13um CMOS process is designed. This frequency synthesizer generates quadrature outputs at 26GHz. The PLL utilizing a QVCO with tuning range from 23.75GHz to 28.25GHz can be locked from 24GHz to 28GHz. The power consumption of the circuit is 34mW with a power supply of 1.2V. The phase noise of the QVCO is -95dBc/Hz at 1MHz offset and the Q-mismatch is 1.7°. Circuits are simulated by Cadence Spectre in 0.13μm Standard CMOS Process.
Universal algebra and hardness results for constraint satisfaction problems
Authors: Benoît Larose, Pascal Tesson
Venue: Theoretical Computer Science (2009)

We present algebraic conditions on constraint languages @C that ensure the hardness of the constraint satisfaction problem CSP(@C) for complexity classes L, NL, P, NP and Mod"pL. These criteria also give non-expressibility results for various restrictions of Datalog. Furthermore, we show that if CSP(@C) is not first-order definable then it is L-hard. Our proofs rely on tame congruence theory and on a fine-grain analysis of the complexity of reductions used in the algebraic study of CSP. The results pave the way for a refinement of the dichotomy conjecture stating that each CSP(@C) lies in P or is NP-complete and they match the recent classification of [E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining Schaefer's theorem, in: Proc. 30 th Math. Found. of Comp. Sci., MFCS'05, 2005, pp. 71-82] for Boolean CSP. We also infer a partial classification theorem for the complexity of CSP(@C) when the associated algebra of @C is the full idempotent reduct of a preprimal algebra.
Approximating the Number of Network Motifs
Authors: Mira Gonen, Yuval Shavitt
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

World Wide Web, the Internet, coupled biological and chemical systems, neural networks, and social interacting species, are only a few examples of systems composed by a large number of highly interconnected dynamical units. These networks contain characteristic patterns, termed network motifs, which occur far more often than in randomized networks with the same degree sequence. Several algorithms have been suggested for counting or detecting the number of induced or non-induced occurrences of network motifs in the form of trees and bounded treewidth subgraphs of size O(logn), and of size at most 7 for some motifs. In addition, counting the number of motifs a node is part of was recently suggested as a method to classify nodes in the network. The promise is that the distribution of motifs a node participate in is an indication of its function in the network. Therefore, counting the number of network motifs a node is part of provides a major challenge. However, no such practical algorithm exists. We present several algorithms with time complexity $O\left(e^{2k}k\cdot n \cdot |E|\cdot \right.$ $\left.\log\frac{1}{\delta}/{\epsilon^2}\right)$ that, for the first time, approximate for every vertex the number of non-induced occurrences of the motif the vertex is part of, for k-length cycles, k-length cycles with a chord, and (k&thinsp;&minus;&thinsp;1)-length paths, where k&thinsp;=&thinsp;O(logn), and for all motifs of size of at most four. In addition, we show algorithms that approximate the total number of non-induced occurrences of these network motifs, when no efficient algorithm exists. Some of our algorithms use the color coding technique.