ppxscal/embedding_network huggingface dataset:
Identity Anonymity for Grid Computing Coordination based on Trusted Computing
Authors: Zhiguo Shi, Yeping He, Xiaoyong Huai, Hong Zhang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

This paper proposes a novel anonymous coordination authentication scenario for Grid computing security based on Trusted Computing technology, which can provide efficient and reliable anonymous identity authentication and remote platform attestation for Grid computing systems. The scenario gives a method of tagging the rogue Grid entities. Architecture of virtual organization in distributed Grid system is introduced and a Reference Trusted Agent (RTA) with time self-authentication feature using Platform Configuration Register is built into the architecture. The hierarchy of RTA in the software and hardware system, which consists of three main modules, is pointed out in detail. Furthermore, the exchanging protocol of building trust in the mutual system platform is explained. A detailed description for enforcing the security of platform access control and applications is given. The scenario is interpreted in detail through five steps, then an example of the scenario is given and the security mechanisms are compared to GT2, GT3, GT4 and Trust Management.
Evaluating distributed xacml policies
Authors: Vijayant Dhankhar, Saket Kaushik, Duminda Wijesekera, Anil Nerode
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

We extend the XACML reference implementation so that a policyset consisting of remote references to other policies can be evaluated distributively. Our extension also covers requests to resources that need to be used exclusively. We do so by implementing a nested transaction model for the evaluation of distributed XACML policies. Experiments show reasonable performance of our access controller.
Testing Programs with the Aid of a Compiler
Authors: R. G. Hamlet
Venue: IEEE Transactions on Software Engineering (1977)

if finite input-output specifications are added to the syntax of programs, these specifications can be verified at compile time. Programs which carry adequate tests with them in this way should be resistant to maintenance errors. If the specifications are independent of program details they are easy to give, and unlikely to contain errors in common with the program. Furthermore, certain finite specifications are maximal in that they exercise the control and expression structure of a program as well as any tests can.
Mapgraph: efficient methods for complex olap hierarchies
Authors: Todd Eavis, Ahmad Taleb
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Online Analytical Processing is a database paradigm that provides for the rich analysis of multi-dimensional data. OLAP is often supported by a logical structure known as the Cube. However, supporting efficient OLAP query resolution in enterprise scale environments is an issue of considerable complexity. In practice, the difficulty of the problem is exacerbated by the existence of dimension hierarchies that sub-divide core dimensions into aggregation layers of varying granularity. Common hierarchy-sensitive query operations such as Rollup and Drilldown can be very costly on large cubes. Moreover, facilities for the representation of more complex hierarchical relationships are not well supported by conventional techniques. This paper presents a robust hierarchy infrastructure called mapGraph that supports the efficient and transparent manipulation of attribute hierarchies within OLAP environments. Experimental results verify that, when compared to the alternatives, very little additional overhead is introduced, even when advanced functionality is exploited.
Introduction
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2007)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of: "Delayed Password Disclosure," by Markus Jakobsson and Steven Myers. Many thanks to them for their contribution to this issue.
Web-based education for central-Finland students: the motto-project
Authors: Sanna Gröhn
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The paper describes a new instructional design, which utilises web-based education techniques, in a Finnish project called MOTTO. The instructional design offers students an opportunity to take a parallel curriculum in both the upper secondary school diploma and vocational diploma. Usage of web-based education techniques in vocational degree instruction makes this dual curriculum special. Moreover, the paper describes students' and their teachers' experiences using the new distance based vocational curriculum. Those experiences were compiled in interviews that were made in spring and summer 2006.
URU Plus -- a scalable component-based speaker-verification system for BT's 21st century network
Authors: M. Pawlewski, J. Jones
Venue: BT Technology Journal (2007)

Identity security is an issue that affects us all. In many everyday transactions, you have to prove that you are you (URU). BT has already established a market position with the award-winning URU product, that provides identity validation. A major extension to URU is URU Plus. This allows users to verify their identity through the use of speaker-verification technology. Following initial identity validation via URU, users are no longer required to produce documentary evidence for identity verification, but can instead verify themselves using their voice. The URU Plus system is a component integrated into BT's 21st century network authentication capability. It uses state-of-the-art voice verification technology and is accessed via a Web Service API.
Broadband ferromagnetic resonance measurements in Ni/ZnO and Niγ-Fe2 O3 nanocomposites
Authors: Vincent Castel, Jamal Ben Youssef, Christian Brosseau
Venue: Journal of Nanomaterials (2007)

