ppxscal/embedding_network huggingface dataset:
Dependable distributed embedded system assessment platform design
Authors: Qiang Huang, Liang XiaoFeng, Zhu Yingying
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Dependable distributed embedded systems (DDES) are being deployed widely in automobile industry over the world. These systems always post rigorous requirement for timing accuracy and reliability. Both hardware and software architecture have important effect on the system dependability. Adding or substitute for more reliable hardware could increase the system reliability moreover achieves faster system response. Apparently this would increase the manufacturing cost, while software could be a more cost-effective ways for providing support for dependable distributed embedded system development. The dependable distributed embedded system assessment platform (DDESAP) which based on vehicle control system provides testing and assessment support for various automobile dependable software. DDESAP evaluates the vehicle control hardware and operational environments. Software architectures such as time-triggered, event-triggered, hybrid-triggered and other fault tolerant mechanisms for dependable distributed embedded systems were tested on DDESAP. A vehicle dynamic model, a motorway traffic model, and a driver model were developed for DDESAP. Simulation show these models comply with manufacturer and empirical data. DDESAP enables the evaluation of novel software architectures for safety-critical automobile control systems, like the fault tolerant adaptive cruise control systems (ACCS) presented.
A User-centric Federated Single Sign-on System
Authors: Suriadi Suriadi, Ernest Foo, Audun Josang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

There is a lack of built-in privacy mechanisms within the current identity management systems. The guarantee a user has about their privacy is merely the "trust' that the service providers will enforce their privacy requirements. The contribution of this paper is a proposal for the extension of existing Federated Single Sign-On (FSSO) systems to adopt the beneficial properties of the User-Centric Identity Management (UCIM) model to provide an identity management system that allows the users to control and enforce their privacy requirements while still retaining the convenient features of FSSO. By having an identity management system that respects user's privacy in a concrete manner as opposed to a simple "trust', users will trust the current electronic communication medium more and hence allows more services to grow in this field.
The Architecture of CAR Component Web Services
Authors: Mingyi Mao, Zhicheng Chen, Qian Mo
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

CAR (Component Assembly Runtime) is a new component-oriented programming technology. Web Services is a developing technology for internet system. In this Paper, we put forward a new architecture of Web Services based on CAR component technology, which is called CAR Web Services. We design and implement the architecture, components, interfaces, and relational methods of which. We analyses the working flowchart of CAR Web Server and CAR Web Services Proxy. On the CAR component running platform, this architecture makes Web Services components to be released on Internet and invoked by remote client automatically or easily.
Working Sets Past and Present
Authors: P. J. Denning
Venue: IEEE Transactions on Software Engineering (1980)

A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.
Nonredundant Point Distribution for Coded Aperture Imaging with Application to Three-Dimensional On-Line X-Ray Information Retrieving
Authors: H. Weiss
Venue: IEEE Transactions on Computers (1975)

Conventional methods of displaying three-dimensional information in X-ray diagnostics like tomography or tomosynthesis are not capable of imaging fast moving objects because of the time-sequential recording process. To overcome this difficulty the method of coded aperture imaging using nonredundant point distributions is applied to X-ray imaging. The object coded by an array of X-ray sources is deconvoluted by means of an optical processing system using monochromatic, but spatially incoherent light. Experimental results obtained with simple objects show good resolution in detail as well as in depth. Moreover, an on-line system has been simulated using coded images on X-ray films with a TV-camera pick up in conjunction with an electrooptic relay tube.
Unconscious word processing engages a distributed network of brain regions
Authors: Michele T. Diaz, Gregory McCarthy
Venue: Journal of Cognitive Neuroscience (2007)

