ppxscal/embedding_network huggingface dataset:
Sdl2pml - Tool for automated generation of Promela model from SDL specification
Authors: Aleksander Vree, Boštjan Vlaovič, Zmago Brezočnik
Venue: Computer Standards Interfaces (2009)

This paper presents research results from the field of automated generation of verification model from real-life SDL (Specification and Description Language) specification of the system. An award winning model checker Simple Promela Interpreter (Spin) was used for formal verification. Preparing a verification model from real-life specification is a hard task. We implement most of our research results in the tool named sdl2pml (SDL to Promela) in order to avoid human errors while building the verification model. This tool is used for automated generation of the model. We present its architecture and compare the implemented features with other existing tools. Additionally, we demonstrate its use on a real-life specification of an IUA (ISDN User Adaptation) protocol which is part of the SI3000 softswitch.
Recognizing underlying sparsity in optimization
Authors: Sunyoung Kim, Masakazu Kojima, Philippe Toint
Venue: Mathematical Programming: Series A and B (2009)

Exploiting sparsity is essential to improve the efficiency of solving large optimization problems. We present a method for recognizing the underlying sparsity structure of a nonlinear partially separable problem, and show how the sparsity of the Hessian matrices of the problem&#x2019;s functions can be improved by performing a nonsingular linear transformation in the space corresponding to the vector of variables. A combinatorial optimization problem is then formulated to increase the number of zeros of the Hessian matrices in the resulting transformed space, and a heuristic greedy algorithm is applied to this formulation. The resulting method can thus be viewed as a preprocessor for converting a problem with hidden sparsity into one in which sparsity is explicit. When it is combined with the sparse semidefinite programming relaxation by Waki et al. for polynomial optimization problems, the proposed method is shown to extend the performance and applicability of this relaxation technique. Preliminary numerical results are presented to illustrate this claim.
Multiple Watermarking in Visual Cryptography
Authors: Hao Luo, Zhe-Ming Lu, Jeng-Shyang Pan
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

This paper proposes a scheme to hide two watermarks in visual secret sharing of a gray level image. One watermark is embedded during secret image halftoning, and the other is hidden during the halftone image encryption. A non-expansion visual secret sharing model is used to encrypt the halftone image. In watermark extraction, only Exclusive-OR operation is needed, and basic properties of conventional visual cryptography technique are still preserved. Experimental results show the effectiveness of our schemes.
Are We There Yet? User-Centered Temporal Awareness
Authors: Matt Adcock, Jae-Woo Chung, Chris Schmandt
Venue: Computer (2009)

Wearable devices could collect time-related information from the items and environments we interact with and create a personal temporal model.
Coherence aware GPU-based ray casting for virtual colonoscopy
Authors: Taek Hee Lee
Venue: Computer Animation and Virtual Worlds (2009)

In this paper, we propose a GPU-based volume ray casting for virtual colonoscopy to generate high-quality rendering images with a large screen size. Using the temporal coherence for ray casting, the empty space leaping can be efficiently done by reprojecting first-hit points of the previous frame; however, these approaches could produce artifacts such as holes or illegal starting positions due to the insufficient resolution of first-hit points. To eliminate these artifacts, we use a triangle mesh of first-hit points and check the intersection of each triangle with the corresponding real surface. Illegal starting positions can be avoided by replacing a false triangle cutting the real surface with five newly generated triangles. The proposed algorithm is best fit to the recent GPU architecture with Shader Model 4.0 which supports not only fast rasterization of a triangle mesh but also many flexible vertex operations. Experimental results on ATI 2900 with DirectX10 show perspective volume renderings of over 24fps on 1024&thinsp;&times;&thinsp;1024 screen size without any loss of image quality. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A tool for the simulation of the activity index variance model
Authors: Rok Istenic, Damjan Zazula
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In this paper, we introduce a simulation tool for the estimation of the number of signal sources in convolutive signal mixtures. The tool provides a graphical simulation of the analytical model of activity index variance, which is a recent approach to the estimation of the number of signal sources. Our tool presents a comprehensible approach to the problem, because the whole process from signal generation to the estimation of the number of sources is visualized efficiently. Graphical visualization is an important feature particularly for students who start learning blind source separation techniques and others without prior knowledge of this field. Our simulator covers all major stages of the estimation process, starting at the generation of convolutive signal mixtures, computing the correlation matrix of measurements and activity index, until the final estimation of the number of active signal sources.
Efficient application identification and the temporal and spatial stability of classification schema
Authors: Wei Li, Marco Canini, Andrew W. Moore, Raffaele Bolla
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Motivated by the importance of accurate identification for a range of applications, this paper compares and contrasts the effective and efficient classification of network-based applications using behavioral observations of network-traffic and those using deep-packet inspection. Importantly, throughout our work we are able to make comparison with data possessing an accurate, independently determined ground-truth that describes the actual applications causing the network-traffic observed. In a unique study in both the spatial-domain: comparing across different network-locations and in the temporal-domain: comparing across a number of years of data, we illustrate the decay in classification accuracy across a range of application-classification mechanisms. Further, we document the accuracy of spatial classification without training data possessing spatial diversity. Finally, we illustrate the classification of UDP traffic. We use the same classification approach for both stateful flows (TCP) and stateless flows based upon UDP. Importantly, we demonstrate high levels of accuracy: greater than 92% for the worst circumstance regardless of the application.
Towards Annotation of Nonverbal Vocal Gestures in Slovak
Authors: Milan Rusko, Jozef Juhár
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

