ppxscal/embedding_network huggingface dataset:
An On-Line Fault Detection Scheme for SBoxes in Secure Circuits
Authors: G. Di Natale, M.-L. Flottes, B. Rouzeyre
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

In this paper we propose an on-line fault detection architecture for bijective Substitution Boxes used in cryptographic circuits. Concurrent fault detection is important not only to protect the encryption/decryption process from random and production faults, it also protects the system against side-channel attacks, in particular those based on fault injection. We will prove that our solution is very effective while keeping the area overhead very low. Besides, we will analyze the correlation between the information processed by the circuit and the power consumption in order to asses the quality of the solution with respect to other side-channel attacks such as Power Analysis techniques.
Influence of carbonaceous electrodes on capacitance and breakdown voltage for hybrid capacitor
Authors: A. Albina, P. L. Taberna, J. P. Cambronne, P. Simon, E. Flahaut, T. Lebey
Venue: Microelectronics Journal (2007)

This paper presents a new type of capacitor and deals with a hybrid approach where the advantages of two systems, dielectric capacitors and the ultracapacitor are combined. The objective is to increase the capacitance and the energy storage capability, while or at least preserving or decreasing the volume of the passive components. In this aim, the surface area and structural properties of ultracapacitor electrodes and the high dielectric strength of a polymer material are associated. The surface roughness of the carbonbased electrodes, namely (activated carbon-AC, and carbon nanotubes-CNTs), has a good impact on the capacitance. However, the surface roughness also depends on the composition of carbonaceous materials and so does the capacitance. Moreover, the choice of the dielectric material is the key parameter. The better the impregnation of the roughness is, the better is the increase of the capacitance. Since the final objective is to improve the electrical energy stored by the capacitor, the effect of surface roughness on the breakdown voltage is also evaluated.
A Cryptographic Decentralized Label Model
Authors: Jeffrey A. Vaughan, Steve Zdancewic
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Information-flow security policies are an appealing way of specifying confidentiality and integrity policies in information systems. Most previous work on language-based security has assumed that programs run in a closed, managed environment and that they use potentially unsafe constructs, such as declassification, to interface to external communication channels, perhaps after encrypting data to preserve its confidentiality. This situation is unsatisfactory for systems that need to communicate over untrusted channels or use untrusted persistent storage, since the connection between the cryptographic mechanisms used in the untrusted environment and the abstract security labels used in the trusted language environment is ad hoc and unclear. This paper addresses this problem in three ways: First, it presents a simple, security-typed language with a novel mechanism called packages that provides an abstract means for creating opaque objects and associating them with security labels; well-typed programs in this language enforce noninterference. Second, it shows how to implement these packages using public-key cryptography. This implementation strategy uses a variant of Myers and Liskov's decentralized label model, which supports a rich label structure in which mutually distrusting data owners can specify independent confidentiality and integrity requirements. Third, it demonstrates that this implementation of packages is sound with respect to Dolev-Yao style attackers such an attacker cannot determine the contents of a package without possessing the appropriate keys, as determined by the security label on the package.
Group discussion techniques in a technical course
Authors: G. R. Blackwell
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper explains one instructor's use of the group discussion method of teaching in a technical electrical engineering technology course. The technique of group discussion as a teaching method is not new. Its use in technical courses, however, is uncommon. By noting the positive results from the use of this technique, the author suggests that others should consider it a teaching technique which increases students' interest and learning. 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
Lurking in the Shadows: Identifying Systemic Threats to Kernel Data
Authors: Arati Baliga, Pandurang Kamat, Liviu Iftode
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

The integrity of kernel code and data is fundamental to the integrity of the computer system. Tampering with the kernel data is an attractive venue for rootkit writers since malicious modifications in the kernel are harder to identify compared to their user-level counterparts. So far however, the pattern followed for tampering is limited to hiding malicious objects in user-space. This involves manipulating a subset of kernel data structures that are related to intercepting user requests or affecting the user's view of the system. Hence, defense techniques are built around detecting such hiding behavior. The contribution of this paper is to demonstrate a new class of stealthy attacks that only exist in kernel space and do not employ any hiding techniques traditionally used by rootkits. These attacks are stealthy because the damage done to the system is not apparent to the user or intrusion detection systems installed on the system and are symbolic of a more systemic problem present throughout the kernel. Our goal in building these attack prototypes was to show that such attacks are not only realistic, but worse; they cannot be detected by the current generation of kernel integrity monitors, without prior knowledge of the attack signature.
Boundary Negotiating Artifacts: Unbinding the Routine of Boundary Objects and Embracing Chaos in Collaborative Work
Authors: Charlotte P. Lee
Venue: Computer Supported Cooperative Work (2007)

