ppxscal/embedding_network huggingface dataset:
Certified Email Delivery with Offline TTP
Authors: Hao Wang, Yuyi Ou, Jie Ling, Lu Liang, Xiang Xu
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Email has become a standard communication method nowadays. But when it comes to important correspondences containing sensitive governmental, commercial or medical information, certified delivery is required. We present in this paper a new certified email protocol which assures fair delivery, nonrepudiability, confidentiality and timeliness. To achieve definite fairness, an offline TTP is employed which will be involved only if there is a dispute.
Making usability work in industry: an Australian practitioner perspective
Authors: Vince Bruno, Martin Dick
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

The gap in usability knowledge between research and industry practice is an important one to bridge. This paper presents the findings of 12 interviews with usability practitioners. The interviews focus on eliciting stories about successful and unsuccessful usability outcomes. The analysis shows that an iterative usability process, ensuring stakeholder involvement, articulating usability goals and requirements and avoiding technological constraints are critical issues to achieving a successful usability outcome in a project.
Automatic generation of first order Takagi-Sugeno systems using fuzzy c-elliptotypes clustering
Authors: Thomas A. Runkler
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

The lack of skilled experts being able to provide objective knowledge about complex systems motivates the development of automatic tools for the extraction of fuzzy if-then rules from available data sets. Fuzzy clustering is a well-established and widely used method for data analysis. In this paper, fuzzy c-elliptotypes clustering is used to extract locally linear models, which are translated into first order Takagi-Sugeno rules. The main goal is the extraction of good fuzzy models containing human interpretable information (readable transparent rule bases) from high-dimensional data sets. Existing methods as well as new approaches are used to automatically set the cluster parameters, to reduce the dimensions of the clusters and to generate approximate membership functions. The experiments show that the proposed methods are well suited for complex real-world problems.
Knowledge representation using multilevel hierarchical model in intelligent tutoring system
Authors: M. Siddappa, A. S. Manjunath
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The emergence of Intelligent Tutoring System (ITS) has opened up new avenues for the use of computers in education. ITSs are able to tackle difficult instructional problems and extend the usefulness of the computer as an instructional tool. This paper presents the work done on some aspects of the design and implementation of ITSs. A didactic attempt has been made to design the tutors with dynamic adaptive behavior. A multilevel hierarchical model has been developed for the representation of domain knowledge based on various aptitude levels of students. The work also describes student modeling principles using aptitude and action level identification and overlay methods.
Challenges for large-scale implementations of spiking neural networks on FPGAs
Authors: L. P. Maguire, T. M. McGinnity, B. Glackin, A. Ghani, A. Belatreche, J. Harkin
Venue: Neurocomputing (2007)

The last 50 years has witnessed considerable research in the area of neural networks resulting in a range of architectures, learning algorithms and demonstrative applications. A more recent research trend has focused on the biological plausibility of such networks as a closer abstraction to real neurons may offer improved performance in an adaptable, real-time environment. This poses considerable challenges for engineers particularly in terms of the requirement to realise a low-cost embedded solution. Programmable hardware has been widely recognised as an ideal platform for the adaptable requirements of neural networks and there has been considerable research reported in the literature. This paper aims to review this body of research to identify the key lessons learned and, in particular, to identify the remaining challenges for large-scale implementations of spiking neural networks on FPGAs.
Gradient Adaptive Lattice Algorithm for MMSE Receivers in DS-CDMA Systems
Authors: Constantin Paleologu, Calin Vladeanu, Ioan Bacalu
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