A comparative study at the ambient temperature of the ferromagnetic resonance (FMR) spectra of Ni/ZnO and Ni/γ-Fe2O3 nanocomposites (NCs) is reported. A microstrip transmission line technique was used to measure the FMR profiles and linewidths in the 8-24 GHz frequency range. The samples were placed at the center of a microstrip line where the derivative of the absorbed power was measured using a standard ac field modulation technique (10 Oe amplitude) and lock-in detection. The analysis of the FMR spectra can be interpreted as arising from aggregates of magnetic nanoparticles, each of which resonates in an effective magnetic field composed of the applied field, the average (magnetostatic) dipolar field, and the randomly oriented magnetic anisotropy field. It is found that frequency and applied magnetic field strongly influence the lineshape of the FMR spectra. Two observations are identified within the FMR spectra. On the one hand, the resonance field increased linearly with frequency as expected from uniform mode theory and yielded a Landé g factor in the range 1.48-2.05. On the other hand, there is no clear correlation between FMR linewidths and frequency. Inhomogeneity-based line-broadening mechanisms, due to the damping of surface/interface effects and interparticle interaction, affect the FMR effective linewidth.
A New Approach to Enterprise Information Fusion: Choquet-Fuzzy-Integral-Based Neural Network
Authors: Zhengyou Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

On the basis of Enterprise Information Fusion concept, a new approach of EIF, i.e, Choquet-fuzzy-integral-based neural network is presented. In light of examining the structure characteristics of conventional neural networks, the initial size of the new neural network is determined, a learning algorithm for weight value estimation based on genetic algorithm and back propagation algorithm of neural network is given, and then using the pruning algorithm of general neural network the final size can be done. An experiment is used to verify the validation of the new neural network. And lastly, some discussions and potential trends centering around EIF methods are pointed out.
A Secure Communication Protocol for Low-Cost RFID System
Authors: Jung-Hyun Oh, Hyun-Seok Kim, Jin-Young Choi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In spite of application potentiality of RFID technology is un-describable, the RFID system has several privacy related problems such as the data leakage and data traceability which should be resolved before its pervasive employment. For this reason, a security protocol for the RFID system protection is considered to be the best solution to prevent the privacy related problems. However, previously proposed protocols which are designed to prevent such privacy related problems still have leaved several problems un-resolved. In this paper, we proposed a security protocol which is based on one time pad scheme using random nonce and shared secret values. The protocol satisfies the security requirements and the low-cost implementation requirement. Moreover, we have proved the security correctness of the proposed protocol by using GNY Logic to guarantee that there is no design flaw in our protocol.
On the Number of Multivalued Switching Functions Realizable by Cascades
Authors: T. Hikita
Venue: IEEE Transactions on Computers (1979)

Butler [6] gave recurrence relations for computing the number Nr(n) of r-valued (r = 2) switching functions of n variables realizable by a cascaded network of n - 1 r-valued cells. The cascades are assumed to have a fixed-input variable assignment. In this correspondence similar recurrence relations are presented for the number Mr(n) of such cascade realizable functions that
Comparison of envelope extraction algorithms for cardiac sound signal segmentation
Authors: Samjin Choi, Zhongwei Jiang
Venue: Expert Systems with Applications: An International Journal (2008)

This paper describes a comparative study of the envelope extraction algorithms for the cardiac sound signal segmentation. In order to extract the envelope curves based on the time elapses of the first and the second heart sounds of cardiac sound signals, three representative algorithms such as the normalized average Shannon energy, the envelope information of Hilbert transform, and the cardiac sound characteristic waveform (CSCW) are introduced. Performance comparison of the envelope extraction algorithms, and the advantages and disadvantages of the methods are examined by some parameters.
The design and implementation of a declarative sensor network system
Authors: David Chu, Lucian Popa, Arsalan Tavakoli, Joseph M. Hellerstein, Philip Levis, Scott Shenker, Ion Stoica
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Sensor networks are notoriously difficult to program, given that they encompass the complexities of both distributed and embedded systems. To address this problem, we present the design and implementation of a declarative sensor network platform, DSN: a declarative language, compiler and runtime suitable for programming a broad range of sensornet applications. We demonstrate that our approach is a natural fit for sensor networks by specifying several very different classes of traditional sensor network protocols, services and applications entirely declaratively -- these include tree and geographic routing, link estimation, data collection, event tracking, version coherency, and localization. To our knowledge, this is the first time these disparate sensornet tasks have been addressed by a single high-level programming environment. Moreover, the declarative approach accommodates the desire for architectural flexibility and simple management of limited resources. Our results suggest that the declarative approach is well-suited to sensor networks, and that it can produce concise and flexible code by focusing on what the code is doing, and not on how it is doing it.
Bayesian object extraction from uncalibrated image pairs
Authors: Hyung Il Koo, Sang Hwa Lee, Nam Ik Cho
Venue: Image Communication (2007)