A briefly exposed visual stimulus may not be consciously perceived if it is preceded and followed by a dissimilar visual pattern or mask. Despite the subject's lack of awareness, prior behavioral studies have shown that such masked stimuli, nevertheless, engage domain-specific processes [Dehaene, S., Naccache, L., Cohen, L., Le Bihan, D., Mangin, J.-F., Poline, J.-B., et al. Cerebral mechanisms of word masking and unconscious repetition priming. Nature Neuroscience, 4, 752--758, 2001; Bar, M., & Biederman, I. Subliminal visual priming. Psychological Science, 9, 464--469, 1998; Dehaene, S., Naccache, L., Le Clec'H, G., Koechlin, E., Mueller, M., Dehaene-Lambertz, G., et al. Imaging unconscious semantic priming. Nature, 395, 597--600, 1998; Whalen, P. J., Rauch, S. L., Etcoff, N. L., McInerney, S. C., Lee, M. B., & Jenike, M. A. Masked presentations of emotional facial expressions modulate amygdala activity without explicit knowledge. Journal of Neuroscience, 18, 411--418, 1998; Marcel, A. J. Conscious and unconscious perception: Experiments on visual masking and word recognition. Cognitive Psychology, 15, 197--237, 1983]. Masking thus provides a method for identifying language processes that are preattentive and automatic. Functional magnetic resonance imaging used in concert with masking may identify brain regions engaged by these unconscious language processes. In an adaptation design, subjects viewed a continuous stream of masked words and masked nonwords while performing an unrelated detection task, in which they were asked to make a response to a visible colored nonword stimulus (i.e., ampersands in red or blue font). Most trials were masked nonwords and masked words were presented once every 12--15 sec. The task ensured participant engagement, while the masked nonword baseline controlled for perceptual and orthographic processing. Participants were naïve to the purpose of the experiment and testing indicated that they did not consciously perceive either the words or nonwords. Masked words, but not masked nonwords, strongly activated left hemisphere language regions, including Broca's area, the angular gyrus, and the lateral temporal lobe. Differential activation of the posterior corpus callosum was also observed.
The Impact of Group Size on Software Architecture Evaluation: A Controlled Experiment
Authors: Muhammad Ali Babar, Barbara Kitchenham
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Background: An important element in scenario-based architecture evaluation is the development of scenario profiles by stakeholders working in groups. In practice groups can vary in size from 2 to 20 people. Currently, there is no empirical evidence about the impact of group size on the scenario development activity. Goal: Our experimental goal was to investigate the impact of group size on the quality of scenario profiles developed by different sizes of groups. Experimental design: We had 165 subjects, who were randomly assigned to 10 groups of size 3, 13 groups of size 5, and 10 groups of size 7. Participants were asked to develop scenario profiles. After the experiment each participant completed a questionnaire aimed at identifying their opinion of the group activity. Result: The average quality score for group scenario profiles for 3 person groups was 362.4, for groups of 5 person groups was 534.23 and for 7 person groups was. 444.5. The quality of scenario profiles for groups of size 5 was significantly greater than the quality of scenario profiles for groups of size 3 (p=0.025), but there was no difference between the size 3 and size 7 groups. However, participants in groups of size 3 had a significantly better opinion of the group activity outcome and their personal interaction with their group than participants in groups of size 5 or 7. Conclusion: Our results suggest that the quality of the output from a group does not increase linearly with group size. However, individual participants prefer small groups. This means there is a trade-off between group output quality and the personal experience of group members.
Non-Local Text Image Reconstruction
Authors: H. Luong, W. Philips
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we present a novel method for reconstruct- ing low-resolution text images. Unlike other conventional interpolation methods, the unknown pixel value is not esti- mated based on its local surrounding neighbourhood, but on the whole text image. In particularly, we exploit the repetitive behaviour of the characters. A great advantage of our proposed approach is that we have more informa- tion at our disposal, which leads to a better reconstruction of the interpolated image. Results show the effectiveness of our proposed method and its superiority at very large mag- nifications to traditional interpolation methods.
Receipt management- transaction history based trust establishment
Authors: Abhilasha Bhargav-Spantzel, Jungha Woo, Elisa Bertino
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerningcurrent transactions. One category of such systems is represented by the reputation systems. However, despite the growing body of experience in building reputation systems, there are several limitations on how they are typically implemented. They often rely on scores that are evaluated by service providers and are often not reliable or well understood. We believe that reputation hasto be based on objective and reliable information. In such context, transaction histories play an important role. In this paper, we present the VeryIDX systemthat implements an electronic receipt infrastructure and supports protocols to build and manage online transaction history of users. The receipt protocols are shown to have several essential security and privacy properties. We present a basic yet reasonably expressive language which provides service providers with a new way to establish trust based on users' transaction history. We alsodescribe the architecture and prototype implementation of VeryIDX, based on several important design considerations of a real-world e-commerce system infrastructure.
A Framework for Outlier Mining in RFID data
Authors: Elio Masciari
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Radio Frequency Identification (RFID) applications are emerging as key components in object tracking and supply chain management systems. In next future almost every major retailer will use RFID systems to track the shipment of products from suppliers to warehouses. Due to RFID readings features this will result in a huge amount of information generated by such systems when costs will be at a level such that each individual item could be tagged thus leaving a trail of data as it moves through different locations. We define a technique for efficiently detecting anomalous data in order to prevent problems related to inefficient shipment or fraudulent actions. Since items usually move together in large groups through distribution centers and only in stores do they move in smaller groups we exploit such a feature in order to design our technique. The preliminary experiments show the effectiveness of our approach.
CBS constants for multilevel splitting of graph-Laplacian and application to preconditioning of discontinuous Galerkin systems
Authors: R. D. Lazarov, S. D. Margenov
Venue: Journal of Complexity (2007)

