ppxscal/embedding_network huggingface dataset:
A modified VNS metaheuristic for max-bisection problems
Authors: Ai-fan Ling, Cheng-xian Xu, Le Tang
Venue: Journal of Computational and Applied Mathematics (2008)

Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033-1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile that VNS metaheuristic is extended to solve max-bisection problems. Unfortunately, comparing with max-cut problems, max-bisection problems have more complicated feasible region via the linear constraint e^Tx=0. It is hard to directly apply the typical VNS metaheuristic to deal with max-bisection problems. In this paper, we skillfully combine the constraint e^Tx=0 with the objective function, obtain a new optimization problem which is equivalent to the max-bisection problem, and then adopt a distinct greedy local search technique to the resulted problem. A modified VNS metaheuristic based on the greedy local search technique is applied to solve max-bisection problems. Numerical results indicate that the proposed method is efficient and can obtain high equality solution for max-bisection problems.
Inspiring blind high school students to pursue computer science with instant messaging chatbots
Authors: Jeffrey P. Bigham, Maxwell B. Aller, Jeremy T. Brudvik, Jessica O. Leung, Lindsay A. Yazzolino, Richard E. Ladner
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Blind students are an underrepresented group in computer science. In this paper, we describe our experience preparing and leading the computer science track at the National Federation of the Blind Youth Slam. As part of this workshop, fifteen blind high school students created and personalized instant messaging chatbots, a project designed to be completely accessible to blind students. Chatbots enable students to infuse their own personalities into a socially-oriented program that incorporates ideas from artificial intelligence, natural language processing, and web services. We first outline the chatbots project and curriculum, which has wide appeal for all students, and then offer general design principles used to create it that can help ensure the accessibility of future projects. Students created their chatbots using a real programming language and were guided by both blind and sighted mentors. By programming from the start in a supportive environment, our students will gain the confidence to persevere in computer science in the future.
Measuring data-driven ontology changes using text mining
Authors: Majigsuren Enkhsaikhan, Wilson Wong, Wei Liu, Mark Reynolds
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Most current ontology management systems concentrate on detecting usage-driven changes and representing changes formally in order to maintain the consistency. In this paper, we present a semi-automatic approach for measuring and visualising data-driven changes through ontology learning. Terms are first generated using text mining techniques using an ontology learning module, and then classified automatically into clusters. The clusters are then manually named, which is the only manual process in this system. Each cluster is considered as a sub-concept of the root concept, and thus one dimension of the feature space describing the root concept. The changes of terms in each cluster contributes to the change of the root concept. Using our system, Web documents are collected at different time periods and fed into the system to generate different versions of the same ontology for each time period. The paper presents several ways of visualising and analysing the changes. Initial experiments on online media data have demonstrated the promising capabilities of our system.
Markov chains and polynomial time algorithms
Authors: R. Kannan
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets.
A simulated annealing-based optimization approach for integrated process planning and scheduling
Authors: W. D. Li, C. A. McMahon
Venue: International Journal of Computer Integrated Manufacturing (2007)

A job shop needs to deal with a lot of make-to-order business, in which the orders are usually diverse in types but each one is small in volume. To increase the flexibility and responsiveness of the job shop in the more competitive market, process planning and scheduling modules have been actively developed and deployed. The functions of the two modules are usually complementary. It is ideal to integrate them more tightly to achieve the global optimization of product development and manufacturing. In this paper, a unified representation model and a simulated annealing-based approach have been developed to facilitate the integration and optimization process. In the approach, three strategies, including processing flexibility, operation sequencing flexibility and scheduling flexibility, have been used for exploring the search space to support the optimization process effectively. Performance criteria, such as makespan, the balanced level of machine utilization, job tardiness and manufacturing cost, have been systematically defined to make the algorithm adaptive to meet various practical requirements. Case studies under various working conditions and the comparisons of this approach with two modern evolutionary approaches are given. The merits and characteristics of the approach are thereby highlighted.
On end degrees and infinite cycles in locally finite graphs
Authors: Henning Bruhn, Maya Stein
Venue: Combinatorica (2007)

We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel and K&#x00fc;hn [4, 5], which allows for infinite cycles, we prove that the edge set of a locally finite graph G lies in C(G) if and only if every vertex and every end has even degree. In the same way we generalise to locally finite graphs the characterisation of the cycles in a finite graph as its 2-regular connected subgraphs.
Comparison study of two kernel-based learning algorithms for predicting the distance range between antibody interface residues and antigen surface
Authors: Yong Shi, Jia Wan, Xinyang Zhang, Gang Kou, Yi Peng, Yajun Guo
Venue: International Journal of Computer Mathematics (2007)

