ppxscal/embedding_network huggingface dataset:
NAL Level Encryption for Scalable Video Coding
Authors: Chunhua Li, Xinxin Zhou, Yuzhuo Zhong
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we propose an encryption scheme for Scalable Video Coding (SVC). The proposed video encryption method provides secured SVC contents with selective encryption scheme. The main feature of this scheme is making use of the characteristics of Scalable Video Coding. The encryption procedures are carried out at the Network Abstractor Layer (NAL) level. Of all NAL units, Instantaneous Decoding Refresh (IDR) Picture, Sequence Parameter Set (SPS), and Picture Parameter Set (PPS) are encrypted with a stream cipher. Leak EXtraction (LEX) algorithm is adopted to reduce computational cost. Experiments were performed to verify the proposed methods using the joint scalable video model (JSVM), and the experimental results show that the proposed methods could provide high security, low computational cost as well as support a video encryption with scalability function.
Pudding Building
Authors: ByungKyu Kim, HyunDong Kim, Dongjo Kim, JungHwa Han, Unzi Kim
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

A visualisation of tremors that affect an Asian building symbolises a rapidly changing people's social cognition and a contracting social structure. Max/MSP, Jitter, and Arduino are used to capture the image of the miniature building, for image processing, for detecting the number of viewers, and to operate vibrating motors.
An economic model of software quality costs
Authors: Amel Kolašinac, Ljubomir Lazic, Dženan Avdic
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

