ppxscal/embedding_network huggingface dataset:
Predicting the resource consumption of network intrusion detection systems
Authors: Holger Dreger, Anja Feldmann, Vern Paxson, Robin Sommer
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

When installing network intrusion detection systems (NIDSs), operators are faced with a large number of parameters and analysis options for tuning trade-offs between detection accuracy versus resource requirements. In this work we set out to assist this process by understanding and predicting the CPU and memory consumption of such systems.
Fabrication of nano-gold islands with µm spacing using 2.5 dimensional PDMS stamps
Authors: Wolfgang Schwinger, Elisabeth Lausecker, Iris Bergmair, Martyna Grydlik, Thomas Fromherz, Christine Hasenfuí, Rainer Schöftner
Venue: Microelectronic Engineering (2008)

Gold islands with diameters in the range of several tens of nanometers with @mm spacing may act as binding sites for adapter molecules used for single molecule detection using optical fluorescence readout. Microcontact printing (@mCP) using PDMS stamps and alkanethiol chemistry is a straightforward method for the structuring of gold layers. When using binary two dimensional (2D) stamps the softness of the elastomer limits the useable aspect ratio and it was shown that nm-sized features with @mm spacing cannot be replicated with binary PDMS stamps. To bypass this limitation we used 2.5 dimensional PDMS stamps with pyramidal shaped topography to fabricate sub-100nm gold islands with a spacing of 6@mm on areas of several square millimeters. The masters, the stamps and the resulting gold structures were analyzed using scanning electron microscopy (SEM).
Density of the circular chromatic numbers of series-parallel graphs
Authors: Zhishi Pan, Xuding Zhu
Venue: Journal of Graph Theory (2004)

Suppose G is a series-parallel graph. It was proved in [3] that either &chi;c(G) = 3 or &chi;c(G) &le; 8-3. So none of the rationals in the interval (8-3, 3) is the circular chromatic number of a series-parallel graph. This paper proves that for every rational r&epsilon; [2, 8-3] &cup;{3} there exists a series-parallel graph G with &chi;c(G) = r. &copy; 2004 Wiley Periodicals, Inc. J Graph Theory 46:5768, 2004
A review of smart homes-Present state and future challenges
Authors: Marie Chan, Daniel Estève, Christophe Escriba, Eric Campo
Venue: Computer Methods and Programs in Biomedicine (2008)

In the era of information technology, the elderly and disabled can be monitored with numerous intelligent devices. Sensors can be implanted into their home for continuous mobility assistance and non-obtrusive disease prevention. Modern sensor-embedded houses, or smart houses, cannot only assist people with reduced physical functions but help resolve the social isolation they face. They are capable of providing assistance without limiting or disturbing the resident's daily routine, giving him or her greater comfort, pleasure, and well-being. This article presents an international selection of leading smart home projects, as well as the associated technologies of wearable/implantable monitoring systems and assistive robotics. The latter are often designed as components of the larger smart home environment. The paper will conclude by discussing future challenges of the domain.
Optimal manipulator parameter tolerance selection using evolutionary optimization technique
Authors: B. K. Rout, R. K. Mittal
Venue: Engineering Applications of Artificial Intelligence (2008)

