ppxscal/embedding_network huggingface dataset:
Efficient Modular Exponentiation with Three-Moduli (2^{n}±1,2^{n}+3)
Authors: Bangju Wang, Huanguo Zhang, Yuhua Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Modular exponentiation is the basic computation for most public key cryptosystems and digital signal processing. A new signed binary representation (SBR) of operand is presented, which has less weight than NAF when modulus is one of moduli (2^{n}±1,2^{n}+3). The speed of modular squaring with three-moduli (2^{n}±1,2^{n}+3) can be improved using the new SBR by reducing partial products and carries. Based on the result, the speed of computation of modular exponentiation using the new SBR may double that of NAF method for some exponents. According to theoretical analyses and experiment comparing to the other methods mentioned in this paper, the new SBR could improve the speed of modular exponentiation efficiently. Moreover, the SBR of integer can be widely used in secure communication and DSP system.
MOS-based multiuser multiapplication cross-layer optimization for mobile multimedia communication
Authors: Shoaib Khan, Svetoslav Duhovnikov, Eckehard Steinbach, Wolfgang Kellerer
Venue: Advances in Multimedia (2007)

We propose a cross-layer optimization strategy that jointly optimizes the application layer, the data-link layer, and the physical layer of a wireless protocol stack using an application-oriented objective function. The cross-layer optimization framework provides efficient allocation of wireless network resources across multiple types of applications run by different users to maximize network resource usage and user perceived quality of service. We define a novel optimization scheme based on the mean opinion score (MOS) as the unifying metric over different application classes. Our experiments, applied to scenarios where users simultaneously run three types of applications, namely voice communication, streaming video and file download, confirm that MOS-based optimization leads to significant improvement in terms of user perceived quality when compared to conventional throughput-based optimization.
Strong law of large numbers for t-normed arithmetics
Authors: Pedro Terán
Venue: Fuzzy Sets and Systems (2008)

