ppxscal/embedding_network huggingface dataset:
Employees' Behavior towards IS Security Policy Compliance
Authors: Seppo Pahnila, Mikko Siponen, Adam Mahmood
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The literature agrees that the major threat to IS security is constituted by careless employees who do not comply with organizations' IS security policies and procedures. To address this concern , different approaches for ensuring employees' IS security policy compliance have been proposed. Prior research on IS security compliance has criticized these extant IS security awareness approaches as lacking theoretically and empirically grounded principles to ensure that employees comply with IS security policies. To fill this gap, this study proposes a theoretical model that contains the factors that explain employees' IS security policy compliance. Data (N=245) from a Finnish company provides empirical support for the model. The results suggest tha t information quality has a significant effect on actual IS security policy compliance. Employees' attitude, normative beliefs and habits have significant effect on intention to comply with IS security policy. Threat appraisa l a nd facilitating conditions have significant impact on attitude towards complying, while coping appraisal does not have a significant effect on employees' attitude towards complying. Sanctions have insignificant effect on intention to comply with IS security policy a nd rewards do not have a significant effect on actual compliance with IS security policy.
A secure Linux platform
Authors: Nigel Edwards, Joubert Berger, Tse Huong Choo
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

This paper describes "HP Secure OS Software for Linux" (HP-LX) - a version of Linux that incorporates modifications into the kernel to improve security. A common attack strategy is to exploit a bug in a service causing it to execute code that downloads additional executables, and overwrites existing system executables and web pages. If the attack is in the form of a "worm", it will then probe the network looking for new targets. This paper argues that incorporating additional features into the underlying operating system best resists such attacks. HP-LX has mechanisms that contain a process within a known part of the system and place severe limits on the damage that can be caused by attacks. These mechanisms restrict communication to constrain the ability to interfere with and probe the network or other processes. They protect the file system and can prevent even root from overwriting files. In addition HP-LX has extensive auditing mechanisms for detecting compromised processes.
Dynamic Cache Size Tuning to Shorten Mobile Business Service Roundtrip Time
Authors: Allan K. Y. Wong, Jackei Wong
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The mobile business (mbusiness) mode has two sequential phases, mobile commerce (m-commerce) and electronic commerce (e-commerce). The m-commerce phase enables sales promotion by e-shops to galvanize potential customers within their short attention spans. Then, sales transactions are handled by the e-commerce phase. In this paper the dynamic cache size tuning technique, MACSC (Model for Adaptive Cache Size Control), is proposed for shortening the m-business service roundtrip time (RTT).
Realizations of the Associahedron and Cyclohedron
Authors: Christophe Hohlweg, Carsten E.M.C. Lange
Venue: Discrete Computational Geometry (2007)

We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them with the permutahedron of type A and B, respectively. The coordinates are obtained by an algorithm which uses an oriented Coxeter graph of type An or Bn as the only input data and which specializes to a procedure presented by J.-L. Loday for a certain orientation of An. The described realizations have cambrian fans of type A and B as normal fans. This settles a conjecture of N. Reading for cambrian lattices of these types.
Adaptive real-time anomaly detection with incremental clustering
Authors: Kalle Burbeck, Simin Nadjm-Tehrani
Venue: Information Security Tech. Report (2007)

Anomaly detection in information (IP) networks, detection of deviations from what is considered normal, is an important complement to misuse detection based on known attack descriptions. Performing anomaly detection in real-time places hard requirements on the algorithms used. First, to deal with the massive data volumes one needs to have efficient data structures and indexing mechanisms. Secondly, the dynamic nature of today's information networks makes the characterisation of normal requests and services difficult. What is considered as normal during some time interval may be classified as abnormal in a new context, and vice versa. These factors make many proposed data mining techniques less suitable for real-time intrusion detection. In this paper we present ADWICE, Anomaly Detection With fast Incremental Clustering, and propose a new grid index that is shown to improve detection performance while preserving efficiency in search. Moreover, we propose two mechanisms for adaptive evolution of the normality model: incremental extension with new elements of normal behaviour, and a new feature that enables forgetting of outdated elements of normal behaviour. These address the needs of a dynamic network environment such as a telecom management network. We evaluate the technique for network-based intrusion detection, using the KDD data set as well as on data from a telecom IP test network. The experiments show good detection quality and act as proof of concept for adaptation of normality.
On Utility Driven Deployment in a Distributed Environment
Authors: Debzani Deb, Michael J. Oudshoorn
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

