ppxscal/embedding_network huggingface dataset:
Providing middleware support for the control and co-ordination of telecom mashups
Authors: Nilanjan Banerjee, Koustuv Dasgupta, Sougata Mukherjea
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

The emerging Web 2.0 marketplace presents an important opportunity for Telecom operators to sell their own capabilities and content as services. Operators have a wealth of content associated with their network as well as core network enablers, e.g. call control, presence and messaging, which could serve as potential new revenue streams in a Web 2.0 world. Moreover, with the looming threat from Internet companies, there is an increasing need for operators to make both core and value-added functions reusable and mashable. To this end, operators are gradually embracing the IP Multimedia Subsystem (IMS) and looking at developing next-generation of SIP-based applications that can be mashed up in innovative ways. However, to do so, IMS/SIP-based services need to be empowered with the necessary co-ordination capabilities required in a mashup environment. This, in turn, implies protocol-level control to be rendered to the mashup developer - an issue that has not been sufficiently addressed by the community. We highlight the need for middleware support in facilitating the co-ordination of Telecom mashups, and describe an architecture that provides the necessary runtime control and mediation in an IMS-based operator network.
ROI Boundary Detection Based on Geometric Active Contour Model in X-ray Skeletal Image
Authors: Chuangxin Wang, Yiyan Ye, ZhongYun Lie
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

By utilizing the iterative solutions based on the level set method, the geometric active contour model (GACM) can be used to detect image boundaries and then solve the question of topology variation in curve evolution effectively, therefore, we adopt the GACM to investigate the boundary detection of digital X-ray skeletal images. According to the characteristics of medical images, we present an improved Chan-Vese method which combines regional information with image gradient information to increase the boundary detection capability. Theoretically speaking, the improved method can guarantee not only the speed and robustness of image division but also the accuracy of target extraction from the medical image background with abundant boundary layers. In practice, this method is proved to detect the boundaries of the epiphysis /metaphyseal regions of interest (EMROI) in X-ray skeletal images effectively and clearly.
Flock Inspired Area Coverage Using Wireless Boid-Like Sensor Agents
Authors: Colin Chibaya, Shaun Bangay
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Simulated flocking is achievable using three boid rules [13]. We propose an area coverage model inspired by Reynolds’ flocking algorithm, investigating strategies for achieving quality coverage using flocking rules. Our agents are identical and autonomous, using only local sensory information for indirect communication. Upon deployment, agents are in the default separation mode. The cohesion rule would then guarantee that agents remain within the swarm, covering spaces with explored neighbour spaces. Four experiments are conducted to evaluate our model in terms of coverage quality achieved. We firstly investigate agents’ separation speed before the speed with which isolated agents re-organizes is investigated. The third experiment compares coverage quality achieved using our model with coverage quality achieved using random guessing. Finally, we investigate fault tolerance in the event of agents’ failures. Our model exhibits good separation and cohesion speed, achieving high quality coverage. Additionally, the model is fault tolerant and adaptive to agents’ failures.
AreWeThereYet?: a temporally aware media player
Authors: Matt Adcock, Jaewoo Chung, Chris Schmandt
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