Empirical studies of material artifacts in practice continue to be a rich source of theoretical concepts for CSCW. This paper explores the foundational concept of boundary objects and questions the conception that all objects that move between communities of practice are boundary objects. This research presents the results of a year-long ethnographic study of collaborative work, specifically the multidisciplinary collaborative design of a museum exhibition. I suggest that artifacts can serve to establish and destabilize protocols themselves and that artifacts can be used to push boundaries rather than merely sailing across them. Artifacts used for collaboration do not necessarily exist within a web of standardized processes and disorderly processes should not be treated as "special cases".
Implementation-Oriented Secure Architectures
Authors: Daniel Conte de Leon, Jim Alves-Foss, Paul W. Oman
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We propose a framework for constructing secure systems at the architectural level. This framework is composed of an implementation-oriented formalization of a system's architecture, which we call the formal implementation model, along with a method for the construction of a system based on elementary analysis, implementation, and synthesis steps. Using this framework, security vulnerabilities can be avoided by constraining the architecture of a system to those architectures that can be rigorously argued to implement all corresponding functional and security requirements, and no other. Furthermore, the framework enables the verification and validation of system correctness by enforcing traceability of final system components to their corresponding design, architecture, and requirement work products.
Induced lines in Hales--Jewett cubes
Authors: Demetres Christofides
Venue: Journal of Combinatorial Theory Series A (2007)

A line in [n]^d is a set {x^(^1^),...,x^(^n^)} of n elements of [n]^d such that for each 1=0. We also prove similar results for combinatorial, or Hales-Jewett, lines, i.e. lines such that only strictly increasing or constant sequences are allowed.
Efficient techniques for comprehensive protection from memory error exploits
Authors: Sandeep Bhatkar, R. Sekar, Daniel C. DuVarney
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

Despite the wide publicity received by buffer overflow attacks, the vast majority of today's security vulnerabilities continue to be caused by memory errors, with a significant shift away from stack-smashing exploits to newer attacks such as heap overflows, integer overflows, and format-string attacks. While comprehensive solutions have been developed to handle memory errors, these solutions suffer from one or more of the following problems: high overheads (often exceeding 100%), incompatibility with legacy C code, and changes to the memory model to use garbage collection. Address space randomization (ASR) is a technique that avoids these drawbacks, but existing techniques for ASR do not offer a level of protection comparable to the above techniques. In particular, attacks that exploit relative distances between memory objects aren't tackled by existing techniques. Moreover, these techniques are susceptible to information leakage and brute-force attacks. To overcome these limitations, we develop a new approach in this paper that supports comprehensive randomization, whereby the absolute locations of all (code and data) objects, as well as their relative distances are randomized. We argue that this approach provides probabilistic protection against all memory error exploits, whether they be known or novel. Our approach is implemented as a fully automatic source-to-source transformation which is compatible with legacy C code. The address-space randomizations take place at load-time or runtime, so the same copy of the binaries can be distributed to everyone - this ensures compatibility with today's software distribution model. Experimental results demonstrate an average runtime overhead of about 11%.
A 3-tier RAID storage system with RAID1, RAID5 and compressed RAID5 for Linux
Authors: K. Gopinath, Nitin Muppalaneni, N. Suresh Kumar, Pankaj Risbood
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

This paper presents the design and implementation of a host-based driver (a "volume manager") for a 3-tier RAID storage system, currently with 3 tiers: a small RAID1 tier and larger RAID5 and compressed RAID5 (cRAID5) tiers. Based on access patterns ("temperature"), the driver automatically migrates frequently accessed data to RAID1 while demoting not so frequently accessed data to RAID5/cRAID5. The prototype system, called "Temperature Sensitive Storage" (TSS), provides reliable persistence semantics for data migration between the tiers using ordered updates or logging. Mechanisms are separated from policies through an API so that any desired policy can be implemented in trusted user processes. We also discuss the problems faced while moving from the original implementation on the Solaris platform to Linux. Finally, we present comparison of the performance of our design with comparable systems using striping or RAID5.
Sorting-based localization and stable computation of zeros of a polynomial. I
Authors: Ya. E. Romm
Venue: Cybernetics and Systems Analysis (2007)