As of today there is very little knowledge is available about the economics of software quality. The costs incurred and benefits of implementing different quality practices over the software development life cycle are not well understood. There are some prepositions, which are not being tested comprehensively, but some useful Economic Model of Software Quality Costs (CoSQ) and data from industry are described in this article. Significant research is needed to understand the economics of implementing quality practices and its behaviour. Such research must evaluate the cost benefit trade-offs in investing in quality practices where the returns are maximized over the software development life cycle.
An Edge-Preserving Super-Precision for Simultaneous Enhancement of Spacial and Grayscale Resolutions
Authors: Hiroshi Hasegawa, Toshinori Ohtsuka, Isao Yamada, Kohichi Sakaniwa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a method that recovers a smooth high-resolution image from several blurred and roughly quantized low-resolution images. For compensation of the quantization effect we introduce measurements of smoothness, Huber function that is originally used for suppression of block noises in a JPEG compressed image [Schultz & Stevenson '94] and a smoothed version of total variation. With a simple operator that approximates the convex projection onto constraint set defined for each quantized image [Hasegawa et al. '05], we propose a method that minimizes these cost functions, which are smooth convex functions, over the intersection of all constraint sets, i.e. the set of all images satisfying all quantization constraints simultaneously, by using hybrid steepest descent method [Yamada & Ogura '04]. Finally in the numerical example we compare images derived by the proposed method, Projections Onto Convex Sets (POCS) based conventinal method, and generalized proposed method minimizing energy of output of Laplacian.
Interval arithmetic error estimation for the solution of Fredholm integral equation
Authors: Ivo Babuska, Kang-Man Liu
Venue: International Journal of Computer Mathematics (2009)

Finite element method with a posteriori estimation using interval arithmetic is discussed for a Fredholm integral equation of the second kind. This approach is general. It leads to the guaranteed L∞ asymptotically exact estimate without the usual overestimation when interval arithmetic is used. An algorithm is provided for determination of an approximate solution such that the computed error bound between the exact solution and its approximation in L∞ is less than the given tolerance ε. Numerical solution for the equation with only C1 kernel illustrates the approach.
A detection cell using multiple points of a rotating triangle to find local planar regions from stereo depth data
Authors: Dong-Joong Kang, Sung-Jo Lim, Jong-Eun Ha, Mun-Ho Jeong
Venue: Pattern Recognition Letters (2009)

This paper presents a method to recognize plane regions for unobstructed motion of mobile robots. When an autonomous agency, using a stereo camera or a laser scanning sensor, is in an unknown 3D environment, the mobile agency must detect the plane regions so that it can independently decide its direction of movement in order to perform assigned tasks. In this paper, a fast method of plane detection is proposed, wherein the normal vector of a triangle is inscribed in a small circular region such that the normal vector passes through the circumcenter area of the triangle. To reduce the effects of noise and outliers, the triangle is rotationally sampled with respect to the center position of the circular region, and a series of inscribed triangles having different normal vectors is generated. The direction vectors of these generated triangles are normalized and the median direction of the normal vectors is then used to test the planarity of the circular region. A pose finding procedure is introduced from range data of a surface to decide the scale and rotation angle of the circular region superimposed on range image data. The method of plane detection is very fast as computation of local information about the plane typically requires sub-ms duration, and the performance of the algorithm for real range data obtained from a stereo camera system has been verified.
Integrated voice/data compression and multiplexing using associative processing
Authors: Leon D. Wald
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Associative Communications Multiplexer (ACM) concept is based upon the Associative Processor (AP). For the purposes of the following discussion, an AP will be defined as an ensemble of processing Elements (PEs), each capable of storing information, comparing that information with an internal or externally applied comparand argument, and performing arithmetic operations between the various internal and external operands. The same operation---store, compare, or process---may be executed on the differing local data, simultaneously in all or any subset of processing elements. A single control unit, with internal program memory, supplies instructions in parallel to all PEs to control their operations.
Proofs of Retrievability via Hardness Amplification
Authors: Yevgeniy Dodis, Salil Vadhan, Daniel Wichs
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in which the server proves that it (still) possesses the client's data. Constructions of PoR schemes attempt to minimize the client and server storage, the communication complexity of an audit, and even the number of file-blocks accessed by the server during the audit. In this work, we identify several different variants of the problem (such as bounded-use vs. unbounded-use, knowledge-soundness vs. information-soundness), and giving nearly optimal PoR schemes for each of these variants. Our constructions either improve (and generalize) the prior PoR constructions, or give the first known PoR schemes with the required properties. In particular, we Formally prove the security of an (optimized) variant of the bounded-use scheme of Juels and Kaliski [JK07], without making any simplifying assumptions on the behavior of the adversary. Build the first unbounded-use PoR scheme where the communication complexity is linear in the security parameter and which does not rely on Random Oracles, resolving an open question of Shacham and Waters [SW08]. Build the first bounded-use scheme with information-theoretic security. The main insight of our work comes from a simple connection between PoR schemes and the notion of hardness amplification, extensively studied in complexity theory. In particular, our improvements come from first abstracting a purely information-theoretic notion of PoR codes, and then building nearly optimal PoR codes using state-of-the-art tools from coding and complexity theory.
A study on the use of statistical tests for experimentation with neural networks: Analysis of parametric test conditions and non-parametric tests
Authors: Julián Luengo, Salvador García, Francisco Herrera
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we focus on the experimental analysis on the performance in artificial neural networks with the use of statistical tests on the classification task. Particularly, we have studied whether the sample of results from multiple trials obtained by conventional artificial neural networks and support vector machines checks the necessary conditions for being analyzed through parametrical tests. The study is conducted by considering three possibilities on classification experiments: random variation in the selection of test data, the selection of training data and internal randomness in the learning algorithm. The results obtained state that the fulfillment of these conditions are problem-dependent and indefinite, which justifies the need of using non-parametric statistics in the experimental analysis.
Session management architecture for implementing an FPGA-based stateful intrusion detection system
Authors: Seungyong Yoon, Byoungkoo Kim, Jintae Oh, Jongsoo Jang
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This paper relates to session management architecture and mechanism for implementing an FPGA-based stateful intrusion detection system. Our proposed architecture can help to perform Stateful Packet Inspection(SPI) in real time using a new session table management scheme that allows more efficient generation of session state information in intrusion detection system. SPI is an important technique to reduce false positive alerts in network intrusion detection system(NIDS). As the number of session increases, this technique requires a higher processing speed, thereby causing performance problems. However, existing software-based solutions cannot perform real-time packet inspection ensuring the wire speed. To guarantee both performance and functionality with respect to statefulness, we designed and implemented SPI-based intrusion detection module in a FPGA to help alleviating a bottleneck in network intrusion detection systems in this paper.
Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying G2 continuity
Authors: Seok Hur, Min-jae Oh, Tae-wan Kim
Venue: Computer-Aided Design (2009)

We present a new method of approximating the intersection curves of two parametric surfaces. Our approximation satisfies G^2 continuity conditions, and is located within a prescribed distance from the exact intersection curve. First we identify the topology of the pre-image of the intersection in the domain of surface using extended [Grandine TA, Klein FW. A new approach to the surface intersection problem. Computer Aided Geometric Design 1997;14(2):111-34]'s topology determination method [Hur S, Oh M-J, Kim T-W. Classification and resolution of critical cases in Grandine-Klein's topology determination using a perturbation method. Computer Aided Geometric Design (2008). in press [doi:10.1016/j.cagd.2008.03.003]]. Then, we choose a segment of the pre-image, identify the tangential directions and the signed curvatures at its two end-points, and construct a G^2 Hermite interpolation using a rational cubic Bezier curve. We go on to find the exact maximum error of the approximation, and the point at which that error occurs, using the Hausdorff distance function. If the error is larger than a prescribed error bound @e, we subdivide the segment at the point of maximum error, and apply the G^2 interpolation process to the two new segments. We continue this recursive process until we have an approximation of the pre-image with an error smaller than @e. We also find the maximum error bound of the approximation in the model space R^3; and the bound on the distance, in model space, between the approximations which come from the domain of each surface. We verify our method with several examples.
Cadmium: An Implementation of ACD Term Rewriting
Authors: Gregory J. Duck, Leslie Koninck, Peter J. Stuckey
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Cadmium is a rule based programming language for compiling solver independent constraint models to various solver dependent back-ends. Cadmium is based on a hybrid between Constraint Handling Rules (CHR) and term rewriting modulo Associativity, Commutativity and a restricted form of Distributivity (ACD) called Conjunctive Context (CC). Experience with using Cadmium in the G12 project shows that CC is a powerful language feature, as local model mapping can depend on some non-local context, such as variable declarations or other constraints. However, CC significantly complicates the Cadmium normalisation algorithm, since the normal form of a term may depend on what context it appears in. In this paper we present an implementation of Cadmium based on classic bottom-up evaluation, but modified to handle CC matching. We evaluate the performance of the new implementation compared to earlier prototype normalisation algorithms. We show that the resulting system is fast enough to run "real-world" Cadmium applications.
backchan.nl: integrating backchannels in physical space
Authors: Drew Harry, Joshua Green, Judith Donath
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we describe backchan.nl, a web based backchannel system that focuses on providing greater audience participation during question and answer sessions. The system allows audience members to use a web-based service to propose questions and comments, and to vote on the questions of others. Top rated submissions are projected into the presentation space where audience members, moderators, and panelists can see them. We discuss the results of deploying this system at many different kinds of conferences and relate those results to the particular design of our system, demonstrating how backchannel systems can be more than just shared chat rooms. From our experience with this work, we discuss the broader implications of configurable mediated social spaces and how subtle design decisions can influence user experience
Using Workflow for Dynamic Security Context Management in Grid-based Applications
Authors: Yuri Demchenko, Leon Gommans, Cees Laat, Arie Taal, Alfred Wan, Olle Mulmo
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