A number of kernel-based machine algorithms have recently been used to study protein-protein interaction in the field of bioinformatics. In this paper we develop a kernel-based machine algorithm called multiple criteria quadratic programming (MCQP) to predict the distance range between antibody interface residues and the antigen surface in antigen-antibody complex. Antibodies bind their antigen using residues, which are part of the hypervariable loops. In this paper we explore the interaction between antibody interface residues and antigen in the study of antibody functions. The distance between the antibody's interface residue and the antigen surface is one of the antigen-antibody binding characteristics used to observe the details of the antibody-antigen interaction surface. The results predicted by MCQP are compared with those predicted by the support vector machine (SVM). The MCQP algorithm classifies observations into distinct groups based on a number of criteria via a hyperplane. MCQP shows strong advantages for distances of 8 Å and 10 Å. However, SVM gives better results for a distance of 12 Å.
Simulation and Analysis of Delay Handling Mechanisms in Sensor Networks
Authors: Dimitris K. Tasoulis, Niall M. Adams, David J. Hand
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Distributed sensor networks have found numerous real life applications. However the endemic ambiguity of real environments can disrupt the communication such that measurements arrive late at the active agent responsible for estimating the dynamics of the measured phenomenon. In this paper we simulate different types of delays and demonstrate the merit of using algorithms that choose to fuse only those delayed measurements that are expected to have considerable utility for the estimation procedure. Simulated results suggest that this approach can lead to energy savings since extra communication steps are avoided. There is also a strong implication that protocols for sensor networks should be coupled with the estimation procedure to facilitate packet-routing based on estimation performance.
Strengthening the pen computing community
Authors: Andrew Forsberg
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

The fledgling pen computing community is 40 years old and except for small applications and text entry on PDA-like devices, pen interfaces and computing are generally still a curiosity. By some estimates, it takes 30 years for technologies (e.g., the mouse and GUI) to transfer from the lab to popular use. Are there changes we can make within the community to accelerate progress?
Model-typed component interfaces
Authors: Gernot Schmölzer, Egon Teiniker, Christian Kreiner
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Component based software engineering (CBSE) allows to design and develop reusable software components that can be assembled to construct software systems via well defined interfaces. However, designing such reusable components for data intensive business logic often requires heavy data transfer between components over interfaces. Static interface definitions using basic data types or structures of such lead to large interfaces susceptible to modifications. The goal of this paper is to present model-typed interfaces based on generic interface parameters, which allows to transfer complex structured data between components. Providing such generic, model-defined types (MDT) with data models specifying the parameter structure supports compatibility checks of model-typed interfaces at platform independent system design time. The methodology is described platform independently and the coherency with our system development process is discussed. Moreover, a technology mapping to IDL and the CORBA component model (CCM) is illustrated.
Spatio-temporal analysis of multi-date IRS imageries for turtle habitat dynamics characterization at Gahirmatha coast, India
Authors: G. Prusty, S. Dash, M. P. Singh
Venue: International Journal of Remote Sensing (2007)

This paper reports the conceptualization of a remote sensing based technique to map the spatio-temporal change pattern of the coastal landforms of Gahirmatha, India, the world's biggest olive ridley sea turtle rookery. Twenty-seven Indian Remote-sensing Satellite (IRS) multispectral satellite images sampled between the period 1988-2001 are the basic input for the study. While the mapping of temporal change position of the landform centroids revealed the migrational behaviour of the landforms, the tide normalized change detection indicated the habitat surface area dynamics. The analysis revealed that the Ekakula spit of Gahirmatha estuary has undergone cyclone-induced mass erosion during its 14 years' evolutionary history, thereby destroying its nesting habitat. However, the Nasi barrier bar had shifted its position by about 6.85 km without significant change in geo-environment including surface area and hence continued to be the favourable site for turtles' mass nesting. The results have aided in understanding the impact of natural processes on the nesting habitat dynamics.
From the front linesSoftware development amidst the whiz of silver bullets
Authors: Alex E. Bell
Venue: Communications of the ACM (2008)

Software development organizations must accept the inevitability of silver-bullet solution proposals and devise strategies to defend against them.
Dynamic complexities of a predator-prey model with generalized Holling type III functional response and impulsive effects
Authors: Hua Su, Binxiang Dai, Yuming Chen, Kaiwang Li
Venue: Computers Mathematics with Applications (2008)

