ppxscal/embedding_network huggingface dataset:
Detection of zonal noise in the textural images
Authors: Nicoleta Angelescu, Dan Popescu, Iulian Udroiu, Ioan Tache
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The paper presents a classification and identification method for the zonal noise in the textural images. To identify zonal noise in the textural images, a reference database with the textural images is used. For the region recognition with zonal noise, a decision theoretic method is used. The features are of the statistic type and derive from the medium co-occurrence matrices: contrast, energy, entropy, homogeneity, and correlation. The algorithm is implemented in C++ programming language and allows the simultaneously display of both the investigated regions pairs, and the Euclidian distance between them. Our experimental results indicate that the five selected features for texture classification give good results to identify the zonal noise. The results also confirm that the distances between the similar regions are relatively small and the distances between regions from different textured images with zonal noise are relatively great.
Footing in human-robot conversations: how robots might shape participant roles using gaze cues
Authors: Bilge Mutlu, Toshiyuki Shiwa, Takayuki Kanda, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

During conversations, speakers establish their and others' participant roles (who participates in the conversation and in what capacity)--or "footing" as termed by Goffman-using gaze cues. In this paper, we study how a robot can establish the participant roles of its conversational partners using these cues. We designed a set of gaze behaviors for Robovie to signal three kinds of participant roles: addressee, bystander, and overhearer. We evaluated our design in a controlled laboratory experiment with 72 subjects in 36 trials. In three conditions, the robot signaled to two subjects, only by means of gaze, the roles of (1) two addressees, (2) an addressee and a bystander, or (3) an addressee and an overhearer. Behavioral measures showed that subjects' participation behavior conformed to the roles that the robot communicated to them. In subjective evaluations, significant differences were observed in feelings of groupness between addressees and others and liking between overhearers and others. Participation in the conversation did not affect task performance-measured by recall of information presented by the robot-but affected subjects' ratings of how much they attended to the task.
Iterative use of simulation and scheduling methodologies to improve productivity
Authors: Karthik Krishna Vasudevan, Ravi Lote, Edward J. Williams, Onur Ülgen
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Experienced and wise industrial engineering educators and practitioners have long understood that industrial engineering is a coherent discipline encompassing techniques that work best synergistically, not a motley collection of specialized techniques each isolated in a separate chimney. As an example of the synergies which industrial engineering can bring to process improvement in a production environment, this case study presents the integrated use of process simulation, production scheduling, and detailed analysis of material-handling methods and their improvement. The study undertook the identification and improvement of production and scheduling policies to the benefit of a manufacturing process whose original throughput capacity fell significantly short of high and increasing demand.
The CERT C Secure Coding Standard, 1st edition
Authors: Robert C. Seacord
Venue:  (2008)