By harnessing the computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and distributed across those resources in a way that maximizes the system's overall utility. However, building such a system is a staggering challenge because of the associated complexities. This paper proposes a selfmanaging distributed system ADE, that incorporates autonomic entities to handle the complexities associated with distribution, coordination and efficient execution of program components. The proposed approach models a centralized application in terms of an application graph consisting application components and then deploys the application components across the underlying hierarchically organized distributed resources so that all constraints and requirements are satisfied and the system's overall utility is maximized. Then, based on the observations obtained by the monitoring of the system resources, ADE redeploys the application graph to maintain maximized system utilization in spite of the dynamism and uncertainty involved in the system.
Self-Optimization of Clustered Message-Oriented Middleware
Authors: Christophe Taton, Noel De Palma, Jeremy Philippe, Sara Bouchenak
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Today's entreprise-level applications are often built as an assembly of distributed components that provide the basic services required by the application logic. As the scale of these applications increases, coarse-grained components will need be decoupled and will use message-based communication, often helped by Message-Oriented Middleware or MOMs. In the Java world, a standardized interface exists for MOMs: Java Messaging Service or JMS. And like other middleware, some JMS implementations use clustering techniques to provide some level of performance and fault-tolerance. One such implementation is JORAM, which is open-source and hosted by the ObjectWeb consortium. The full version of this paper intends to describe performance modeling of various clustering configurations and validate our model with performance evaluation in a reallife cluster. In doing that, we observed that the resource-efficiency of the clustering methods can be very poor due to local instabilities and/or global load variations.
Efficient polynomial L-approximations
Authors: Nicolas Brisebarre, Sylvain Chevillard
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most processes of evaluation of a function. We present a fast and efficient method, based on lattice basis reduction, that often gives the best polynomial possible and most of the time returns a very good approximation.
Image-based Visual Servoing of a Gough—Stewart Parallel Manipulator using Leg Observations
Authors: Nicolas Andreff, Tej Dallej, Philippe Martinet
Venue: International Journal of Robotics Research (2007)

In this paper, a tight coupling between computer vision and parallel robotics is exhibited through the projective line geometry. Indeed, contrary to the usual methodology where the robot is modeled independently from the control law that will be implemented, the proposed method takes into account, from the early modeling stage, the fact that vision will be used for control. Hence, kinematic modeling and projective geometry are fused into a control-devoted projective kinematic model. Thus, starting from a vision-based kinematic modeling of a Gough&#x2014;Stewart manipulator, a visual servoing scheme is presented, where the image projection (edges) of the non-rigidly linked legs are servoed, rather than the end-effector pose or the leg directions.
High performance graphic display with Tcl/Tk
Authors: Darren Spruce
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper describes how Tcl/Tk was used for the development of a high speed updating graph display. Tcl is not reputed for its performance and where real time graphics is required a purpose built 'C' program is necessary to cope with the speed. However Tcl/Tk along with the BLT graph widget extension provide a useful set of tools for GUI building and graph displays. This application shows how performance can be built in to an interpreted environment so that the developer can benefit from the high level of functionality offered by Tcl/Tk and BLT and at the same time display a spectrum of 16000 points updating every second. Although the application is designed to display data from a Multi Channel Analyser (MCA), the technique can easily be adapted to display other types of 2 column data.
Teaching an undergraduate class vs. graduate class: is there a difference?
Authors: R. Pendse
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