Based on the predator-prey (natural enemy-pest) system with generalized Holling type III functional response, an impulsive differential system to model the processes of periodically releasing natural enemies and spraying pesticides at different fixed times for pest control is proposed and investigated. It is shown that if the impulsive period is less than a threshold then the pest-eradication periodic solution is globally asymptotically stable; otherwise the system is permanent. When the system is permanent, further influences of the impulsive perturbations are studied by numerical simulation. Numerical simulation indicates that the system may have complex dynamics.
Design and implementation of a misused intrusion detection system using autonomous and mobile agents
Authors: Dalila Boughaci, Kamel Ider, Sofiane Yahiaoui
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

This paper proposes a distributed intrusion detection system based on autonomous and mobile agents. The proposed system has four types of agents: connection agents, analyser agents, an administrator agent and a crisis agent. The system makes use of a Sniffer module to capture packets circulated on the network. A pattern matching approach is applied by the analyzer agents to scan the captured packets and detect eventual attacks. A prototype has been designed and implemented.
A weighted layered broadcasting scheme for scalable video transmission with multiple site reception
Authors: Thomas Stockhammer, Tiago Gasiba, Wissam Abdel Samad, Wen Xu, Hrvoje Jenkac, Thomas Schierl
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

The integration of reliable Video-on-Demand (VoD) broadcasting schemes in mobile datacast systems, specifically in DVB-h, is studied and enhanced. Sophisticated VoD broadcasting schemes such as Harmonic Broadcasting (HB) allow receivers to tune into the ongoing transmission of a video-stream at arbitrary time, while still being able to receive the multimedia sequence from beginning to end, after short initial playout latency. In addition, we address service enhancements by using scalable video coding (SVC) to support heterogeneous receiver capabilities and receiving conditions as well as signal reception from multiple transmission sites. We present and discuss options for the integration of VoD broadcasting schemes in combination with fountain codes. Optimizations in parameter selection are introduced. A realistic protocol environment is only slightly modified to support our system concept. Simulation results show the benefits of the discussed VoD scheme compared to existing approaches if integrated in DVB-h.
A High-Performance Wireless Sensor Node for Industrial Control Applications
Authors: Michele Paselli, Frederik Petré, Olivier Rousseaux, Guy Meynants, Bert Gyselinckx, Marc Engels, Luca Benini
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we present the design of a modular wireless sensor node for industrial control applications. The project seeks to demonstrate the feasibility of wireless communication between fixed and moving parts of industrial machines, which impose challenging latency requirements on the communication link. Other important requirements are in terms of processing capability, low power consumptions and modularity, which cannot be fulfilled by existing hardware. Therefore a complete new platform has been designed, including a high-performance ARM microntroller, a WiMedia compliant radio module, a general-purpose sensor connector and a Programmable System on Chip (PSoC). The ARM microntroller embeds a high preprocessing capability within the sensor node, while the WiMedia radio, that sets our platform apart from other existing solutions, allows to have a very low communication latency. The software architecture of the sensor node is based on eCos, an embedded, configurable and real-time operating system. Its realtime nature guarantees to fulfill the latency requirements at software side, and its high configurability enables to easily adapt the node to various types of industrial machines. A complete set of drivers has been developed to port the new platform to the operating system, in particular as for the radio module, the sensor, and the power management. Our platform has finally been tested with an industrial-like application, proving the feasibility of controlling an automatic machine with a wireless system.
End-to-End Security Across Wired-Wireless Networks for Mobile Users
Authors: Sherali Zeadally, Nicolas Sklavos, Moganakrishnan Rathakrishnan, Scott Fowler
Venue: Information Systems Security (2007)

Recent advances in mobile computing and wireless communication technologies are enabling high mobility and flexibility of anytime, anywhere service access for mobile users. As a result, network connections of such users often span over heterogeneous networking environments consisting of wired and wireless networking technologies. Both network heterogeneity and user mobility make the securing of data transmission over heterogeneous networks challenging and complex. In this paper, we focus on the challenge of providing secure end-to-end network transmissions to wireless mobile users. To minimize service interruption during ongoing secure sessions of mobile users, we present the design and implementation of an approach based on the well-known Internet Protocol Security (IPSec) standard. We conducted a performance evaluation of our implementation using a Voice over IP (VoIP) application over an actual network testbed. Our empirical performance results demonstrate a packet loss improvement of 17% to 34% (for various VoIP packet sizes) and a handoff delay improvement of almost 24% validating the high efficiency of our proposed approach.
Lights...camera...computer science: using films to introduce computer science to non-majors
Authors: Darren Lim
Venue: Journal of Computing Sciences in Colleges (2008)