The goal of this work is to derive and justify a multilevel preconditioner of optimal arithmetic complexity for symmetric interior penalty discontinuous Galerkin finite element approximations of second order elliptic problems. Our approach is based on the following simple idea given in [R.D. Lazarov, P.S. Vassilevski, L.T. Zikatanov, Multilevel preconditioning of second order elliptic discontinuous Galerkin problems, Preprint, 2005]. The finite element space V of piece-wise polynomials, discontinuous on the partition T, is projected onto the space of piece-wise constant functions on the same partition that constitutes the largest space in the multilevel method. The discontinuous Galerkin finite element system on this space is associated to the so-called ''graph-Laplacian''. In 2-D this is a sparse M-matrix with -1 as off diagonal entries and nonnegative row sums. Under the assumption that the finest partition is a result of multilevel refinement of a given coarse mesh, we develop the concept of hierarchical splitting of the unknowns. Then using local analysis we derive estimates for the constants in the strengthened Cauchy-Bunyakowski-Schwarz (CBS) inequality, which are uniform with respect to the levels. This measure of the angle between the spaces of the splitting was used by Axelsson and Vassilevski in [Algebraic multilevel preconditioning methods II, SIAM J. Numer. Anal. 27 (1990) 1569-1590] to construct an algebraic multilevel iteration (AMLI) for finite element systems. The main contribution in this paper is a construction of a splitting that produces new estimates for the CBS constant for graph-Laplacian. As a result we have a preconditioner for the system of the discontinuous Galerkin finite element method of optimal arithmetic complexity.
Soft output decision convolutional (SONNA) decoders based on the application of neural networks
Authors: Stevan M. Berber
Venue: Engineering Applications of Artificial Intelligence (2008)

The paper investigates principles of work and BER characteristics of a new soft decision algorithm for decoding convolutional codes that is based on neural network applications. The novelty of the algorithm is in its capability to generate soft output estimates of the message bits encoded. For this purpose the noise energy function, which is defined and used for the neural network decoding of convolutional codes, has been related to the well known log-likelihood function and the soft decision decoding rule has been defined and derived. The BER curves are obtained for this novel algorithm and then compared to the curve obtained by the Viterbi algorithm and the gradient descent algorithm. Based on the theoretical model a simulator of coding communication system has been developed and used to confirm theoretically expected results. It was found that the performances of the proposed soft decision decoder are comparable or better than the performances of the recurrent neural network decoder and decoders based on the Viterbi algorithm.
TxQoS: A Contractual Approach for Transaction Management
Authors: Ting Wang, Jochem Vonk, Paul Grefen
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In this paper we model and analyze a business case from a dual view of process and service perspectives. We dis- cover that a common understanding on transactional relia- bility is missing between the parties collaborating in this case. Therefore, we propose to enclose a Transactional Quality of Service (TxQoS) specification in a Service Level Agreement (SLA) to infuse transactional semantics into e- contracts for contract-driven service-oriented processes. A contract structure and a TxQoS framework are developed toward the unambiguous interpretation and understanding of transactional qualities between the business and techni- cal communities as well as between the contracting parties. Thus, reliability is guaranteed both technically, via transac- tion management, and legally via contracts.
Security made easy: Achieving user-friendly communication protection in ad-hoc situations
Authors: Jens Heider, Julian Schutte
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Mobile applications dealing with ad-hoc situations do have their own challenges such as a reasonable short time for interaction and limitations of available technology. A secure yet user-friendly solution for protecting wireless communication therefore is a service enabler for mobile business. This paper discusses the drawbacks of existing security concepts and proposes a framework on application level to help developers improving user acceptance. Additionally, we present the evaluation results of the prototype which leverages the user's common spatial context by integrating him into the device authentication process.
Wide-w-NAF Method for Scalar Multiplication on Koblitz Curves
Authors: Ming Li, Baodong Qin, Fanyu Kong, Daxing Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