This paper presents ongoing research and current results on the development of flexible access control infrastructures for complex resource provisioning in Grid-based collaborative applications and on-demand network services provisioning. We investigate the use of workflow concepts for the required orchestration of multiple Grid resources and/or services across multiple administrative and security domains. In particular, workflow execution and management tools can be used to track security context changes that are dependent on the application domain, execution stage defined policies, or user and/or service attributes. The paper discusses what specific functionality should be added to Grid-oriented authorization frameworks to handle such dynamic service-related security contexts. As an example, the paper explains how such functionality can be achieved in the GAAA Authorization framework and GAAA toolkit. Suggestions are given about integration with the Globus Toolkit's Authorization Framework. Additionally, the paper analyses what possibilities of expressing and handling dynamic security contexts are available in XACML and SAML, and how the VO concept can be used for managing dynamic security associations of users and resources. The paper is based on experiences gained from major Grid based and Grid oriented projects such as EGEE, NextGrid, Collaboratory. nl and GigaPort Research on Network.
A card-sorting probe of e-banking trust perceptions
Authors: Tim French, Kecheng Liu, Mark Springett
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

This paper investigates the issue of trust mediation in e-Banking. The card sorting technique was used to probe factors influencing subjects' attitudes to alternative e-banking homepage designs. The subjects also provided their trust perceptions for the same sites. These were cross-referenced with constructs generated in the card-sort to investigate the relationship between tangible and intangible trust mediators, including the interplay between site design and usability. The study findings suggest that the degree of effectiveness of tangible factors, such as security policy and trust seals, may be subtly influenced by design phenomena related to usability. The findings are articulated using Gambetta's theory of trust within an e-banking context. These are mapped to the layers of a semiotic trust ladder.
Evaluation of semantic events for legal case retrieval
Authors: K. Tamsin Maxwell, Jon Oberlander, Victor Lavrenko
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