We prove a strong law of large numbers for sequences of pairwise i.i.d. fuzzy random variables. Addition is given by the extension principle associated with a general continuous triangular norm. Our result includes the SLLN for levelwise sums, obtained when the chosen triangular norm is the minimum.
Efficient BMC for Multi-Clock Systems with Clocked Specifications
Authors: M. K. Ganai, A. Gupta
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Current industry trends in system design - multiple clocks, clocks with arbitrary frequency ratios, multi-phased clocks, gated clocks, and level-sensitive latches, combined with clocked - pose additional challenges to verification efforts. We propose an integrated solution that improves SAT-based bounded model checking (BMC) by orders of magnitude, for verification of synchronous multi-clock systems with clocked LTL properties. Our main contributions are: a) efficient clock modeling schemes to handle clock related challenges uniformly; b) generation of automatic schedules and clock constraints to avoid unnecessary unrolling and loop-checks in BMC; c) dynamic simplification of BMC problem instances with clock constraints; and d) customized BMC translations - with incremental formulations and learning - to directly handle PSL-style clocked specifications. We demonstrate the effectiveness of our approach on some OpenCores multi-clock system benchmarks.
Scheduling Algorithm Based on Integrated Utility of Multiple QoS Attributes on Service Grid
Authors: Yuanhui Li, Depeng Zhao, Jun Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Over the last few years, service-oriented Grid that enable a new way of service provision based on utility computing models, which users consume based on their QoS (Quality of Service) requirements. In such services grids, resource management and scheduling based on user's QoS constraints are addressed seldom, especially in the aspect of users' multiple QoS attributes preferences considered synthetically. This paper proposes a novel scheduling algorithm based on integrated utility of multiple QoS attributes. It describes multiple QoS attributes as utility functions and drives the dynamic resource scheduling by taking these utility functions as objective functions of scheduling optimization. Considering tasks related features, this paper also brings forward a task partition execution strategy to improve scheduling efficiency. Experiments show that the scheduling algorithm can reflect user's utility and preference in general. It also provides services division and performance guarantees, which presents the on-demand service well and makes scheduling more flexible.
MAS4AMR: A Self Organized Multi Agent System designed for Auto Mobile Robot
Authors: Liang HaiHua, Zhu MiaoLiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, a self organized Multi Agent System for Auto Mobile Robot (MAS4AMR) is described. The MAS4AMR enables the mobile robot to make corresponding driving action according to the always changing environment and make reaction to emergency condition. The MAS4AMR incorporate a communication middleware and a set of event-driven Agents, which enables the robot to initiate actions adaptively to the dynamical changes in the environment. The MAS4AMR is discussed in detail in this paper, and the simulation results are also presented.
Correlation Analysis Based on Hierarchical Boolean Representation over Time Series Data Streams
Authors: Tiancheng Zhang, Dejun Yue, Ge Yu, Yu Gu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Correlation analysis is a basic problem in the field of data stream mining. Traditional method is not suitable for real time processing with huge amount of stream data. We propose a hierarchical Boolean representation method for correlation analysis among time series data streams. The original streaming series are transformed into the Macro- Boolean series and then the Micro-Boolean series successively, and the candidate can be easily gained by simple bit operations. With huge amount of streaming series, this method can quickly get the correlation pairs of series in an efficient way by reducing huge calculation in a little space The experimental evaluations show that our method has better computation complexity with high accuracy.
Timing budgeting under arbitrary process variations
Authors: Ruiming Chen, Hai Zhou
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Timing budgeting under process variations is an important step in a statistical optimization flow. We propose a novel formulation of the problem where budgets are statistical instead of deterministic as in existing works. This new formulation considers the changes of both the means and variances of delays, and thus can reduce the timing violation introduced by ignoring the changes of variances. We transform the problem to a linear programming problem using a robust optimization technique. Our approach can be used in late-stage design where the detailed distribution information is known, and is most useful in early-stage design since our approach does not assume specific underlying distributions. In addition, with the help of block-level timing budgeting, our approach can reduce the timing pessimism. Our approach is applied to the leakage power minimization problem. The results demonstrate that our approach can reduce timing violation from 690ps to Ops, and the worst total leakage power by 17.50% on average.
Fault-aware communication mapping for NoCs with guaranteed latency
Authors: Sorin Manolache, Petru Eles, Zebo Peng
Venue: International Journal of Parallel Programming (2007)

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.
An Ubiquitous Testing System for m-Learning Environments
Authors: Rafael Fernandes Lopes, Omar Andres Carmona Cortes
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Nowadays, e-learning technologies can be combined with mobile computing in order to create a new educational paradigm called m-learning or mobile learning. This new paradigm improves the cooperation between students and teachers, overcoming the classroom borders. This paper proposes an ubiquitous testing system (UbiSysTest) for m- Learning environments. The goal of UbiSysTest is to provide an infrastructure for creating, storing, applying and correcting academic tests. Through UbiSysTest, students can download and execute these tests by means of cell phones. This application runs off-line and only connects through Internet whenever should be required. The UbiSys- Test is being developed as part of an infrastructure named MoCoTo (Mobile Collaborative and Educational Tools).
Programming environments
Authors: John Foderaro, D. Kevin Layer
Venue: ACM SIGPLAN Lisp Pointers (1988)

The editor is an important part of a LISP programming environment. In this paper we describe how we have integrated the GNU EMACS editor with ALLEGRO CL (previously known as Extended COMMON LISP). Parts of the interface between ALLEGRO CL and GNU EMACS can be used with any version of LISP, including FRANZ LISP. Other parts require a sophisticated multiprocessing facility, such as the one found in ALLEGRO CL or on LISP-machines. The interface can be obtained at no charge as described at the end of this paper.
A Framework for Resource Control in WiMAX Networks
Authors: M. Castrucci, I. Marchetti, C. Nardini, N. Ciulli, G. Landi, A. Ichimescu, P. Neves
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In this paper is presented an architecture for the control of wireless resources in a WiMAX access network, designed within the IST WEIRD project. Starting from WiMAX Forum architecture, new software modules have been introduced in the Control plane in order to manage data flows in WiMAX access networks. The proposed solution allows to guarantee the requested QoS to data flows. Interaction between the Control plane and the Transport plane is realized in a equipment vendor independent way, thanks to the introduction of an Adaptation layer between the Control plane and the IEEE 802.16 MAC layer.
Fuzzy Neural Network Model Using a Fuzzy Learning Vector Quantization with the Relative Distance
Authors: Yong Soo Kim, Sung-. ihl Kim
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