The paper presents some of the problems of classification and annotation of speech sounds that have their own phonetic content, phonological function, and prosody, but they do not have an adequate linguistic (or text) representation. One of the most important facts about these "nonverbal vocal gestures" is that they often have a rich semantic content and they play an important role in expressive speech. The techniques that have been used in an effort to find an adequate classification system and annotation scheme for these gestures include prosody modeling and approaches comparing the nonverbal vocal gestures with their verbal (lexical) and body counterparts.
Temperature Measurement of Dilute Hydrogen Flame by Digital Laser-Speckle Technique
Authors: N. Fujisawa, S. Aiura, M. Ohkubo, T. Shimizu
Venue: Journal of Visualization (2009)

In this paper, temperature measurement of axisymmetric dilute hydrogen flame is described using digital laser-speckle technique, which allows the measurement of refractive index field of the flame without any tracers. The measurement system consists of laser and CCD camera, which are placed in-line configuration. The temperature field of the flame is derived from the refractive index field using the cross-correlation analysis of the speckle pattern with and without flame. The influence of the species concentration on the temperature measurement is evaluated from the gas composition in the flame using gas chromatography. It is found that the temperature field measured by the present method with concentration correction agrees with that of the thermocouple measurement within an experimental accuracy, suggesting the usefulness of this measurement technique.
A Game Theoretic Approach for Efficient Graph Coloring
Authors: Panagiota N. Panagopoulou, Paul G. Spirakis
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We give an efficient local search algorithm that computes a good vertex coloring of a graph G. In order to better illustrate this local search method, we view local moves as selfish moves in a suitably defined game. In particular, given a graph G = (V,E) of n vertices and m edges, we define the graph coloring game &Gamma;(G) as a strategic game where the set of players is the set of vertices and the players share the same action set, which is a set of n colors. The payoff that a vertex v receives, given the actions chosen by all vertices, equals the total number of vertices that have chosen the same color as v, unless a neighbor of v has also chosen the same color, in which case the payoff of v is 0. We show: The game &Gamma;(G) has always pure Nash equilibria. Each pure equilibrium is a proper coloring of G. Furthermore, there exists a pure equilibrium that corresponds to an optimum coloring. We give a polynomial time algorithm $\mathcal{A}$ which computes a pure Nash equilibrium of &Gamma;(G). The total number, k, of colors used in any pure Nash equilibrium (and thus achieved by $\mathcal{A}$) is $k\leq\min\{\Delta_2+1, \frac{n+\omega}{2}, \frac{1+\sqrt{1+8m}}{2}, n-\alpha+1\}$, where &omega;, &alpha; are the clique number and the independence number of G and &Delta; 2 is the maximum degree that a vertex can have subject to the condition that it is adjacent to at least one vertex of equal or greater degree. (&Delta; 2 is no more than the maximum degree &rdquo; of G.) Thus, in fact, we propose here a new, efficient coloring method that achieves a number of colors satisfying (together) the known general upper bounds on the chromatic number X. Our method is also an alternative general way of proving, constructively, all these bounds. Finally, we show how to strengthen our method (staying in polynomial time) so that it avoids "bad" pure Nash equilibria (i.e. those admitting a number of colors k far away from X). In particular, we show that our enhanced method colors optimally dense random q-partite graphs (of fixed q) with high probability.
A High Payload VQ Steganographic Method for Binary Images
Authors: Chin-Chen Chang, Chih-Yang Lin, Yu-Zheng Wang
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