This paper considers a minimum mean-squared error (MMSE) single user adaptive receiver for the asynchronous direct-sequence code-division multiple-access (DS-CDMA) system, based on a gradient adaptive lattice (GAL) algorithm. Since the lattice predictor orthogonalizes the input signals this algorithm achieves a faster convergence rate than the transversal least-mean-square (LMS) algorithm. Moreover, a parallel interference cancellation (PIC) procedure is developed in order to increase the convergence performance, which further reduces the overhead introduced during the receiver's training period.
Forecasting Revenue Growth Rate Using Fundamental Analysis: A Feature Selection Based Rough Sets Approach
Authors: You-Shyang Chen, Ching-Hsue Cheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper mainly forecasts revenue growth rate (RGR) of firms in stock trading systems using rough set theory. It is very important instrument for investors that correctly predict future growing firms from data of fundamental analysis in trading systems, because of the more accurate prediction, the more gain profit. This paper proposes a new approach, a feature selection based method, to enhance accuracy of classifier. This approach uses revenues, profit, earnings, return, and other data to determine the potential for future growth of its revenue. Therefore, the paper provides an empirical comparison of five major feature selection methods for classification. The actual RGR dataset is employed in this empirical case study to illustrate the proposed approach. From the results, the proposed approach selects fewer attributes to improve accuracy. As a result, the performance is superior to the listing methods.
Parametric yield analysis and optimization in leakage dominated technologies
Authors: Kanak Agarwal, Rahul Rao, Dennis Sylvester, Richard Brown
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Parametric yield loss has become a serious concern in nanometer technologies. In this paper, we propose a methodology to estimate and optimize the parametric yield of a design in the presence of process variations. We discuss the impact of leakage on parametric yield given that leakage causes the parametric yield window to shrink by imposing a two-sided constraint in conjunction with performance targets on the yield window. We present a mathematical framework for yield estimation under process variation for a given power and frequency constraints. The model is validated against Monte Carlo SPICE simulations in a 90-nm CMOS process and is shown to have a typical error of less than 5%. We then demonstrate the importance of optimal supply and threshold voltage selection for yield maximization. Our results show that parametric yield is highly sensitive to supply voltage with only a 5% change in the supply voltage potentially leading to nearly 15% yield degradation. We also investigate the sensitivity of parametric yield to required frequency and power constraints. Finally, we apply the proposed framework to the problem of maximizing the shipping frequency in the presence of given yield and power constraints.
Casting Petri Nets into Programs
Authors: R. A. Nelson
Venue: IEEE Transactions on Software Engineering (1983)

A programming system has been implemented in which annotated Petri nets are used as machine-processable high-evel design representations. The nets can be used to express the parallelism and the dynamic sequential dependencies found in complex software. They can then be interactively fired to facilitate debugging of the design. The nets are processed into a procedure language, called XL/1, to which a variety of transformations are applied in order to produce more efficient programs. These programs are generated for either a serial or a parallel processing environment. Finally, the XL/1 programs may be translated into PL/I or PL/S. The serial processing versions have been compiled and run successfully, but the parallel processing versions have not yet been run in a parallel processing environment.
Parallel Generation of Binary Search Trees
Authors: C. K. Wong
Venue: IEEE Transactions on Computers (1974)

A method of constructing binary search trees in a multiprocessor computer system is proposed. Asymptotically, this method achieves the maximum possible increase in speed as compared with a single processor computer system. To make better use of this method, a parametrized restructuring of binary search trees is also discussed.
The Improvement of Program Behavior
Authors: D. Ferrari
Venue: Computer (1976)

The practical objective of program behavior studies is to enhance program and system performance. On the one hand, the knowledge resulting from these studies may be useful in designing new programs and new virtual memory systems that are capable of levels of performance higher than those currently achievable. On the other hand, such knowledge may often be employed to increase the performance of existing programs and systems.
Flexible Behavioural Compatibility and Substitutability for Component Protocols: A Formal Specification
Authors: Nabil Hameurlain
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Component compatibility and substitutability are widely recognized as the main issues in Component- Based Software Engineering (CBSE). Most of existing approaches suffer from the problem of component adaptation. Indeed, components compatibility and substitutability are performed component-tocomponent without taking into account the context. This paper proposes a new framework where more flexible component protocols compatibility and substitutability relations that depend on the context (environment) can be defined. The proposed approach is based on the notion of component protocol's usability, that is a component such that there exists an environment ensuring the completion and / or the proper termination of the composition of the involved component protocol and that environment. Two optimistic protocols compatibility relations together with two optimistic protocols behavioral subtyping relations related to the principle of substitutability are proposed. Moreover, behavioral refinement of component protocols is studied, and a link between protocols refinement and their usability is established. The soundness of the approach is shown.
Energy Based Design Space Exploration of Multiprocessor VLIW Architectures
Authors: Manoj Gupta, Mayank Gupta, Neeraj Goel, M. Balaksrishnan
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Today energy is an important factor in designing a multiprocessor system. The overall goal of this work is to propose a methodology for design space exploration of VLIW multiprocessors. We have developed a framework which enables us to explore energy - performance trade-off for state of the art VLIW processors and multiprocessors. Our methodology is capable of simultaneously exploring process-processor binding while tuning the individual VLIW processors to support specific operation concurrency requirements of processes bound to it. We extend existing uniprocessor instruction level energy estimation techniques to multiprocessors. The implementation is based on popular public domain tools like IMPACT and SystemC. Its completeness, robustness and efficacy is demonstrated through a case study on MPEG-2 decoder.
Reusability Issues and Ada
Authors: A. Gargaro
Venue: IEEE Software (1987)