In this paper, we propose a fuzzy LVQ(Learning Vector Quantization) which is based on the fuzzification of LVQ. The proposed fuzzy LVQ uses the different learning rate depending on whether classification is correct or not. When the classification is correct, it uses the combination of a function of the distance between the input vector and the prototypes of classes and a function of the number of iteration as the fuzzy learning rate. On the other hand, when the classification is not correct, it uses the combination of the fuzzy membership value and a function of the number of iteration as the fuzzy learning rate. The proposed FLVQ(fuzzy LVQ) is integrated into the supervised IAFC(Integrated Adaptive Fuzzy Clustering) neural network 5. We used iris data set to compare the performance of the supervised IAFC neural network 5 with those of LVQ algorithm and back propagation neural network. The supervised IAFC neural network 5 yielded fewer misclassifications than LVQ algorithm and back propagation neural network.
New Products
Venue: IEEE MultiMedia (2007)

This article features some of the latest advances in multimedia technology.
VisLink: Revealing Relationships Amongst Visualizations
Authors: Christopher Collins
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present VisLink, a method by which visualizations and the relationships between them can be interactively explored. VisLink readily generalizes to support multiple visualizations, empowers inter-representational queries, and enables the reuse of the spatial variables, thus supporting efficient information encoding and providing for powerful visualization bridging. Our approach uses multiple 2D layouts, drawing each one in its own plane. These planes can then be placed and re-positioned in 3D space: side by side, in parallel, or in chosen placements that provide favoured views. Relationships, connections, and patterns between visualizations can be revealed and explored using a variety of interaction techniques including spreading activation and search filters.
Subtree Testing and Closed Tree Mining Through Natural Representations
Authors: Jose L. Balcazar, Albert Bifet, Antoni Lozano
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a representation of unranked trees as strings over a countable alphabet, and has shown how this representation is useful for canonizing unordered trees and for mining closed frequent trees, whether ordered or unordered. Here we propose a similar, simpler alternative and adapt some basic algorithmics to it; then we show empirical evidence of the usefulness of this representation for mining frequent closed unordered trees on real-life data.
Deputy Mechanism for OLAP over Imprecise Data and Composite Measure
Authors: Junqiang Liu, Min Luo, Xiandi Yang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Dealing with Imprecise data and composite measure is widely recognized to be the important problem, respectively and has received increasing attention recently. However, the complexity of queries required to support OLAP applications makes it difficult to implement using standard relational database technoloty. Moreover, there is currently no data model for OALP to handle both imprecise data and composite measure. In this paper, we extend the OLAP data model using deputy mechanism and propose some operators to support those OLAP applications. To our knowledge this is the first paper to handle both imprecise data and composite measure in an OLAP setting.
A new method for using hash functions to solve remote user authentication
Authors: Tzung-Her Chen, Wei-Bin Lee
Venue: Computers and Electrical Engineering (2008)

Recently, Peyravian and Zunic proposed the remote password authentication schemes only based on the collision-resistant hash function. The schemes are, therefore, easy to implement and simple to use. The attractive properties cause a series of discussion. Several security flaws are found and remedied. Unfortunately, most of the remedies either are insecure or violate the original advantages because of involving public-key cryptosystems or modular exponential operations. Hence, it is still a challenge to design a secure scheme abiding by the beneficial assumption of the Peyravian-Zunic schemes. The proposed scheme not only keeps the original advantages (user friendness and computational cheapness) but also highlights certain of valuable features, such as (1) mutual authentication (higher security level), (2) server's ignorance of users' passwords (further security guaranee to users, specially for financial services), (3) immunity from maintaining security-sensitive table (maintaining burden reduction to servers), and so forth.
Lightweight GUI Components Library Development Oriented to Embedded Industry Monitoring System Based on Qt/E
Authors: Tan Da-peng, Li Pei-yu, Pan Xiao-hong, Bo-yu Lin
Venue: Proceedings of the 2007 International Conference on Convergence Information Technology (2007)