In this paper, we propose a new VQ steganographic method for embedding binary images and improving the stego-image quality. The main idea is using the new S-tree to represent the binary image and applying the genetic k-means clustering technique on the codebook to obtain strong cohesion clusters in order to reduce the replacement distortion. Experimental results show that our method outperforms the existing schemes on both image quality and embedding capacity.
OCTOR: Subset selection in recursive pattern hierarchies
Authors: Justin Jang, Jarek Rossignac
Venue: Graphical Models (2009)

We present an approach for encoding and specifying selections in recursive pattern hierarchies. Hierarchies of patterns of features or other modeling entities are used in architectural and mechanical CAD to eliminate laborious repetitions from the design process. Yet, often a subset of the repeated occurrences in the model must be edited. Specifying a desired selection is often tedious and difficult. Our approach addresses these two drawbacks simultaneously, offering an effective and intuitive solution which requires only two mouse-clicks to specify any one of a wide range of selections, including selections in recursive hierarchies. The selection has a concise representation that is simple to compute.
Lemmas on demand for the extensional theory of arrays
Authors: Robert Brummayer, Armin Biere
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

Deciding satisfiability in the theory of arrays, particularly in combination with bit-vectors, is essential for software and hardware verification. We precisely describe how the lemmas on demand approach can be applied to this decision problem. In particular, we show how our new propagation based algorithm can be generalized to the extensional theory of arrays. Our implementation achieves competitive performance.
A Novel Intrusion Detection Method Based on Adaptive Resonance Theory and Principal Component Analysis
Authors: Junbi Xiao, Hao Song
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

A novel intrusion detection approach based on Adaptive Resonance Theory (ART) and Principal Component Analysis (PCA) is put forward according to analyzing now intrusion detection methods. In this model (PCA-MART2), it defines network behaviors relied upon the datagram. PCA is applied to feature selection about input samples and the multi-layered ART2 is designed to subdivide the imprecise clustering. The modified algorithm improved the speed and accuracy of detection. The experimental results show that the intrusion detection system based on PCAMART2 can detect intrusion behavior in network efficiently.
Interaction of low-temperature surfactant-grown InAs superlattice layers with arsenic precipitates
Authors: M. Alduraibi, C. Mitchell, S. Chakraborty, M. Missous
Venue: Microelectronics Journal (2009)

Double crystal X-ray diffraction (DCXRD), transmission electron microscopy (TEM) and photoluminescence (PL) measurements were used to study the effect of post-growth annealing temperature on the structural properties of novel low growth (250 °C) and normal growth (450 °C) temperature InAs surfactant-mediated grown materials. Under conditions of "arsenic-free" growth, high-quality InAs-GaAs superlattices are obtained at low temperatures (LT) even at thicknesses as high as 3 monolayers (MLs) for InAs. The interaction of the built-in strain fields and the point defects in LT-GaAs both before and after annealing has been studied in detail. DCXRD studies show that the thickness of the LT-grown InAs layers decreased by up to 0.7ML as the annealing temperature increased to 550 °C. There is evidence from the DCXRD and TEM that the LT InAs-GaAs superlattice structure starts to distort at annealing temperatures above 450 °C. In comparison, the sample grown at normal temperature, 450 °C, still retained the periodicity of the superlattice layers up to an annealing temperature of 650 °C without any change in the thickness of either the InAs (wetting layer) or GaAs.
Variable neighborhood search for the heaviest k-subgraph
Authors: Jack Brimberg, Nenad Mladenović, Dragan Urošević, Eric Ngai
Venue: Computers and Operations Research (2009)

This paper presents a variable neighborhood search (VNS) heuristic for solving the heaviest k-subgraph problem. Different versions of the heuristic are examined including 'skewed' VNS and a combination of a constructive heuristic followed by VNS. Extensive computational experiments are performed on a series of large random graphs as well as several instances of the related maximum diversity problem taken from the literature. The results obtained by VNS were consistently the best over a number of other heuristics tested.
Evolving service semantics cooperatively: a consumer-driven approach
Authors: Murat Şensoy, Pınar Yolum
Venue: Autonomous Agents and Multi-Agent Systems (2009)