In this paper we describe the design and implementation of the AreWeThereYet? (AWTY) Player - a (digital) audio player that composes a program of audio media that is extremely likely to fit within the user's available listening time. AWTY uses time compression and track selection techniques to help the listener make more efficient use of their time. More importantly, it possesses an awareness of the listener's temporal context. It forms an estimate of the available listening time and uses this prediction to compose a playlist of a suitable length. We hope that this research prototype will inspire others to further investigate the ways in which temporally aware computing might be employed.
Adaptive Voting Algorithms for Reliable Dissemintation of Data in Sensor Networks
Authors: Kaliappa Ravindran, Jiang Wu, Kevin A. Kwiat, Ali Sabbir
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A real-time data collection system in sensor network settings requires dealing with failures in the network and in the external environment: ~such as data corruptions by malicious devices and message timeliness violations in the network. Functional replication is employed to deal with such failures, with voting among the replica devices to move a correctdata to the end-user. The goal of our paper is to develop a voting system that dynamically adapts its internal mechanisms to deal with various types of failures. Thepaper presents the design issues, with considerations of protocol correctness and performance. A goal is to reduce the message overhead --- and hence the power drain on wireless connected sensor devices.
Detecting Bots Based on Keylogging Activities
Authors: Yousof Al-Hammadi, Uwe Aickelin
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A bot is a piece of software that is usually installed on an infected machine without the user’s knowledge. A bot is controlled remotely by the attacker under a Command and Control structure. Recent statistics show that bots represent one of the fastest growing threats to our network by performing malicious activities such as email spamming or keylogging. However, few bot detection techniques have been developed to date. In this paper, we investigate a behavioural algorithm to detect a single bot that uses keylogging activity. Our approach involves the use of function calls analysis for the detection of the bot with a keylogging component. Correlation of the frequency of function calls made by the bot with other system signals during a specified time-window is performed to enhance the detection scheme. We perform a range of experiments with the spybot. Our results show that there is a high correlation between some function calls executed by this bot which indicates abnormal activity in our system.
On connected area coverage sets in wireless sensor networks
Authors: David Q. Liu
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Wireless Sensor Networks consist of small senor nodes with limited battery and processing capability. During any time, a number of senor nodes must be kept active to sense the covered area and maintain the connectivity to the base station. This paper addresses the minimum connected area coverage set problem with equal sensing and communicating radii. With location information of its neighbor, each node selects minimum number of its neighbor nodes as sensing and forwarding nodes to cover the sensing area of itself and all its neighbors and guarantee the connectivity to all its two-hop neighbors. After exchanging the sensing and forwarding node set with its neighbors, each node decides whether it should be active. The active sensor nodes together guarantee area coverage and connectivity. The proposed algorithm is fully localized with O(nlogn) time complexity and O(n) message complexity where n is the maximum number of neighbors.
A Simplified IDEA Algorithm
Authors: Nick Hoffman
Venue: Cryptologia (2007)

In this article, a simplified version of the International Data Encryption Algorithm (IDEA) is described. This simplified version, like simplified versions of DES [8-128, 9, 10, 11, 12] and AES [6, 7] that have appeared in print, is intended to help students understand the algorithm by providing a version that permits examples to be worked by hand. IDEA is useful teaching tool to help students bridge the gap between DES and AES.
Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding
Authors: Chuan Wu, Baochun Li, Zongpeng Li
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

In peer-to-peer (P2P) live streaming applications such as IPTV, it is natural to accommodate multiple coexisting streaming overlays, corresponding to channels of programming. In the case of multiple overlays, it is a challenging task to design an appropriate bandwidth allocation protocol, such that these overlays efficiently share the available upload bandwidth on peers, media content is efficiently distributed to achieve the required streaming rate, as well as the streaming costs are minimized. In this paper, we seek to design simple, effective and decentralized strategies to resolve conflicts among coexisting streaming overlays in their bandwidth competition, and combine such strategies with network coding based media distribution to achieve efficient multi-overlay streaming. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers bid for upload bandwidth at the upstream peers for the delivery of coded media blocks. With extensive theoretical analysis and performance evaluation, we show that these local games converge to an optimal topology for each overlay in realistic asynchronous environments. Together with network coding based media dissemination, these streaming overlays adapt to peer dynamics, fairly share peer upload bandwidth to achieve satisfactory streaming rates, and can be prioritized.
Waste makes haste: tight bounds for loose parallel sorting
Authors: T. Hagerup, R. Raman
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take Omega (log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more 'wasteful' convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1+o(1))n. The authors give very fast randomised CRCW PRAM algorithms for several padded-sorting problems. Applying only pairwise comparisons to the input and using kn processors, where 2
How to Optimize the Cryptographic Symmetric Primitives on Loongson-2E Microprocessor
Authors: Yong Liu, Zhong Chen, Yu Chen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The Loongson project is the first attempt to design high performance general purpose microprocessors in China. It implements a four-issue general purpose RISC microprocessor based on 64-bit MIPS instruction set. Loongson-2E is the latest version of the project. High performance is an important design criterion for Cryptographic symmetric primitives (include block ciphers and hash functions). This is the first paper which discusses how to optimize AES-128, SHA-256, SHA-512 and Whirlpool algorithms on Loongson-2E. Our programs are, to our best knowledge, the fastest implementations on Loongson-2E. This paper also proposed several new instructions for speedup symmetric primitives and a parallel hash function mode.
Computationally Optimised DNA Assembly of synthetic genes
Authors: Liza S. Z. Larsen, Christopher D. Wassman, G. Wesley Hatfield, Richard H. Lathrop
Venue: International Journal of Bioinformatics Research and Applications (2008)