Aiming at some problems of embedded industry monitoring system graphic user interface (IMS-GUI) such as large occupation space, bad configuration ability and poor real-time performance, an embedded IMS-GUI components library realization method based on Qt/E was put forward. The Qt/E library file was tailored according to basic requirement of IMS. Using multi-thread method, system parallel processing abilities of data collection, analysis and display were enhanced, and real-time performance and rapidity were guaranteed. By internal communication interface of Qt, the message mapping mechanism which would not require call-back was realized, context switch speed was improved, and GUI development process would become simply. Based on modularization principle, combined with some related industry monitoring and fault diagnostic algorithms, GUI shared components library oriented to IMS was developed by primary C language, that could resolve the problem of cross-platform applicability and be configured and tailored for specific demand of users. Industry experiments proved that GUI developed by the components library has small occupation space and high real-time performance, can stably run in embedded platform environment, and supply powerful technical support for the interactivity of IMS.
Investigation of Particle Swarm Optimization for Job Shop Scheduling Problem
Authors: Zhixiong Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Job shop scheduling problem has stronger processing constraints, and it is a kind of well-known combination optimization problem. Particle swarm optimization algorithm is employed to solve the job shop scheduling problem, and the objective is minimizing the maximum completion time of all the jobs. The particle representation based on operation-particle position sequence is proposed. In the particle representation, the mapping between the particle and the scheduling solution is established through connecting the operation sequence of all the jobs with the particle position sequence. According to processing constraints of the problem, each operation in the operation sequence of all the jobs is assigned on each machine in turn to form the scheduling solution. The particle representation can ensure that the scheduling solutions decoded are feasible and can follow the particle swam optimization algorithm model. The computational results show that particle swarm optimization algorithm can effectively solve the job shop scheduling problem.
Fuzzy Spatial Data Warehouse: A Multidimensional Model
Authors: David Perez, Maria J. Somodevilla, Ivo H. Pineda
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Data warehouses have been used for a large variety of applications in order to provide support for the information decision support systems during knowledge discover process. Geographical Information Systems have gotten the benefits from data warehousing considering that the spatial data is by itself complex and represent a huge amount of information that can be retrieved only by means of a data warehouse representation. In this paper we present a design methodology for a Fuzzy Spatial Data Warehouse and the emphasis is on the step of how to build the data cube. In our approach we pay special attention on the data dimensionality concerning the spatial and fuzziness. We propose the use of membership functions to speed the query process up during the Extraction, Transformation and Load (ETL) process. Mondrian , ArcGIS and Cube Designer are the tools used to evaluate the results. To demonstrate the accuracy of our approach, we consider the risk zone (a potential natural disaster area ) surrounding the Popocatetl volcano and the results are compared with the CENAPRED (Prediction National Center) agency has.
Visibility maps of segments and triangles in 3D
Authors: Esther Moet, Christian Knauer, Marc van Kreveld
Venue: Computational Geometry: Theory and Applications (2008)

Let T be a set of n triangles in three-dimensional space, let s be a line segment, and let t be a triangle, both disjoint from T. We consider the subdivision of T based on (in)visibility from s; this is the visibility map of the segment s with respect to T. The visibility map of the triangle t is defined analogously. We look at two different notions of visibility: strong (complete) visibility, and weak (partial) visibility. The trivial @W(n^2) lower bound for the combinatorial complexity of the strong visibility map of both s and t is almost tight: we prove an O(n^2@a(n)) upper bound for both structures, where @a(n) is the extremely slowly increasing inverse Ackermann function. Furthermore, we prove that the weak visibility map of s has complexity @Q(n^5), and the weak visibility map of t has complexity @Q(n^7). If T is a polyhedral terrain, the complexity of the weak visibility map is @W(n^4) and O(n^5), both for a segment and a triangle. We also present efficient algorithms to compute all discussed structures.
B74-20 Systematic Programming: An Introduction
Authors: P. J. Denning
Venue: IEEE Transactions on Computers (1974)

This book will become a lethal weapon against skepticism toward the possibility of presenting programming as a precise discipline based on clear and simple principles. It treats what many regard as advanced topics in programming in so straightforward a manner, that there is little doubt that the "advanced topics" are in fact elementary notions. The material is presented simultaneously at many levels: the college sophomore will enjoy a hearty repast of solid conceptual and practical aspects of algorithm design, and the college professor or industrial professional will enjoy many morsels from the philosophy of programming to practical advice on the best uses of each language construction. The material is presented in a fast-moving, unadorned style, reminiscent in places of sketchy lecture notes; indeed, fully fourteen chapters appear in the first 124 pages. Every concept is backed by an example; I counted approximately 45 sample algorithms or programs in the text and about 25 more in the Exercises. The sample programs are masterpieces of clarity, exemplifying how invariant assertions can be embedded in comments to make understanding and verifying the programs as simple as possible. Wirth leaves little doubt as to the power of this technique, not merely by disoussing it but by doing it.
Sharing knowledge
Authors: Peter Marks, Peter Polak, Scott McCoy, Dennis Galletta
Venue: Communications of the ACM (2008)

How managerial prompting, group identification, and social value orientation affect knowledge-sharing behavior.