Im an enthusiastic supporter of the CERT Secure Coding Initiative. Programmers have lots of sources of advice on correctness, clarity, maintainability, performance, and even safety. Advice on how specific language features affect security has been missing. The CERT C Secure Coding Standard fills this need.Randy Meyers, Chairman of ANSI CFor years we have relied upon the CERT/CC to publish advisories documenting an endless stream of security problems. Now CERT has embodied the advice of leading technical experts to give programmers and managers the practical guidance needed to avoid those problems in new applications and to help secure legacy systems. Well done!Dr. Thomas Plum, founder of Plum Hall, Inc.Connectivity has sharply increased the need for secure, hacker-safe applications. By combining this CERT standard with other safety guidelines, customers gain all-round protection and approach the goal of zero-defect software.Chris Tapp, Field Applications Engineer, LDRA Ltd.Ive found this standard to be an indispensable collection of expert information on exactly how modern software systems fail in practice. It is the perfect place to start for establishing internal secure coding guidelines. You wont find this information elsewhere, and, when it comes to software security, what you dont know is often exactly what hurts you.John McDonald, coauthor of The Art of Software Security AssessmentSoftware security has major implications for the operations and assets of organizations, as well as for the welfare of individuals. To create secure software, developers must know where the dangers lie. Secure programming in C can be more difficult than even many experienced programmers believe.This book is an essential desktop reference documenting the first official release of The CERT C Secure Coding Standard. The standard itemizes those coding errors that are the root causes of software vulnerabilities in C and prioritizes them by severity, likelihood of exploitation, and remediation costs. Each guideline provides examples of insecure code as well as secure, alternative implementations. If uniformly applied, these guidelines will eliminate the critical coding errors that lead to buffer overflows, format string vulnerabilities, integer overflow, and other common software vulnerabilities.
Optimization-based framework for simultaneous circuit-and-system design-space exploration: a high-speed link example
Authors: Ranko Sredojević, Vladimir Stojanović
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Connecting system-level performance models with circuit information has been a long-standing problem in analog/mixed-signal front-ends, like radios and high-speed links. High-speed links are particularly hard to analyze because of the complex interplay of device/circuit parasitics and channel filtering operation. In this paper we introduce optimization-based framework for link design-space exploration, connecting the link transmission quality and top-level filter settings with circuit power, sizing and biasing. We derive a special analytical discrete time representation that avoids the size explosion of the symbolic problem description improving the parsing and solver time by orders of magnitude and making this joint optimization possible in real-time. This robust and accurate problem formulation is derived in signomial form and is compatible with existing optimization approaches to circuit sizing. We demonstrate this optimization framework on a link design-space exploration example, investigating trade-offs between the transmit preemphasis and linear receiver equalizer and their impact on overall link power vs. data rate.
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Authors: Torsten Tholey
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Given distinct vertices s 1,s 2,t 1, and t 2 the 2-vertex-disjoint paths problem (2-VDPP) consists in determining two vertex-disjoint paths p 1, from s 1 to t 1, and p 2, from s 2 to t 2, if such paths exist. We show that by using some kind of sparsification technique the previously best known time bound of O(n&thinsp;+&thinsp;m&alpha;(m,n)) can be reduced to O(m&thinsp;+&thinsp;n&alpha;(n,n)), where &alpha; denotes the inverse of the Ackermann function. Moreover, we extend the very practical and simple algorithm of Hagerup for solving the 2-VDPP on 3-connected planar graphs to a simple linear time algorithm for the 2-VDPP on general planar graphs thereby avoiding the computation of planar embeddings or triconnected components.
Hardware and software concerns relating to industrial processes
Authors: Henry R. Koen
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Software development is the major concern in the delivery of industrial process control. This session will examine key guidelines in hardware and software that effect success. Six papers will be presented in a workshop atmosphere with statements likely to draw fire. This blue ribbon panel of speakers will then be required to defend their theory and discovery. High attendee interaction is anticipated. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Randomized Instruction Sets and Runtime Environments Past Research and Future Directions
Authors: Angelos D. Keromytis
Venue: IEEE Security and Privacy (2009)

The author describes past research and future directions on instruction set randomization (ISR), a general technique for protecting against code-injection attacks. Such attacks are commonly encountered in a variety of application domains, remotely targeting program binaries, Web application and database backends, and Web browsers. Collectively, they represent the vast majority of reported attacks in bug- and incident-tracking repositories for the past decade, with no sign of abatement. ISR provides for a separation of code from data by randomizing the execution environment of legitimate code, which has to be suitably transformed using a key shared with the execution environment. This article describes the motivation behind ISR, the high-level concept, its use in two different application domains (binary code injection and SQL injection attacks), the author's findings and experiences (including several limitations, both of the technique and of prototypes), and future directions for improvements and application of ISR. Although he tries to provide broad coverage of the topic, the primary focus is on the research conducted at the Network Security Laboratory at Columbia.
A flexible model and efficient solution strategies for discrete location problems
Authors: Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten
Venue: Discrete Applied Mathematics (2009)

Flexible discrete location problems are a generalization of most classical discrete locations problems like p-median or p-center problems. They can be modeled by using so-called ordered median functions. These functions multiply a weight to the cost of fulfilling the demand of a customer, which depends on the position of that cost relative to the costs of fulfilling the demand of other customers. In this paper a covering type of model for the discrete ordered median problem is presented. For the solution of this model two sets of valid inequalities, which reduces the number of binary variables tremendously, and several variable fixing strategies are identified. Based on these concepts a specialized branch & cut procedure is proposed and extensive computational results are reported.
Constructing confidence belief functions from one expert
Authors: Shan-Lin Yang, Chao Fu
Venue: Expert Systems with Applications: An International Journal (2009)