This paper proposes a region-based algorithm for the extraction of foreground objects in uncalibrated images or video sequences. At the initialization step, a pair of images are overly segmented based on color and texture. Then, several dominant transforms that represent the relationship between two images are found, and each pixel is transformed by these transformations. By considering transform parameters and using the proposed area-ratio test, each pixel is assigned to a background or an object. We consider the resulting binary image as a binary random field, from which the likelihood of being foreground is computed for each initial segment. Using the likelihood model for each segment and the a priori assumption on the smoothness of labels, Bayesian approach is applied to label the segments. Experiments on various images and videos show promising results that the objects are clearly extracted.
Maximum mipmaps for fast, accurate, and scalable dynamic height field rendering
Authors: Art Tevs, Ivo Ihrke, Hans-Peter Seidel
Venue: Proceedings of the 2008 symposium on Interactive 3D graphics and games (2008)

This paper presents a GPU-based, fast, and accurate dynamic height field rendering technique that scales well to large scale height fields. Current real-time rendering algorithms for dynamic height fields employ approximate ray-height field intersection methods, whereas accurate algorithms require pre-computation in the order of seconds to minutes and are thus not suitable for dynamic height field rendering. We alleviate this problem by using maximum mipmaps, a hierarchical data structure supporting accurate and efficient rendering while simultaneously lowering the pre-computation costs to negligible levels. Furthermore, maximum mipmaps allow for view-dependent level-of-detail rendering. In combination with hierarchical ray-stepping this results in an efficient intersection algorithm for large scale height fields.
Successive Overrelaxation for Mamdani Fuzzy Systems
Authors: Qianfeng Cai, Zhifeng Hao, Xiaowei Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

To design a Mamdani fuzzy system with good generalization ability in high dimensional feature space, a novel learning algorithm based on the struct- ural risk minimization (SRM) inductive principle is presented in this paper. Firstly, the parameter estimation of a Mamdani fuzzy system is converted to a quadratic optimization problem. Then, a versatile iterative method, successive overrelaxation, is propo- sed. In the proposed algorithm, the fuzzy kernel generated by premise membership functions is proved to be a mercer kernel. Numerical experiments show that the presented algorithm improves the gener- alization ability of Mamdani fuzzy systems.
An integrated modelling framework to support manufacturing system diagnosis for continuous improvement
Authors: J. C. Hernandez-Matias, A. Vizan, J. Perez-Garcia, J. Rios
Venue: Robotics and Computer-Integrated Manufacturing (2008)

This paper proposes an integrated modelling framework for the analysis of manufacturing systems that can increase the capacity of modelling tools for rapidly creating a structured database with multiple detail levels and thus obtain key performance indicators (KPIs) that highlight possible areas for improvement. The method combines five important concepts: hierarchical structure, quantitative/qualitative analysis, data modelling, manufacturing database and performance indicators. It enables methods to build a full information model of the manufacturing system, from the shopfloor functional structure to the basic production activities (operations, transport, inspection, etc.). The proposed method is based on a modified IDEF model that stores all kind of quantitative and qualitative information. A computer-based support tool has been developed to connect with the IDEF model, creating automatically a relational database through a set of algorithms. This manufacturing datawarehouse is oriented towards obtaining a rapid global vision of the system through multiple indicators. The developed tool has been provided with different scorecard panels to make use of KPIs to decide the best actions for continuous improvement. To demonstrate and validate both the proposed method and the developed tools, a case study has been carried out for a complex manufacturing system.
Efficient preflow push algorithms
Authors: R. Cerulli, M. Gentili, A. Iossa
Venue: Computers and Operations Research (2008)