Gene synthesis is hampered by two obstacles: improper assembly of oligonucleotides; oligonucleotide defects incurred during chemical synthesis. To overcome the first problem, we describe the employment of a Computationally Optimised DNA Assembly (CODA) algorithm that uses the degeneracy of the genetic code to design overlapping oligonucleotides with thermodynamic properties for self-assembly into a single, linear, DNA product. To address the second problem, we describe a hierarchical assembly strategy that reduces the incorporation of defective oligonucleotides into full-length gene constructs. The CODA algorithm and these biological methods enable fast, simple and reliable assemblies of sequence-correct full-length genes.
Operation analysis of a reservoir in GIS environment using remote sensing inputs
Authors: M. K. Goel, P. Kumar, S. K. Jain, R. S. Tiwari
Venue: International Journal of Remote Sensing (2007)

Reservoir management involves allocating available water among multiple uses and users, minimizing the risks of water shortages and flooding and optimizing the beneficial use of water. Irrigation demands from a reservoir, which are generally computed by using the design cropping pattern and average rainfall conditions, may vary over the years depending on the actual cropping pattern and meteorological conditions. This study demonstrates the utility of remote sensing inputs and geographic information system (GIS) environment for determining realistic irrigation demands from a reservoir. Remote sensing data are used to map the actual cropping pattern in the command area while the GIS is used for integrating the field-level irrigation demands up to the canal system head. Ten daily irrigation demands in the command area of Samrat Ashok Sagar Reservoir in Madhya Pradesh, India have been estimated and the reservoir operation policy has been derived. Through the simulation analysis with 29 years of inflow data, rule curves have been derived for the operation of reservoir so that water deficit (if any) can be distributed in time much in advance and severe crop failure can be avoided. Inferences drawn from the analysis can guide the system operator in using the available water in a scientific and judicious manner.
Arabic Script Documents Language Identifications Using Fuzzy ART
Authors: Ali Selamat, Ng Choon Ching
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The volume of information available on the internet, digital libraries and newsgroup has increased dramatically in recent years. Therefore, there is a growing interest in helping user better find, filter, and manage these resources. Language identification is the first step of understanding text documents which is written in. It is usually a module within multilingual application. In this paper, we introduce language identification of Arabic script documents by letter frequency. Technique used for identification is fuzzy adaptive resonance theory (ART), which is belong to the neural network architectures that perform incremental unsupervised learning. Arabic script documents such as Arabic, Persian and Urdu were used for performing language identification. From the experiments, we have found that fuzzy ART is particularly promising in terms of accuracy on language identification.
A novel approach to K-12 CS education: linking mathematics and computer science
Authors: Mindy Hart, James P. Early, Dennis Brylow
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

This paper describes a continuing series of summer workshops hosted by Purdue University entitled "Linking Mathematics and Computer Science." Each is designed to inform and inspire high school teachers of mathematics with an interest in computer science. Originally conceived as an extension of our existing K-12 outreach, our workshop aims to provide teachers with innovative activities and ideas that link their secondary school mathematics curriculum with computer science. By reaching out to high school math teachers, we hope to in turn reach a broader base of students outside of computer science classes. By fostering interest in this broader audience, we can increase the number of students entering undergraduate computer science programs, and reach a larger segment of underrepresented populations.
An information security ethics education model
Authors: Melissa Dark, Nathan Harter, Linda Morales, Mario A. Garcia
Venue: Journal of Computing Sciences in Colleges (2008)

This paper proposes a model for teaching information assurance ethics. The model is composed of four dimensions: the moral development dimension; the ethical dimension; the security dimension; and the solutions dimension. The ethical dimension explores the ethical ramifications of a topic from a variety of perspectives. The security dimension includes ways in which an information assurance topic manifests to information assurance professionals. The solutions dimension focuses on remedies that individuals, groups of individuals and society have created to address security problems and associated ethical dilemmas. The moral development dimension describes the stages and transitions that humans experience as they develop morally, as they develop their own personal beliefs and behaviors about right and wrong.
A fast congestion estimator for routing with bounded detours
Authors: Lerong Cheng, Xiaoyu Song, Guowu Yang, William N. N. Hung, Zhiwei Tang, Shaodi Gao
Venue: Integration, the VLSI Journal (2008)