It has become a noticeable topic on how to construct belief functions from the quantitative and qualitative opinions of one expert. The existing methods proposed in the literature addressing the topic, however, have paid little attention to the bounded rationality (BR) of the expert. This paper introduces a confidence belief function (BF) qualitatively and quantitatively under the assumption of BR, generated from a set of BFs sampled from the expert by interacting with a number of reliable information providers in a valid time interval. Besides, a procedure for quantitatively producing a confidence BF is presented, which is based on a statistical method mainly involving three steps, dividing the set of BFs into a number of non-conflicting or consistent subsets, forming the confidence interval-valued belief structures (IBSs) of the subsets, and integrating the IBSs into the confidence IBS of the set. A numerical example about a manager in a telecommunications company deciding whether to upgrade a business campaign or not is given to show the procedure for generating a confidence BF. Since the method of generating a confidence BF is on the power set of a frame of discernment, its scalability is also discussed.
Space+a: participating audience on performance stage
Authors: Ryohei Takagi, Kosuke Kazato, Suzuki Shugo, Naohito Okude
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Space+a is a megaphone that produce interactive cheering method in ubiquitous computing world. This megaphone can show the digital photos that you've taken to the wall, and you can also make an effect to the screen by banging or swinging your megaphone in the performance area. Audiences are able to create the whole space by cheering with this megaphone. The purpose of space+a is to let the audience to be more active, and helps to increase the performer's potential.
Optical-flow based on an edge-avoidance procedure
Authors: Pierre-Marc Jodoin, Max Mignotte
Venue: Computer Vision and Image Understanding (2009)

This paper presents a differential optical flow method which accounts for two typical motion-estimation problems: (1) flow regularization within regions of uniform motion while (2) preserving sharp edges near motion discontinuities i.e., where motion is multimodal by nature. The method proposed is a modified version of the well known Lucas-Kanade (LK) algorithm. While many edge-preserving strategies try to minimize the effect of outliers by using a line process or a robust function, our method takes a novel approach to solve the problem. Based on documented assumptions, our method computes motion with a classical least-squares fit on a local neighborhood shifted away from where motion is likely to be multimodal. In this way, the inherent bias due to multiple motion around moving edges is avoided instead of being compensated. This edge-avoidance procedure is based on the non-parametric mean-shift algorithm which shifts the LK integration window away from local sharp edges. Our method also locally regularizes motion by performing a fusion of local motion estimates. The regularization is made with a covariance filter which minimizes the effect of uncertainties due in part to noise and/or lack of texture. Our method is compared with other edge-preserving methods on image sequences representing different challenges.
Application generators: an introduction
Authors: Jerrold M. Grochow
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Application generators represent a new class of software development tools, which may yield the next order-of-magnitude productivity improvement in systems design, programming, and maintenance. This paper provides an introduction and bibliography for the topic. Current references to more than 50 articles and publications, as well as to some two dozen products, indicate the extent of recent interest in this topic.
Noise insensitive sampling frequency offset estimation methods for DVB-T/H systems
Authors: Kyung Hoon Won, Jung Su Han, Hyung-Jin Choi, BonYoung Koo
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

A precise estimation and compensation of SFO (Sampling Frequency Offset) is an important issue in OFDM (Orthogonal Frequency Division Multiplexing) system, because sampling frequency mismatch between the transmitter and the receiver dramatically degrades the system performance due to the loss of orthogonality between the subcarriers. However, the conventional SFO estimation method has serious performance degradation due to SNR (Signal to Noise Ratio) loss caused by the complex conjugate multiplications in time and frequency domain. Therefore, in this paper, we propose two SFO estimation methods which include noise mitigation processes to reduce the SNR loss. The proposals for SFO estimation / compensation are mainly based on DVB (Digital Video Broadcasting) system, and we verified that the proposed method has a good performance and stable operation through extensive simulation.
Smooth patchy control Lyapunov functions
Authors: Rafal Goebel, Christophe Prieur, Andrew R. Teel
Venue: Automatica (Journal of IFAC) (2009)

A smooth patchy control Lyapunov function for a nonlinear system consists of an ordered family of smooth local control Lyapunov functions, whose open domains form a locally finite cover of the state space of the system, and which satisfy certain further increase or decrease conditions. We prove that such a control Lyapunov function exists for any asymptotically controllable nonlinear system. We also show a construction, based on such a control Lyapunov function, of a stabilizing hybrid feedback that is robust to measurement noise.
Space-Time Wireless Systems: From Array Processing to MIMO Communications, 1st edition
Authors: H. Blcskei, D. Gesbert, C. B. Papadias, A.-J. van der Veen
Venue:  (2008)

One of the most promising technologies to resolve the bottlenecks in traffic capacity of future wireless networks is multiple-input multiple-output (MIMO) communications and space-time processing. MIMO wireless technology has progressed from the stage of fundamental research to commercially available products within a decade. With over sixty contributors from the field, this book provides an extensive overview of the state-of-the-art in MIMO communications, ranging from its roots in antenna array processing to advanced cellular communication systems. A balanced treatment of three key areas---information theory, algorithms and systems studies, and implementation issues---has been assembled by four editors with a broad range of academic and industry experience. This comprehensive reference will appeal to practitioners, researchers, and graduate students in wireless communications.
Regularity and the Cesàro–Nevai class
Authors: Barry Simon
Venue: Journal of Approximation Theory (2009)