Robot system designers often face the challenge of selecting optimal parameter tolerances of a manipulator, which delivers optimal performance. This paper presents an approach to simulate the performance of manipulator and evolutionary optimization method to select optimal parameter tolerance. To determine optimal parameter tolerance, genetic algorithm, and differential evolution, optimization techniques have been used. The objective function maximizes SN Ratio, while manipulator performs a task. As differential evolution and GA are best suited for solving deterministic optimization problems, to handle performance of manipulator, a hybrid technique is proposed. The evolutionary optimization techniques are coupled with orthogonal array used in the Taguchi method to get optimal solution. The hybrid technique is illustrated by an example and concluded that it is best suited for manipulator parameter tolerance design. It is also observed that differential evolution technique converges quickly and require significantly less number of functional evaluations.
Semi-automated Workflow Synthesis
Authors: Abilio Fernandes, Karin K. Breitman, Tatiana A. S. C. Vieira, Marco A. Casanova, Antonio L. Furtado
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Workflow management systems usually interpret a workflow definition rigidly. However, there are real life situations where users should be allowed to deviate from the prescribed static workflow definition for various reasons, including lack of information, unavailability of the required resources and unanticipated situations. Furthermore, workflow complexity may grow exponentially if all possible combinations of anticipated scenarios must be compiled into the workflow definition. To flexibilize workflow execution and help reduce workflow complexity, this paper proposes a dual strategy that combines a library of predefined typical workflows, of manageable complexity, with a planner mechanism capable of synthesizing more complex workflows, at execution time, tuned to the scenario in question. This dual strategy is motivated by the difficulty of designing emergency plans, modeled as workflows, which account for real life complex crisis or accident scenarios.
SEIF: Secure and Efficient Intrusion-Fault Tolerant Routing Protocol for Wireless Sensor Networks
Authors: Abdelraouf Ouadjaout, Yacine Challal, Noureddine Lasla, Miloud Bagaa
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In wireless sensor networks, reliability represents a design goal of a primary concern. To build a comprehensive reliable system, it is essential to consider node failures and intruder attacks as unavoidable phenomena. In this paper, we present a new intrusion-fault tolerant routing scheme offering a high level of reliability through a secure multi-path communication topology. Unlike existing intrusion-fault tolerant solutions, our protocol is based on a distributed and in-network verification scheme, which does not require any referring to the base station. Furthermore, it employs a new multi-path selection scheme seeking to enhance the tolerance of the network and conserve the energy of sensors. Extensive simulations with TinyOS showed that our approach improves the overall Mean Time To Failure (MTTF) while conserving the energy resources of sensors.
Scaling issues in network monitoring
Authors: Theodore Johnson
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Monitoring a Tier-1 ISP's extremely large and diverse network places extreme scaling demands on a Data Stream Management System (DSMS). A typical application involves a large number stream queries executing on high volume streams, replicated at a large number of monitoring points, with the results fed to a stream warehouse supporting a large number of users. I will describe some of these challenges and how a DSMS and other tools have evolved to meet them.
Ambient Intelligence—the Next Step for Artificial Intelligence
Authors: Carlos Ramos, Juan Carlos Augusto, Daniel Shapiro
Venue: IEEE Intelligent Systems (2008)

Ambient intelligence (AmI) deals with a new world of ubiquitous computing devices, where physical environments interact intelligently and unobtrusively with people. These environments should be aware of people's needs, customizing requirements and forecasting behaviors. AmI environments can be diverse, such as homes, offices, meeting rooms, schools, hospitals, control centers, vehicles, tourist attractions, stores, sports facilities, and music devices. Artificial intelligence research aims to include more intelligence in AmI environments, allowing better support for humans and access to the essential knowledge for making better decisions when interacting with these environments. This article, which introduces a special issue on AmI, views the area from an artificial intelligence perspective.
Adaptive label-driven scaling for latent semantic indexing
Authors: Xiaojun Quan, Enhong Chen, Qiming Luo, Hui Xiong
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper targets on enhancing Latent Semantic Indexing (LSI) by exploiting category labels. Specifically, in the term-document matrix, the vector for each term either appearing in labels or semantically close to labels is scaled before performing Singular Value Decomposition (SVD) to boost its impact on the generated left singular vectors. As a result, the similarities among documents in the same category are increased. Furthermore, an adaptive scaling strategy is designed to better utilize the hierarchical structure of categories. Experimental results show that the proposed approach is able to significantly improve the performance of hierarchical text categorization.
Overlay Multicast Architecture Supporting QoS over NGN
Authors: Boyoung Rhee, Kwangman Koh, Sunyoung Han
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

NGN is a communication network which can make use of multiple broadband and QoS-enabled transport technologies. One of the main service issues over NGN is a multimedia service, like IPTV and VOD, which is using multicast technology. And overlay multicast technology is one of the promising solutions instead of general multicast technology which has a few problems, and supports flexibility and scalability for multicast services. Also, the main controversial topic in NGN and overlay multicast at present is QoS.In the present paper, we designed an agent in each receiver’s network and a manager which is in a source network and which manages the whole multicast network. Both of them are communicating with each other and applying resource policies to their multicast network. This mechanism enables overlay multicast to support QoS, focusing on RACF in NGN architecture.
Methods for human - computer interaction research with older people
Authors: A. Dickinson, J. Arnott, S. Prior
Venue: Behaviour & Information Technology (2007)

Experimental research in human - computer interaction commonly uses participant groups that are unrepresentative of demographic realities, being young, technically knowledgeable and highly educated. One way of reflecting society more accurately in research is to include older adults in research groups, but the elicitation of high-quality data from these participants requires alterations in research methods and organization. In the present paper, methodological and organizational experiences from a range of research studies with older participants are reported. It concludes with a list of guidelines for maximizing the research outcomes of working with older adults.
Switched Current Flash Analog to Digital Converter
Authors: Michal Pavlik, Michal Kuban, Radimir Vrba
Venue: Proceedings of the Third International Conference on Systems (2008)