Legal argument is based on the facts of a case as well as legal issues, concepts and factors. We assess the feasibility of using semantic events extracted from court judgements to adequately represent the legal concepts and factual content of cases for legal information retrieval (IR). Results of a preliminary study show extracted events are attributed with 74% accuracy, 72% legal importance, and representing 86% of sentence meaning.
A DoS-resilient en-route filtering scheme for sensor networks
Authors: Chia-Mu Yu, Chun-Shien Lu, Sy-Yen Kuo
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The major contribution of this paper is to propose a robust en-route filtering scheme for data authentication in sensor networks without relying on unrealistic assumptions.
Switching properties of an arbitrarily excited nonlinear electron-wave directional coupler
Authors: Andreas F. Terzis, Emmanuel Paspalakis
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

We theoretically investigate the switching properties of nonlinear electron-wave directional couplers by applying the coupled mode theory. Analytical results for the probability of finding the electron wave in each waveguide, for arbitrary initial occupation of each waveguide, are presented. Our findings reveal that several technologically important cases can be achieved, such as significant or complete electron transfer between the waveguides or trapping of the electron wave in the initial state, depending on the structural parameters of the device. In addition, for specific values of the initial state of the system the important case of symmetry breaking is realized.
Intrusion Detection for Wireless Sensor Networks Based on Multi-agent and Refined Clustering
Authors: Huai-bin Wang, Zheng Yuan, Chun-dong Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In this paper, we put forward a model of multi-agent based on intrusion detection system for wireless sensor networks, and a new method of detection called refined clustering, which is suggested running on some agents. In this new method we use self-organizing map (SOM) neural network to cluster roughly the samples, and the next step the K-means clustering algorithm is adopted to refine the clustering. By the characters of wireless sensor networks and the differences between common nodes and cluster headers, each agent has different tasks and its strategy of detection is also different. These agents carries the new detection method can cooperate with each other, which would make our system have the advantages of high detection rate, good expansibility and lower cost.
User-created forms as an effective method of human-agent communication
Authors: John Zimmerman, Kathryn Rivard, Ian Hargraves, Anthony Tomasic, Ken Mohnkern
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

A key challenge for mixed-initiative systems is to create a shared understanding of the task between human and agent. To address this challenge, we created a mixed-initiative interface called Mixer to aid administrators with automating tedious information-retrieval tasks. Users initiate communication with the agent by constructing a form, creating a structure to hold the information they require and to show context in order to interpret this information. They then populate the form with the desired results, demonstrating to the agent the steps required to retrieve the information. This method of form creation explicitly defines the shared understanding between human and agent. An evaluation of the interface shows that administrators can effectively create forms to communicate with the agent, that they are likely to accept this technology in their work environment, and that the agent's help can significantly reduce the time they spend on repeated information-retrieval tasks.
Data Filtering Based Recursive Least Squares Parameter Estimation for ARMAX Models
Authors: Yuwu Liao, Dongqing Wang, Feng Ding
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper uses an estimated noise transfer function to filter the input-output data and presents a filtering based recursive least squares algorithm for ARMAX models. Through the data filtering, we obtain two identification models, one including the parameters of the system model, and the other including the parameters of the noise model. Thus, the recursive least squares method can estimate the parameters of these two identification models, respectively, by replacing unmeasurable noise terms in the information vectors with their estimates. The proposed F-RLS algorithm has high computational efficiency because the dimensions of its covariance matrices become small and can generate more accurate parameter estimation compared with other existing algorithms.