Algorithms for the maximum flow problem can be grouped into two categories: augmenting path algorithms [Ford LR, Fulkerson DR. Flows in networks. Princeton University Press: Princeton, NJ: 1962], and preflow push algorithms [Goldberg AV, Tarjan RE. A new approach to the maximum flow problem. In: Proceedings of the 18th annual ACM symposium on theory of computing, 1986; p. 136-46]. Preflow push algorithms are characterized by a drawback known as ping pong effect. In this paper we present a technique that allows to avoid such an effect and can be considered as an approach combining the augmenting path and preflow push methods. An extended experimentation shows the effectiveness of the proposed approach.
Patlet for Digital Forensics First Responders
Authors: Dirk Kotze, Martin S. Olivier
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The process of investigating a crime committed by using digital means is called Digital Forensics (DF). DF training is critical, especially since first responders to a digital crime scene often contaminate the evidence unknowingly. A pattern is a generic solution to a repeating problem. The authors propose a DF pattern template (patlet - as it is only a proposal) to govern the above-mentioned issue. The patlet is illustrated by its application using a live-CD based tool for first responder validation of DF evidence.
Control-Flow Aware Communication and Conflict Analysis of Parallel Processes
Authors: Axel Siebenborn, Alexander Viehl, Oliver Bringmann, Wolfgang Rosenstiel
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we present an approach for control-flow aware communication and conflict analysis of systems of parallel communicating processes. This approach allows to determine the global timing behavior of such a system and to detect communication that might produce conflicts on shared communication resources. Furthermore, we show the incorporation of temporal environment models in order to analyze their influence on the system behavior. Based on the determined conflicts, an automated allocation and binding approach for shared resources to resolve potential access conflicts is proposed. All analysis steps can be performed starting with a TLM SystemC model of the entire system without any need for user interaction. Finally, a SystemC model of a Viterbi decoder is used as case study to demonstrate the capability of our approach.
A Parallel Radix-4 Fast Fourier Transform Computer
Authors: M. J. Corinthios
Venue: IEEE Transactions on Computers (1975)

The organization and functional design of a parallel radix-4 fast Fourier transform (FFT) computer for real-time signal processing of wide-band signals is introduced.
Transforming an Ada Program Unit to Silicon and Verifying Its Behavior in an Ada Environment: A First Experiment
Authors: E. I. Organick
Venue: IEEE Software (1984)

Although the functional behavior of this IC was tested in system, the evaluation of circuit performance should not be long in coming.
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Authors: Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Several credential systems have been proposed in which users can authenticate to services anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user's privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems such as "e-cash" have been proposed in which users are deanonymized under only certain types of well-defined misbehavior such as "double spending." While useful in some applications, it is not possible to generalize such techniques to more subjective definitions of misbehavior. We present the first anonymous credential system in which services can "blacklist" misbehaving users without contacting a TTP. Since blacklisted users remain anonymous, misbehaviors can be judged subjectively without users fearing arbitrary deanonymization by a TTP.
Intelligent Simulation of Thermal Load of Sensors
Authors: Pavel Nevriva, Premysil Plesivcak
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Sensors are part and parcel of most automatic control systems. Thermal load of sensors affects the accuracy of measurement and control. Mathematical model of temperature field of a sensor is described by the Fourier partial differential equation. Validity of the mathematical model of temperature field of a sensor depends on accuracy of physical parameters describing both sensor and sensor's ambient. To rectify an estimate of parameters of the mathematical model, the laboratory physical model incorporating both the actual sensor and the sensor's real working assembly is constructed. The validation of the mathematical model is based on comparison of calculated surface temperature with that measured by the infrared camera on physical model. Image processing principles are used for models comparison. To determine the parameters of the model the artificial intelligence knowledge based system is applied. Both the general method and the complex case study results are presented.
Video digital watermark research based on MPEG4
Authors: Yang Wen, HuiLin Wu, Dehui Yin, Jie He, Bingfa Li, Hao Yin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper, based on DCT transform and image scrambling, presents the digital watermark embedding scheme. Embedding and extracting watermark in compressed video field are carried out in this way. In this paper, DCT transform is used as MPEG4 use DCT transform to compress. Before watermark is embedded, scrambling image is adopted to transform watermark information .Also, the embedding position of the watermark bit is modified by one chaos sequence, and this method promotes the robustness and the security of the watermark. Experiments make it clear that the scheme adopted in this paper satisfy the requirements for imperceptibility, robustness and security.