The article deals with the design of a 3-bit flash AD converter using switched current technique, particular subcircuits are discussed. Described converter is determined as a part of a multi-bit sigma delta modulator. Due to this fact the converter consists of current comparators net. Even if switched current technique is used, output of the converter is voltage.
Practical security for rural internet kiosks
Authors: Sumair Ur Rahman, Urs Hengartner, Usman Ismail, S. Keshav
Venue: Proceedings of the second ACM SIGCOMM workshop on Networked systems for developing regions (2008)

Rural Internet kiosks typically provide weak security guarantees and therefore cannot support secure web access or transaction-oriented applications such as banking and bill payment. We present a practical, unobtrusive and easy-to-use security architecture for rural Internet kiosks that uses a combination of physical and cryptographic mechanisms to protect user data and kiosk infrastructure. Our contributions include (a) a detailed threat analysis of rural Internet kiosks, b) a security architecture for rural Internet kiosks that does not require any specialized hardware features in kiosks, and (c) an application-independent and backward-compatible security API for securely sending and receiving data between kiosks and the Internet that can operate over disconnection-tolerant links.
Fast management of permutation groups
Authors: L. Babai
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Novel algorithms for computation in permutation groups are presented. They provide an order-of-magnitude improvement in the worst-case analysis of the basic permutation-group problems, including membership testing and computing the order of the group. For deeper questions about the group, including finding composition factors, an improvement of up to four orders of magnitude is realized. These and other essential investigations are all accomplished in O(n/sup 4/log/sup c/n) time. The approach is distinguished by its recognition and use of the intrinsic structure of the group at hand.
Texture Feature based Automated Seeded Region Growing in Abdominal MRI Segmentation
Authors: Jie Wu, Skip Poehlman, Michael D. Noseworthy, Markad V. Kamath
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A new texture feature based seeded region growing algorithm is proposed for the automated segmentation of organs in Abdominal MR image. Co-occurrence texture feature and semi-variogram texture feature are extracted from the image and the seeded region growing algorithm is run on these feature spaces. With a given Region of Interest(ROI), a seed point is automatically picked up based on three homogeneity criteria. A threshold is then obtained by taking a lower value just before the one causing ‘explosion’. This algorithm is tested on 12 series of 3D abdominal MR images.
Detailed mapping of a salt farm from Landsat TM imagery using neural network and maximum likelihood classifiers: a comparison
Authors: Y. Zhang, J. Gao, J. Wang
Venue: International Journal of Remote Sensing (2007)

Information on the size and distribution of various zones in a salt farm is critical to salt farm management and estimation of salt yield. The ability of neural network and maximum likelihood classifiers to classify spectrally uniform water bodies with a distinct boundary in a salt farm is comparatively studied in this paper for the Taibei Salt Field, Jiangsu Province, East China using Landsat Thematic Mapper (TM) data. In a pre-run classification of general land covers, the salt farm was mapped 84% correctly using the neural network method, slightly higher than the 76% achieved with the maximum likelihood classifier. In another separate neural network classification the salt farm was mapped further into three zones of evaporation, condensation, and crystallization at a producer's accuracy of 76%, 84%, and 86%, respectively, with the optimum classification settings. Such a detailed classification was not possible with the maximum likelihood method. It is concluded that the neural network is superior to the maximum likelihood method for detailed mapping of the Taibei Salt Field where salty water bodies are spectrally uniform and spatially extensive on the image with clear-cut boundaries among them.
Combining probability models and web mining models: a framework for proper name transliteration
Authors: Yilu Zhou, Feng Huang, Hsinchun Chen
Venue: Information Technology and Management (2008)

The rapid growth of the Internet has created a tremendous number of multilingual resources. However, language boundaries prevent information sharing and discovery across countries. Proper names play an important role in search queries and knowledge discovery. When foreign names are involved, proper names are often translated phonetically which is referred to as transliteration. In this research we propose a generic transliteration framework, which incorporates an enhanced Hidden Markov Model (HMM) and a Web mining model. We improved the traditional statistical-based transliteration in three areas: (1) incorporated a simple phonetic transliteration knowledge base; (2) incorporated a bigram and a trigram HMM; (3) incorporated a Web mining model that uses word frequency of occurrence information from the Web. We evaluated the framework on an English---Arabic back transliteration. Experiments showed that when using HMM alone, a combination of the bigram and trigram HMM approach performed the best for English---Arabic transliteration. While the bigram model alone achieved fairly good performance, the trigram model alone did not. The Web mining approach boosted the performance by 79.05%. Overall, our framework achieved a precision of 0.72 when the eight best transliterations were considered. Our results show promise for using transliteration techniques to improve multilingual Web retrieval.
Assessing Value of SW Requirements
Authors: Pasi Ojala
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Understanding software requirements and customer needs is vital for all SW companies around the world. Lately, clearly more attention has been focused also on the costs, cost-effectiveness, productivity and value of software development and products. This study outlines concepts, principles and process of implementing a value assessment for SW requirements. The main purpose of this study is to collect experiences whether the value assessment for product requirements is useful for companies, works in practice, and what are the strengths and weaknesses of using it. This is done by implementing value assessment in a case company step by step to see which phases possibly work and which phases possibly do not work.The practical industrial case shows that proposed value assessment for product requirements is useful and supports companies trying to find value in their products.
A distributed coordination protocol in an order-heterogeneous group
Authors: Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa
Venue: International Journal of Web and Grid Services (2008)