Congestion estimation is an important issue for design automation of the VLSI layout. Fast congestion estimation provides an efficient means to adjust the placement and wire planning. A probabilistic model of interconnections enables designers to quickly predict routing congestion. We propose a powerful and fast estimation approach that allows wires to have bounded-length detours to bypass congestions. The method is more realistic and precise than the previous work. The experimental results demonstrate the effectiveness of the method on routing benchmarks.
Relations as an abstraction for BDD-based program analysis
Authors: Ondřej Lhoták, Laurie Hendren
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

In this article we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as database-style relations and operations on relations, and provides static type rules to ensure that relational operations are used correctly. The article provides a description of the Jedd language and reports on the design and implementation of the Jedd translator and associated runtime system. Of particular interest is the approach to assigning attributes from the high-level relations to physical domains in the underlying BDDs, which is done by expressing the constraints as a SAT problem and using a modern SAT solver to compute the solution. Further, a runtime system is defined that handles memory management issues and supports a browsable profiling tool for tuning the key BDD operations. The motivation for designing Jedd was to support the development of interrelated whole program analyses based on BDDs. We have successfully used Jedd to build Paddle, a framework of context-sensitive program analyses, including points-to analysis and call graph construction, as well as several client analyses.
Reconfigurable computing using content addressable memory for improved performance and resource usage
Authors: Somnath Paul, Swarup Bhunia
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Conventional FPGA architectures leverage on the spatial computing model where the design to be realized is represented in the form of multi-input single-output lookup tables (LUTs). However, such a model incorporates a reconfigurable interconnect network which leads to significant design overhead and poor scalability with process technology. In this paper, we propose a multi-cycle Memory Based Computational methodology that utilizes Content Addressable Memory (CAM) as the underlying reconfigurable fabric. The use of CAM in the proposed framework leads to significant reduction in memory requirement compared to LUT-based approach. Simulation results for standard benchmark circuits indicate that the proposed CAM based implementation improves the memory requirement significantly compared to its LUT counterpart, at the cost of little or no degradation in performance.
Semi-supervised spam filtering: does it work?
Authors: Mona Mojdeh, Gordon V. Cormack
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

The results of the 2006 ECML/PKDD Discovery Challenge suggest that semi-supervised learning methods work well for spam filtering when the source of available labeled examples differs from those to be classified. We have attempted to reproduce these results using data from the 2005 and 2007 TREC Spam Track, and have found the opposite effect: methods like self-training and transductive support vector machines yield inferior classifiers to those constructed using supervised learning on the labeled data alone. We investigate differences between the ECML/PKDD and TREC data sets and methodologies that may account for the opposite results.
Strong QoS and Collision Control in WLAN Mesh and Ubiquitous Networks
Authors: Chi-Hsiang Yeh, Richard Wu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Quality of service (QoS) provisioning is critical to real-time applications such as VOIP and IPTV, but has not been resolved in multihop networks such as mesh and ad hoc networks. For multiple access in ubiquitous networks, energy efficiency is of the single most important design goal, and can be supported through power save and power control techniques. In this paper, we propose a class of MAC protocols based on binary countdown for strong differentiation capability and energy efficiency. A unique advantage for this class of protocols is that the collision rate can be significantly reduced or virtually eliminated. This collision rate issue is often ignored in QoS MAC and sensor MAC protocol designs, but is in fact indispensable for QoS and energy-efficient MAC since service quality will be otherwise considerably degraded due to exponentially increased backoff delay, and energy will be wasted unnecessarily.
A linear vizing-like relation between the size and the domination number of a graph
Authors: Dieter Rautenbach
Venue: Journal of Graph Theory (1999)

We prove m &le; &Delta;n - (&Delta; + 1)&gamma; for every graph without isolated vertices of order n, size m, domination number &gamma; and maximum degree &Delta; &ge; 3. This generalizes a result of Fisher et al., CU-Denver Tech Rep, 1996] who obtained the given bound for the case &Delta; = 3. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 297302, 1999