At CRYPTO 1991, Koblitz proposed the anomalous binary curves for speeding up scalar multiplication in elliptic curve cryptosystem. At CRYPTO 1997, Solinas proposed the \tau-NAF method on Koblitz curves and reduced the Hamming weight of the scalar to n/3 over the field F_2n. AtPKC 2004, Avanzi et al combined the \tau-NAF with one point halving and reduced the Hamming weight of the scalar to 2n/7. Recently, Avanzi et al improved this method by introducing the wide-double-NAF whose Hamming weight is n/4. In this paper, we propose the wide-w-NAF, which is an extension of Avanzi's wide-double-NAF, and reduce the Hamming weight to n/(w+1). When n \ge 144, our method is at least 43% -- 56% faster than Solinas's \tau-NAF method and 21% -- 39% faster than Avanzi's wide-double-NAF method without additional memory requirements.
Just-noticeable difference estimation with pixels in images
Authors: Xiaohui Zhang, Weisi Lin, Ping Xue
Venue: Journal of Visual Communication and Image Representation (2008)

Perceptual visibility threshold estimation, based upon characteristics of the human visual system (HVS), is widely used in digital image and video processing. We propose in this paper a scheme for estimating JND (just-noticeable difference) with explicit formulation for image pixels, by summing the effects of the visual thresholds in sub-bands. The factors being considered include spatial contrast sensitivity function (CSF), luminance adaptation, and adaptive inter- and intra-band contrast masking. The proposed scheme demonstrates favorable results in noise shaping and perceptual visual distortion gauge for different images, in comparison with the relevant existing JND estimators.
Determining Fault Ratios in Multilevel Delayed Staging Storage Hierarchies
Authors: G. M. Silberman
Venue: IEEE Transactions on Computers (1982)

A procedure to efficiently obtain fault ratios for all levels in multilevel delayed-staging (D-S) storage hierarchies without recurring to simulation runs for each configuration desired is presented. The procedure is based on the applicability of stack processing techniques to D-S configurations and requires simulation runs for two-level hierarchies only.
Control Structure Abstractions of the Backtracking Programming Technique
Authors: S. L. Gerhart
Venue: IEEE Transactions on Software Engineering (1976)

Backtracking is a well-known technique for solving combinatorial problems. It is of interest to programming methodologists because 1) correctness of backtracking programs may be difficult to ascertain experimentally and 2) efficiency is often of paramount importance. This paper applies a programming methodology, which we call control structure abstraction, to the backtracking technique. The value of control structure abstraction in the context of correctness is that proofs of general properties of a class of programs with similar control structures are separated from proofs of specific properties of individual programs of the class. In the context of efficiency, it provides sufficient conditions for correctness of an initial program which may subsequently be improved for efficiency while preserving correctness.
Self-Configuration Techniques for MuniSocket
Authors: Nader Mohamed, Jameela Al-Jaroodi
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

MuniSocket (Multiple-Network-Interface Socket) provides mechanisms to enhance the communication performance properties such as throughput, transfer time, and reliability by utilizing the existing multiple network interface cards between a pair of computers. Although the MuniSocket model has some communication performance advantages over the regular socket, it has a number of configuration complexity drawbacks including the complexity of establishing multiple channels and configuration for good communication performance under different connection scenarios. This paper develops some selfconfiguration techniques for MuniSocket. These techniques are self-discovery technique for discovering the existence of network interfaces and their performance properties, self-configuration for establishing channels over the interfaces, and selfoptimization for selecting the best channels combinations for sending various message sizes. While these techniques enhance communication performance among computers, they also reduce the complexity of configuring MuniSocket and making its interface compatible with the regular TCP socket interface.
A probabilistic model for data cube compression and query approximation
Authors: Rokia Missaoui, Cyril Goutte, Anicet Kouomou Choupo, Ameur Boujenoui
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

Databases and data warehouses contain an overwhelming volume of information that users must wade through in order to extract valuable and actionable knowledge to supportthe decision-making process. This contribution addresses the problem of automatically analyzing large multidimensional tables to get a concise representation of data, identify patterns and provide approximate answers to queries. Since data cubes are nothing but multi-way tables, we propose to analyze the potential of a probabilistic modeling technique, called non-negative multi-way array factorization, for approximating aggregate and multidimensional values. Using such a technique, we compute the set of components (clusters) that best fit the initial data set and whose superposition approximates the original data. The generated components can then be exploited for approximately answering OLAP queries such as roll-up, slice and dice operations. The proposed modeling technique will then be compared against the log-linear modeling technique which has already been used in the literature for compression and outlier detection in data cubes. Finally, three data sets will be used to discuss the potential benefits of non-negative multiway array factorization.