We consider OPRL and OPUC with measures regular in the sense of Ullman-Stahl-Totik and prove consequences on the Jacobi parameters or Verblunsky coefficients. For example, regularity on [-2,2] implies limN&rarr;&infin;N-1[&Sigma; Nn=1(an-1)2 + b2n] = 0.
Light-based string matching
Authors: Mihai Oltean
Venue: Natural Computing: an international journal (2009)

String matching is a very important problem in computer science. The problem consists in finding all the occurrences of a pattern P of length m in a text T of length n. We describe a special device which can do string matching by performing n&minus;m + 1 text-to-pattern comparisons. The proposed device uses light and optical filters for performing computations. Two physical implementations are proposed. One of them uses colored glass and the other one uses polarizing filters. The strengths and the weaknesses of each method are deeply discussed.
Individual and group-based learning from complex cognitive tasks: Effects on retention and transfer efficiency
Authors: Femke Kirschner, Fred Paas, Paul A. Kirschner
Venue: Computers in Human Behavior (2009)

The effects of individual versus group learning (in triads) on efficiency of retention and transfer test performance in the domain of biology (heredity) among 70 high-school students were investigated. Applying cognitive load theory, the limitations of the working memory capacity at the individual level were considered an important reason to assign complex learning tasks to groups rather than to individuals. It was hypothesized that groups will have more processing capacity available for relating the information elements to each other and by doing so for constructing higher quality cognitive schemata than individuals if the high cognitive load imposed by complex learning tasks could be shared among group members. In contrast, it was expected that individuals who learn from carrying out the same complex tasks would need all available processing capacity for remembering the interrelated information elements, and, consequently, would not be able to allocate resources to working with them. This interaction hypothesis was confirmed by the data on efficiency of retention and transfer test performance; there was a favorable relationship between mental effort and retention test performance for the individual learners as opposed to a favorable relationship between transfer test performance and mental effort for the students who learned in groups.
Study of using shift registers in cryptosystems for grade 8 irreducible polynomials
Authors: Mirella Amelia Mioc
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Different schemes based on shift registers may be used for coding and decoding. The goal of this analyze is to prove that the Linear Feed-back Shift Register and Multiple Input-Output Shift Register have the same function. The conclusion of this paper is that for grade 8 irreducible polynomials the weights are calculated with a formula discovered in this experiment.
Area and power efficient mismatched filters based on sidelobe inversion
Authors: Indranil Sarkar, Thomas Poonnen, Adly T. Fam
Venue: Signal Processing (2009)

A computationally efficient mismatched filter comprised of a matched filter in cascade with a multi-stage filter based on sidelobe inversion is proposed. For this approach to work, the given code has to satisfy certain conditions as derived in this work. For the proposed filter to be of practical significance, the given autocorrelation must have a computationally efficient representation including the case of sparse and/or small integer valued sidelobes such as in Barker codes. When implemented in VLSI, significantly smaller chip area and less power are required compared to the length-optimal filters achieving comparable sidelobe suppression.
Standards for security associations in personal networks: a comparative analysis
Authors: J. Suomalainen, J. Valkonen, N. Asokan
Venue: International Journal of Security and Networks (2009)

Introducing a new device to a network or to another device is one of the most security critical phases of communication in personal networks. It is particularly challenging to make this process of associating devices easy-to-use, secure and inexpensive at the same time. A cornerstone of this process is key establishment. In this paper, we first present a taxonomy of protocols for key establishment in personal networks as well as describe and analyse specific protocols. We then use this taxonomy in surveying and comparing association models proposed in several emerging standards from security, usability and implementability perspectives.
Advanced features in SMART: the stochastic model checking analyzer for reliability and timing
Authors: Gianfranco Ciardo, Andrew S. Miner, Min Wan
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

We describe some of the advanced features of the software tool SmArT, the Stochastic Model checking Analyzer for Reliability and Timing. Initially conceived as a software package for numerical solution and discrete-event simulation of stochastic models, SmArT now also provides powerful modelchecking capabilities, thanks to its extensive use of various forms of decision diagrams, which in turn also greatly increase the efficiency of its stochastic analysis algorithms. These aspects make it an excellent choice when tackling systems with extremely large state spaces.