Commerce relies on dynamic creation and modification of services. New service offerings or service demands come into play frequently. Whereas traditional commerce supports creation of new service demands from consumers, e-commerce has so far expected service providers to come up with desirable new service offerings and assigned service consumers a passive role in the process. That is, current e-commerce architecture lacks a consumer-driven approach for the generation of new service descriptions. This paper bridges this gap by proposing a multiagent system of consumers that represent their service needs semantically using ontologies. Using our proposed approach, agents can create new service descriptions, share them with interested others, and use service descriptions that are created by other agents. Hence, more accurate concepts describing consumers' service needs are cooperatively and iteratively created. This leads to a society of consumers with different but overlapping ontologies where mutually accepted service concepts emerge based on consumers' exchange of service descriptions. Our simulations of consumer societies show that allowing cooperative evolution of service ontologies facilitates better representation of consumers' service needs. Further, through cooperation, not only more useful service concepts emerge over time, but also ontologies of consumers having similar service needs become aligned gradually.
Channel Estimation Aided Active Codes Detection Algorithm in TD-SCDMA Systems
Authors: Zeng Rong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

TD-SCDMA is one of the 3G wireless communication standards accepted by ITU and 3GPP. TD-SCDMA system has employed joint detection algorithms in downlink to improve the performance. As an important part of joint detection algorithm, active codes detection algorithm has large effect on the performance. In this paper, we propose a channel estimation aided active codes detection algorithm. Theory analyses and simulation results show that the proposed algorithm has better system performance compared with conventional algorithm.
Analysis of long queries in a large scale search log
Authors: Michael Bendersky, W. Bruce Croft
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

We propose to use the search log to study long queries, in order to understand the types of information needs that are behind them, and to design techniques to improve search effectiveness when they are used. Long queries arise in many different applications, such as CQA (community-based question answering) and literature search, and they have been studied to some extent using TREC data. They are also, however, quite common in web search, as can be seen by looking at the distribution of query lengths in a large scale search log. In this paper we analyze the long queries in the search log with the aim of identifying the characteristics of the most commonly occurring types of queries, and the issues involved with using them effectively in a search engine. In addition, we propose a simple yet effective method for evaluating the performance of the queries in the search log using a combination of the click data in the search log with the existing TREC corpora.
Breaking the simulation barrier: SRAM evaluation through norm minimization
Authors: Lara Dolecek, Masood Qazi, Devavrat Shah, Anantha Chandrakasan
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

With process variation becoming a growing concern in deep submicron technologies, the ability to efficiently obtain an accurate estimate of failure probability of SRAM components is becoming a central issue. In this paper we present a general methodology for a fast and accurate evaluation of the failure probability of memory designs. The proposed statistical method, which we call importance sampling through norm minimization principle, reduces the variance of the estimator to produce quick estimates. It builds upon the importance sampling, while using a novel norm minimization principle inspired by the classical theory of Large Deviations. Our method can be applied for a wide class of problems, and our illustrative examples are the data retention voltage and the read/write failure tradeoff for 6T SRAM in 32 nm technology. The method yields computational savings on the order of 10000x over the standard Monte Carlo approach in the context of failure probability estimation for SRAM considered in this paper.
Dynamic Clonal and Chaos-Mutation Evolutionary Algorithm for Function Optimization
Authors: Ming Yang, Jing Guan
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper introduced a dynamic-clone and chaos-mutation evolutionary algorithm (DCCM-EA), which employs dynamic clone and chaos mutation methods, for function optimization. The number of clone is direct proportion to "affinity" between individuals and the chaos sequence can search the points all over the solution space, so DCCM-EA can make all points get equal evolutionary probability, to get the global optimal solution most possibly. In the experiments, taking 23 benchmark functions to test, it can be seen that DCCM-EA if effective for solving function optimization.
2nd International Workshop on Software Product Management
Authors: Christof Ebert, Sjaak Brinkkemper, Slinger Jansen, Gerald Heller
Venue: Proceedings of the 2008 Second International Workshop on Software Product Management (2008)

In today's competitive software markets it is of utmost interest to have winning products. The success of any software product depends on skilled and competent product management. Software product management is complex: There are many stakeholders, many responsibilities and lots of skill needs, but no formalized education or agreed body of knowledge.
Adaptive Traffic Monitoring and Controlling System (ATMC)
Authors: Sameer Mishra, Vibhav Lohani
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

ATMC is a cheap, automatic and practical traffic monitoring and controlling system which requires no human supervision at all. Driving License would be replaced by the smart card, which would work as ekey required for starting the vehicle. If a vehicle breaks the traffic signal, this system gets the information about the vehicle using RF communication and disconnects the starting circuit of vehicle from the battery. This is an adaptive system which senses the traffic and then adjusts the traffic light durations accordingly.