A method of stable address sorting is designed for localization and approximate computation of real and complex zeros of a polynomial. In an arbitrary domain, a software implementation of the method allows one to localize and to calculate with high accuracy all zeros of a polynomial, including the case when they are ill-separated. The vicinity of each zero dynamically decreases during localizing the boundaries of the domains of all zeros. Algorithms developed are formally described in the Object Pascal language and are implemented in the Delphi 7 environment. Some upper-bound estimates of a parallel version of the method are given.
Assessing User Acceptance of a Knowledge Management System in a Global Bank: Process Analysis and Concept Development
Authors: Cristof Bals, Stefan Smolnik, Gerold Riempp
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Many organizations pursue knowledge management (KM) initiatives, with different degrees of success. One key aspect of KM often neglected in practice is that it not only concerns technology. Technology merely provides the tools with which employees can leverage their knowledge in the context of their work. Thus, how employees perceive the technology and interact with it is assumed to play a major role in KM initiatives' success. This paper analyses patterns of user behavior and acceptance of knowledge management systems (KMS) to identify their relevance for a KM initiative's overall success. Using a combined single case study and literature review approach, we develop a model of user behavior and acceptance of KMS. By combining the user acceptance model with a model of context-specific influencing factors and the integrated KMS architecture by Riempp [35], we also present an integrated framework for approaching KM initiatives.
Segmentation algorithms for quantitative analysis of vascular abnormalities on three dimensional angiography
Authors: Albert C. Chung
Venue:  (2006)

Cerebrovascular disease, in particular intracranial atherosclerotic stenosis and cerebral aneurysm, is a common cause of stroke, which is the third leading cause of death in many places including Hong Kong. Understanding the geometric characteristics of those lesions is an essential part of diagnosis and endovascular treatment planning. In the clinical environment, quantitation of the lesions is often conducted on 2-D digital subtraction angiography (DSA). The quantitation may suffer from the foreshortening effect due to inappropriate X-ray projection angle selection and the non-linear magnification caused by the perspective projection. The technological advances in 3-D medical imaging open up new opportunities for the elucidation of the lesion characteristics. This motivates us to develop three novel algorithms for the segmentation of vessels and vascular lesions in 3-D angiography. The first and the second algorithms are low-level segmentation algorithms aiming at producing angiographic segmentation for the third algorithm to per form high-level segmentation of the atherosclerotic plaque volume and aneurysm body from the diseased portion of the arteries. Such an approach enables later interactive or automatic quantitative analyses on the pathological structures. In an in vivo study with nearly twenty angiograms, the results show that our method can help increase the measurement repeatability of the clinical parameters by more than ten times. Therefore, we believe that the works presented can help elucidate the lesion characteristics for diagnosis of the cerebrovascular diseases and endovascular treatment planning. Lastly, the direction of future studies is discussed in this dissertation.
Integrated kernels and their properties
Authors: Akira Tanaka, Hideyuki Imai, Mineichi Kudo, Masaaki Miyakoshi
Venue: Pattern Recognition (2007)

Kernel machines are widely considered to be powerful tools in various fields of information science. By using a kernel, an unknown target is represented by a function that belongs to a reproducing kernel Hilbert space (RKHS) corresponding to the kernel. The application area is widened by enlarging the RKHS such that it includes a wide class of functions. In this study, we demonstrate a method to perform this by using parameter integration of a parameterized kernel. Some numerical experiments show that the unresolved problem of finding a good parameter can be neglected.
TCP FECN: a unified solution for wireless networks
Authors: R. Chawla, S. Nandi
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Reliable transport protocols such as TCP are tuned to perform well in traditional wired networks, where packet losses occur mostly because of congestion. However, networks with wireless and other lossy links also suffer from significant losses due to bit errors and handoffs. TCP interprets these delays and losses as signs of network congestion and responds to all these losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. Most of the existing results of TCP for wireless networks are either take care of high bit error rate (BER) at the wireless links or the frequent handoffs and disconnections. This paper presents an integrated TCP mechanism to be used in mobile environments. It takes care of random bit errors on the wireless link, the congestion in the network and typical handoffs; in a cellular network scenario without violating end-to-end semantics.
Mayday: distributed filtering for internet services
Authors: David G. Andersen
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