In Peer-to-Peer (P2P) overlay networks, a group of multiple peer processes are required to cooperate to make a global decision. Each process takes a value and exchanges values with the other processes until the agreement condition is satisfied. We define existentially and preferentially precedent relations which show what values a process can take after taking a value and which value a process prefers to another value, respectively. Based on the precedent relations, each process takes the most preferable value in the values which are changeable from current value, at each round. We discuss a coordination protocol among multiple values in a type of heterogeneous system, where some pair of processes has different precedent relations on the same domain. A process learns the precedent relations of another process through exchanging values. A process takes a value that other processes can take by using the knowledge on the other processes.
ReBA: a tool for generating binary adapters for evolving java libraries
Authors: Danny Dig, Stas Negara, Vibhu Mohindra, Ralph Johnson
Venue: Companion of the 30th international conference on Software engineering (2008)

Although in theory the APIs of software libraries and frameworks should be stable, they change in practice. This forces clients of the library API to change as well, making software maintenance expensive. Changing a client might not even be an option if its source code is missing or certain policies forbid its change. By giving a library both the old and the new API, clients can be shielded from API changes and can run with the new version of the library. This demo presents our tool, ReBA, that automatically generates compatibility layers between new library APIs and old clients. In the first stage, ReBA generates another version of the library, called adapted-library, that supports both the old and the new APIs. In the second stage, ReBA shrinks the adapted-library into a minimal, client-specific compatibility layer containing only classes truly required by the client. Evaluation on controlled experiments and case studies using Eclipse core libraries shows that our approach effectively adapts clients to new library versions, and is efficient.
Using average case intractability in cryptography
Authors: Candelaria Hernández Goya, Pino Caballero Gil
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

One of the most critical questions in Cryptography is referred to the misunderstanding equivalence between using a difficult problem as basis of a cryptographic application and its security verification. Under this erroneous perspective, it is common using problems belonging to NP (according to the worst-case analysis) in the design stage. Afterwards the verification analysis is completely based on the complexity assumptions. However it should be bared in mind that when random generated instances are used, then many times there are fast and efficient algorithms to solve them. This work includes the description of a new multiparty protocol devoted to the sharing of secrets whose main application is related to key management. The main particularity of this scheme is that it is based on a problem classified as DistNP-Complete under the average-case analysis, the so called Distributional Matrix Representability Problem.
Efficient object description and recognition based on shape signature
Authors: Andrzej Florek, Tomasz Piascik
Venue: Machine Graphics Vision International Journal (2006)

A simple and efficient approach to recognition and classification of planar shapes is proposed. This approach is based on comparison of areas of dynamic adapted centroid signatures. The usefulness of our approach for assessment of the similarity equally of convex and non-convex objects and objects containing openings is shown.
Distributed $${{\mathcal H}^2}$$-matrices for non-local operators
Authors: Steffen B&#x00f6;rm, Joana Bendoraityte
Venue: Computing and Visualization in Science (2008)

$${{\mathcal H}^2}$$-matrices can be used to approximate dense n&#x00a0;&#x00d7; n matrices resulting from the discretization of certain non-local operators (e.g., Fredholm-type integral operators) in $${{\mathcal O}(n k)}$$ units of storage, where k is a parameter controlling the accuracy of the approximation. Since typically k &#x226a; n holds, this representation is much more efficient than the conventional representation by a two-dimensional array. For very large problem dimensions, the amount of available storage becomes a limiting factor for practical algorithms. A popular way to provide sufficiently large amounts of storage at relatively low cost is to use a cluster of inexpensive computers that are connected by a network. This paper presents a method for managing an $${{\mathcal H}^2}$$-matrix on a distributed-memory cluster that can be proven to be of almost optimal parallel efficiency.