During the past few years, prior to obtaining his doctorate, the first author had considerable experience and success teaching several undergraduate courses in digital system design. The observation that the courses were successful is based on the credit-hour production and retention of the students in these classes. The author uses very novel and innovative teaching methods which have worked very well in the undergraduate classes. After completion of his doctorate, the author joined the Electrical Engineering Department at Wichita State University as a faculty member. As is generally the case, the author is now teaching one graduate course and one undergraduate course each semester. Are the novel ideas that work so well in the undergraduate classes being used in the graduate courses? If they are, are they working? Should a faculty member sit down and think about how he will teach a graduate course? Is mentorship from a senior faculty member desirable, especially as it pertains to teaching graduate courses? The focus of this paper is on describing the approach used and possible solutions to these questions.
Robust closed-loop pitch estimation for harmonic coders by time scale modification
Authors: Chunyan Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Harmonic coders that synthesize speech without transmitting phase information abandon the benefits of closed-loop parameter estimation via waveform matching. In this paper, we show that effective closed loop parameter estimation can be achieved when a suitable time-scale modification is applied to the speech LP residual in harmonic coders. The concept is demonstrated here specifically for pitch estimation, but is more broadly applicable. For each of a set of pitch candidates generated by a time-domain pitch estimator, the residual is modified to match the pitch contour derived from that candidate. The best candidate is selected by evaluating for each candidate the match between the modified residual and the synthesized residual. The new pitch estimation algorithm significantly reduces gross pitch errors compared to a conventional time-domain pitch estimator and enhances the perceptual performance of a 4 kbps harmonic coder.
How to Choose a Timing Model?
Authors: Idit Keidar, Alexander Shraer
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Does optimizing a protocol for better message complexity hamper the time complexity? In this paper, we investigate these types of questions using mathematical analysis as well as experiments over PlanetLab (WAN) and a LAN. We present a new and efficient leader-based consensus protocol that has O(n) stable-state message complexity (in a system with n processes) and requires only O(n) links to be timely at stable times. We compare this protocol with several previously suggested protocols. Our results show that a protocol that requires fewer timely links can achieve better performance, even if it sends fewer messages.
The Future of Programming Environments: Integration, Synergy, and Assistance
Authors: Andreas Zeller
Venue: 2007 Future of Software Engineering (2007)

Modern programming environments foster the integration of automated, extensible, and reusable tools. New tools can thus leverage the available functionality and collect data from program and process. The synergy of both will allow the automation of current empirical approaches. This leads to automated assistance in all development decisions for programmers and managers alike: "For this task, you should collaborate with Joe, because it will likely require risky work on the Mailbox class."
Integrating Two Haptic devices for Performance Enhancement
Authors: Enzo Pasquale Scilingo, Nicola Sgambelluri, Giovanni Tonietti, Antonio Bicchi
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This paper deals with a new configuration for a haptic system, which is able to simultaneously replicate independent force/displacement and force/area behaviors of a given material. Being force/area information a relevant additional haptic cue for improving softness discrimination, this system allows to extend the range of materials whose rheology can be carefully mimicked. Moreover, according to the Hertz theory, two objects with different curvature radius having the same force/displacement behavior can respond with different contact area to the same applied force. These behaviors can be effectively replicated by the integrated haptic system here proposed enabling and independent control of force/displacement and force/area. The system is comprised of a commercial device (Delta Haptic Device) serially coupled with a Contact Area Spread Rate (CASR) device. Two specimens of a material and two of another one, all with different curvature radii, were identified and modeled in terms of force/area and force/displacement. These behaviors were successfully tracked by the integrated haptic system here proposed.
An algorithm for glottal volume velocity estimation
Authors: A. Alkhairy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We present a new method for the estimation of the glottal volume velocity from voiced segments of the radiated acoustic speech pressure waveform. Our algorithm is based on spectral factorization of the signal and is a general purpose procedure. It does not suffer from residual effects or assume constraining models for the vocal tract and the glottal source, as is commonly the case with existing methods. The resulting estimate of the glottal volume velocity is accurate and can be used for modeling and synthesis purposes.
A phone-dependent confidence measure for utterance rejection
Authors: Z. Rivlin, M. Cohen, V. Abrash, T. Chung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

An acoustic confidence measure for acceptance/rejection of recognition hypotheses for continuous speech utterances is proposed. This measure is useful for rejecting utterances that are out of domain, or contain out-of-vocabulary words or speech disfluencies. A phone-based approach is implemented so that a single global threshold can be applied to hypothesis rejection for any word sequence. Phone confidence is computed for each frame of speech as the posterior phone probability given the acoustic observation. Word sequence confidence is evaluated as the average phone confidence, either by weighting all frames equally or by normalizing by phone duration. The confidence measure is tested on a database of spoken company names. When normalized by phone duration, it achieves, in some cases with less computational expense, rejection performance comparable to a baseline system implementing a common filler-model approach. When all frames are equally weighted, performance is substantially poorer.
Letters: Statistical criteria for early-stopping of support vector machines
Authors: Tatyana V. Bandos, Gustavo Camps-Valls, Emilio Soria-Olivas
Venue: Neurocomputing (2007)