How do you write reusable code when your methodology doesn't address reusability? These guidelines bility? These guidelines developed by a major defense contractor may help.
An Adaptive Location Service on The Basis of Diamond Quorum for MANETs
Authors: IhnHan Bae
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Mobile ad-hoc network (MANET) is a network of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems in a MANET by using the node location information. However, maintaining the location information of the nodes is one of the essential challenges in mobile ad-hoc networks because the location of a node changes frequently. In this paper, we propose an adaptive location service on the basis of diamond quorum system (DQS) considering the gravity of locality that is managing the location information for all nodes efficiently in a MANET. In a proposed scheme, the mobility database storing the location information of a mobile node can be selected adaptively from the DQS by considering the gravity of locality. The performance of a proposed scheme is to be evaluated by an analytical model, and compared with that of existing Uniform Quorum System (UQS) based mobility management scheme.
Shift Coding: Efficient State Update in Mobile Peer-to-Peer Multiplayer Games
Authors: Yanmin Zhu, Yunhuai Liu, Hoilun Ngan, Quanbin Chen, Chen Qian, Jian Ma, Dian Zhang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The rapid advancement in wireless communications and mobile computing devices has opened a wide door for developing interesting mobile peer-to-peer multiplayer games (MMGs). In this paper we study an important problem of game state update in MMGs. Based on the network coding theory, we design the shift coding algorithm. Shift coding is running on a finely regulated ring overlay and lets each node exchange coded state information with its two immediate neighbors. After a few rounds of exchange, every node is guaranteed to receive the state information of all the other game members. The results of experimental results have shown that shift coding can significantly reduce network traffic under various network configurations.
Hybridizing adaptive and non-adaptive mutation for cooperative exploration of complex multimodal search space
Authors: Jason Teo, Nor Rafidah Mohamad
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

One of the most efficient Real-Coded Genetic Algorithms (RCGAs) for function optimization currently is the G3-PCX (Parent-Centric Crossover) algorithm. However, its performance for solving complex multimodal problems with highly deceptive fitness landscapes is known to be poor compared with its performance for unimodal problems. The problem primarily stems from premature convergence to local rather than global optima due to lack of explorative capabilities of the algorithm. In this study, a hybrid approach combining both adaptive as well as non-adaptive mutation in a cooperative manner is investigated in the hope of improving the explorative capabilities of the G3-PCX algorithm for solving complex multimodal problems. The proposed algorithm is called G3HM (G3-PCX with Hybrid Mutation) and empirical tests on four benchmark complex multimodal test problems have shown highly competitive performance. In two of the four problems, G3HM dramatically outperformed the standard G3-PCX algorithm in terms of solution quality. Thus, the concept of combining adaptive with non-adaptive mutation as a hybrid genetic operator is shown to have beneficial effects for cooperatively exploring complex multimodal search spaces.
Functionally Parallel Architecture for Array Processors
Authors: E. U. Cohler
Venue: Computer (1981)

Based on the natural division of mathematical problems, functional parallelism becomes the architectural key for improving speed/cost ratios for array processors.
The pollution attack in P2P live video streaming: measurement results and defenses
Authors: Prithula Dhungel, Xiaojun Hei, Keith W. Ross, Nitesh Saxena
Venue: Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV (2007)

P2P mesh-pull live video streaming applications ---such as Cool-Streaming, PPLive, and PPStream --- have become popular in the recent years. In this paper, we examine the stream pollution attack, for which the attacker mixes polluted chunks into the P2P distribution, degrading the quality of the rendered media at the receivers. Polluted chunks received by an unsuspecting peer not only effect that single peer, but since the peer also forwards chunks to other peers, and those peers in turn forward chunks to more peers, the polluted content can potentially spread through much of the P2P network. The contribution of this paper is twofold. First, by way of experimenting and measuring a popular P2P live video streaming system, we show that the pollution attack can be devastating. Second, we evaluate the applicability of four possible defenses to the pollution attack: blacklisting, traffic encryption, hash verification, and chunk signing. Among these, we conclude that the chunk signing solutions are most suitable.
The JastAdd system — modular extensible compiler construction
Authors: Torbjörn Ekman, Görel Hedin
Venue: Science of Computer Programming (2007)