This paper describes a one-credit film course featuring movies that involve many aspects of computer science. This course was designed to introduce computer science to non-major students in an unconventional fashion. Using films, as well as a selection of inclass viewings, discussions and activities, students were exposed to diverse areas of computer science, such as computer animation, computer security, artificial intelligence, bioinformatics, and gender issues.
Hybrid conjugate gradient methods for unconstrained optimization
Authors: Jiangtao Mo, Nengzhu Gu, Zengxin Wei
Venue: Optimization Methods Software (2007)

In this paper we propose two kinds of conjugate gradient methods for unconstrained optimization, based on the combinations of the presented conjugate gradient methods. The methods can be regarded as the modifications of the efficient hybrid methods proposed by Touati-Ahmed-Storey and Dai-Yuan. Under mild conditions, globally convergent results are proved. Primary numerical results of the new methods are encouraging.
Letters: A neural networks learning algorithm for minor component analysis and its convergence analysis
Authors: Dezhong Peng, Zhang Yi, JianCheng Lv, Yong Xiang
Venue: Neurocomputing (2008)

The eigenvector associated with the smallest eigenvalue of the autocorrelation matrix of input signals is called minor component. Minor component analysis (MCA) is a statistical approach for extracting minor component from input signals and has been applied in many fields of signal processing and data analysis. In this letter, we propose a neural networks learning algorithm for estimating adaptively minor component from input signals. Dynamics of the proposed algorithm are analyzed via a deterministic discrete time (DDT) method. Some sufficient conditions are obtained to guarantee convergence of the proposed algorithm.
Design of a mask-programmable memory/multiplier array using G4-FET technology
Authors: Jay Brockman, Sheng Li, Peter Kogge, Amit Kashyap, Mohammad Mojarradi
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

A G4-FET is a 4 gate transistor that combines both JFET and MOS characteristics in a single device that may be fabricated in a standard silicon-on-insulator (SOI) process. In doing so, it enables the conducting channel to be controlled vertically through MOS gates, as well as horizontally, through junction gates. Further, depending upon how it is biased, a single G4-FET can serve as either a not-majority logic gate or as a charge storage-based memory cell. This unique device offers tremendous potential for innovative gate arrays, where real estate can be traded-off between logic and memory functions. In this paper, we take a first look at a mask-programmable G4-FET array that depending upon metal personalization, can function either as a DRAM array or a multiplier.
Note on graphs without repeated cycle lengths
Authors: Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve
Venue: Journal of Graph Theory (1998)

In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most $n + \sqrt{2(n - 2)} - 1$ edges and we show this result is best possible with the correct order of magnitude on $\sqrt{n}$. The 2-connected case is also used to give a quick proof of Lai's result on the general case. &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 11&ndash;15, 1998
A modeling approach and reference models for the analysis of mobile payment use cases
Authors: Key Pousttchi
Venue: Electronic Commerce Research and Applications (2008)

Mobile payments can be categorized according to their usage in each of the five payment scenarios presented here. The paper proposes the mobile payment modeling approach (MPMA) especially suited for value-based analysis of mobile payment use cases. Based on this approach, the study also develops a set of seven reference models that can classify any given mobile payment use case or mobile payment procedure and analyze it with regard to the business model, the roles of the market participants, and their interrelation from a value-based perspective. An introspective analysis of the mobile payment service provider role and a market constellation analysis which shows the implications of different actors assuming one or more of the respective roles complete the study.
193nm interference nanolithography based on SPP
Authors: Wei Xiong, Jinglei Du, Liang Fang, Xiangang Luo, Qiling Deng, Chunlei Du
Venue: Microelectronic Engineering (2008)

Large-area surface plasmon polariton interference lithography (LSPPIL) is a promising nano-fabrication technique for making periodic nano-patterns. In this paper, for reducing further the feature size of a lithography pattern, we propose to use 193nm illumination wavelength in LSPPIL and replace the silver coating by tungsten. Theoretical analysis and preliminary numerical simulations indicate that 193nm-LSPPIL can produce periodic patterns with a critical dimension as small as 30nm with high contrast and enough long exposure depth. 193nm interference nanolithography based on SPP has the potential to realize the 32nm node periodic nano-structure manufacture.