This paper proposes the use of statistical criteria for early-stopping support vector machines, both for regression and classification problems. The method basically stops the minimization of the primal functional when moments of the error signal (up to fourth order) become stationary, rather than according to a tolerance threshold of primal convergence itself. This simple strategy induces lower computational efforts and no significant differences are observed in terms of performance and sparsity.
Improving the Performance of Global Communication on a 3D Torus Network
Authors: Yasushi Kawakura, Sigeru Oyanagi
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

The authors developed an one-to-all broadcasting algorithm which is less dependent on the increase of processors, by reducing the overhead of each communications, and by shortening the message transmission sequence. The result shows that the program which employs this algorithm can achieve a 2.8 times speedup in the case of a 32K processor system.
Ex-RBAC: An Extended Role Based Access Control Model for Location-aware Mobile Collaboration System
Authors: Xiutao Cui, Yuliang Chen, Junzhong Gu
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Role-based access control has established itself as a generalized approach for handling access control in collaboration systems. In a location-aware mobile collaboration environment, users can be restricted to assign roles only when (s)he satisfy some predefined identity and spatio-temporal constraint. To cope with these requirements, we extend the existing RBAC model and propose an extended Role-based Access Control (Ex- RBAC) model capable of expressing identity and spatiotemporal constraints.
Non-intrusive single-ended speech quality assessment in VoIP
Authors: Lijing Ding, Zhong Lin, Ayman Radwan, Mohamed Samy El-Hennawey, Rafik A. Goubran
Venue: Speech Communication (2007)

Evaluating speech quality in voice over Internet protocol (VoIP) in a non-intrusive manner is challenging, because it relies on a degraded speech signal only. In this paper, a parametric, non-intrusive VoIP speech quality assessment algorithm is proposed, which adopts a three-step strategy, impairment detection, individual effect modeling and an overall model. Mainly based on voice payload analysis, the algorithm also combines Internet protocol analysis approach and the ITU-T E-model. It quantifies the individual contributions to speech quality from several major VoIP impairments, including packet loss, temporal clipping and noise. Also, an overall assessment model is developed. The performance is evaluated through intensive simulations, and the results show that the algorithm is effective and accurate. For the overall model, the correlation between prediction and measurement is 0.90; the root mean square error (RMSE) is 0.27 mean opinion score (MOS). The algorithm aims to be implemented at the receive-end media gateway or IP terminal, for identifying the root causes of speech quality degradation as well as quality assessment in VoIP.
Efficient Gauss-related quadrature for two classes of logarithmic weight functions
Authors: James S. Ball, Nelson H. F. Beebe
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

Integrals with logarithmic singularities are often difficult to evaluate by numerical methods. In this work, a quadrature method is developed that allows the exact evaluation (up to machine accuracy) of integrals of polynomials with two general types of logarithmic weights. The total work for the determination of N nodes and points of the quadrature method is O(N2). Subsequently, integrals can be evaluated with O(N) operations and function evaluations, so the quadrature is efficient. This quadrature method can then be used to generate the nonclassical orthogonal polynomials for weight functions containing logarithms and obtain Gauss and Gauss-related quadratures for these weights. Two algorithms for each of the two types of logarithmic weights that incorporate these methods are given in this paper.
On frequency estimation from oversampled quantized observations
Authors: P. Handel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The effect of sampling and quantization on frequency estimation for a single sinusoid is investigated. Asymptotic Cramer-Rao bounds (CRB) for 1-bit quantization and for non-ideal filters are derived, which are simpler to calculate than the exact CRB while still relatively accurate. It is further investigated how many bits should be used in quantization to avoid the problems of 1-bit quantization, and it turns out that 3-4 bits are enough. Finally, oversampled 1-bit quantization is investigated. It is determined how much the signal should be oversampled, and in addition /spl Sigma//spl Delta/ modulators are investigated.