Mayday is an architecture that combines overlay networks with lightweight packet filtering to defend against denial of service attacks. The overlay nodes perform client authentication and protocol verification, and then relay the requests to a protected server. The server is protected from outside attack by simple packet filtering rules that can be efficiently deployed even in backbone routers. Mayday generalizes earlier work on Secure Overlay Services. Mayday improves upon this prior work by separating the overlay routing and the filtering, and providing a more powerful set of choices for each. Through this generalization, Mayday supports several different schemes that provide different balances of security and performance, continuum, and supports mechanisms that achieve better security or better performance than earlier systems. To evaluate both Mayday and previous work, we also present several practical attacks, two of them novel, that are effective against filtering-based systems.
Influence of System, Environment, and Procedures on Knowledge Submission Frequency
Authors: Alexandra Durcikova, Susan A. Brown
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Organizations continue to struggle with encouraging employees to participate in knowledge management initiatives. Research is replete with examples of organizations that implemented knowledge management systems in order to find them under utilized. In this paper, we report the results of a case study conducted to examine the impact of system, environment, and procedures on knowledge submission frequency. Our findings indicate that in the absence of a consistently publicized procedure for knowledge management, system and environmental characteristics (i.e., supervisor relationship) are the most important factors in knowledge submission frequency. However, once the procedures are publicized clearly and repeatedly, system and procedural characteristics are most influential in predicting knowledge submission frequency.
Implementing Local Intervals in CASL
Authors: Regivan H. N. Santiago, Anamaria M. Moreira, Katiane R. Lopes
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper defines the basis for the implementation in CASL (Common Algebraic Specification Language) of an interval library such that intervals behave as real numbers endowed with an error information. To achieve that, we redefine the notion of interval local set defined in [R.H.N. Santiago. Interval local equality toward a model for real type. In Proceedings of the IV Workshop on Formal Methods, pages 54-59, Rio de Janeiro, RJ, 2001. Sociedade Brasileira de Computacao] in such a way that it can be implemented in the underlying logic of CASL. With these results, it is possible to manipulate intervals in CASL, as if they were real numbers, with equational reasoning, and get an error estimation on the obtained results for free (from the width of the resulting interval). The paper describes the CASL definition of the interval library and presents a case study on a simple example requiring handling data with ''tolerance'' margin.
Enhancing weak signal components in time-frequency distributions by wavelet pre-processing
Authors: Mingui Sun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Most real world signals consist of stronger low frequency components than high frequency ones. However, in many cases, high frequency components with small amplitude values represent the components of interest. Although time-frequency distributions (TFDs) have been commonly utilized to analyze such signals, the masking effect of large amplitude components, which severely reduce the sensitivity of TFDs, has been a significant problem. In this work we present a new method to pre-condition the input data using wavelet analysis and synthesis procedures before computing the TFD. This method attenuates interfering components in the TFD so that the masking effect is greatly reduced. EEG data are used to demonstrate the approach.
Error resilient H.264/AVC video over satellite for low packet loss rates
Authors: Shankar Manuel Aghito, Soren Forchhammer, Jakob D. Andersen
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

The performance of video over satellite is simulated. The error resilience tools of intra macroblock refresh and slicing are optimized for live broadcast video over satellite. The improved performance using feedback, using a crosslayer approach, over the satellite link is also simulated. The new Inmarsat BGAN system at 256 kbit/s is used as test case. This systems operates at low loss rates guaranteeing a packet loss rate of not more than 10-3. For high-end applications as "reporter-in-the-field' live broadcast, it is crucial to obtain high quality without increasing delay.
Getting the Best out of Software Process Simulation and Empirical Research in Software Engineering
Authors: Paul Wernick, Tracy Hall
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

This position paper sets out our views on the need to use simulation and quantitative experiments in combination in order to maximise the benefit of both to software engineering research. Each approach should be used to overcome weaknesses in the other in attempting to predict the behaviour of software processes when new or modified processes, tools or techniques are employed. We also express our concern at the frequently-encountered use of the term 'experiment' to describe quantitative simulation-based investigations.
Enforcing Constraints Between Documentary Comments and Source Code
Authors: C. Dylan Shearer, Michael L. Collard
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

An approach for enforcing constraints between program entities and their documentary comments is presented. The approach uses srcML to represent Java source code and introduces an XML format, namely srcDoc, for marking up Javadoc-style comments. The enforced constraints are specified with a combination of XML and XQuery. An Eclipse plugin is described that demonstrates the use of XML and related technologies to express and enforce constraints on documentary comments. Examples of constraints enforcing design rationale for methods in an API are shown.