The JastAdd system enables modular specifications of extensible compiler tools and languages. Java has been extended with the Rewritable Circular Reference Attributed Grammars formalism that supports modularization and extensibility through several synergistic mechanisms. Object-orientation and static aspect-oriented programming are combined with declarative attributes and context-dependent rewrites to allow highly modular specifications. The techniques have been verified by implementing a full Java 1.4 compiler with modular extensions for non-null types and Java 5 features.
Overview of garbage collection in symbolic computing
Authors: Timothy J. McEntee
Venue: ACM SIGPLAN Lisp Pointers (1987)

Many readers of this article have heard the term "garbage collection" on occasion without being given much explanation as to what it is. One purpose of this paper, therefore, is to describe what garbage collection is and why it is a subject of concern for computing in general and symbolic computing in particular. The first section briefly describes garbage collection. The next section gives a general description of what has come to be known as the "classical" garbage collection algorithms. A few of the classical algorithms' shortcomings for use in today's systems are described in the next section. This is followed by a section on a few techniques in garbage collection which address the needs of today's and tomorrow's symbolic computing systems.
On the stability of epidemic spreading in small-world networks: how prompt the recovery should be?
Authors: Xiang Li, Xiaofan Wang
Venue: International Journal of Systems Science (2007)

In this paper, we study the phenomena of the epidemic spreading process in small-world networks, where recovery responses are practically delayed. We propose and investigate three novel linear delayed SIR models for different cases of recovery response. Because the recovery strategies respond with some time-delays as happens in practice, it is found that the unsuitable recovery strength may not suppress the prevalent epidemics and even lead to oscillations. Therefore, it is strongly suggested that the administrative authorities should apply control strategies of recovery as soon as possible on the small prevalent viruses before they spread into a disaster of infections.
A Universal File Server
Authors: A. D. Birrell
Venue: IEEE Transactions on Software Engineering (1980)

A file server is a utility provided in a computer connected via a local communications network to a number of other computer. File servers exist to preserve material for the benefit of client machines or systems. It is desirable for a file server to be able to support multiple file directory and access management systems, so that the designer of a client system retains the freedom to design the system that best suits him. For example, he may wish to use the rile server to support a predefimed directory structure or as a swapping disk. The paper explores the dedgn issues associated with such a file server and proposes some solutions.
Design and implementation of numerical linear algebra algorithms on fixed point DSPs
Authors: Zoran Nikolic, Ha Thai Nguyen, Gene Frantz
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs) to reduce total hardware costs. Converting the simulation model to fixed point arithmetic and then porting it to a target DSP device is a difficult and time-consuming process. In this paper, we analyze the conversion process. We transformed selected linear algebra algorithms from floating point to fixed point arithmetic, and compared real-time requirements and performance between the fixed point DSP and floating point DSP algorithm implementations. We also introduce an advanced code optimization and an implementation by DSP-specific, fixed point C code generation. By using the techniques described in the paper, speed can be increased by a factor of up to 10 compared to floating point emulation on fixed point hardware.
Two Approaches for Arabic Script Recognition-Based Segmentation Using the Hough Transform
Authors: S. Touj, N. Ben Amara, H. Amiri
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The recognition of the cursive writing requires generally a segmentation procedure. This operation constitutes one of the major difficulties of all OCR systems. The research of an ideal segmentation process of a word into letters is utopian. In this paper we propose two segmentation-by-recognition techniques for cursive printed Arabic recognition based on Hough Transform.
An Embedded Implementation of the Microsoft Common Language Infrastructure
Authors: Joey C. Libby, Kenneth B. Kent
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The Common Language Infrastructure (CLI) provides a framework for managing and executing applications. Developers designing applications for the CLI need not worry about the underlying architecture as it is abstracted from view by the CLI framework. This abstraction, while a boon for developers, leads to degraded performance. It is because of these inefficiencies that the CLI is not well suited for developing embedded applications. It would, however, be beneficial for developers to be able to develop embedded applications using the CLI. In order to address the issues caused by the extra layer of abstraction added by the CLI, an embedded processor is designed and implemented. This processor is capable of natively executing the CLI instruction set which effectively removes the performance problems caused by the extra layer of abstraction.