ppxscal/embedding_network huggingface dataset:
A Fuzzy Inference System for Packet Based Networks
Authors: Diego L. Cardoso, Adamo. L. Santana, Claudio A. Rocha, Carlos R. Frances, C. T. Costa, Jorge A. Souza
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents a fuzzy inference system to work the problem of process scheduling within a computer network. The scheduling system, simulated in the Network Simulator, acts in two particularly points: first defining the discard priority for the applications according to its characteristics; and further, to redefine their transfer rate, also considering its particularities.
Use of Frequency Diversity in Signal Strength based WLAN Location Determination Systems
Authors: Anil Ramachandran, Jagannathan Sarangapani
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Literature indicates that frequency diversity can be utilized to compensate channel uncertainties such as multipath fading. Therefore, in this paper it is exploited for improving accuracy in locating stationary and mobile objects in the indoor environment. First, frequency diversity technique is introduced for small scale and temporal variation compensation of received signals and demonstrated analytically that it in fact enhances location accuracy. A novel metric is introduced in selection combining in order to achieve location accuracy through the addition of frequency diversity upon two of the available location determination schemes. The results are evaluated experimentally against the case where there is no frequency diversity for reception by using low cost wireless RF devices such as motes. An asset location tracking system is then devised to both improve accuracy and predict asset movement. Frequency diversity in terms of channel spacing of 55 MHz is evaluated and shown to provide a reduction in location determination error between 18 and 23% when compared to a system without frequency diversity. Finally, results from frequency diversity are compared against the spatial diversity techniques in terms of improvement in location accuracy, power consumption of the transmitter, and hardware and software costs.
On optimal ordering of signals in parallel wire bundles
Authors: Konstantin Moiseev, Shmuel Wimer, Avinoam Kolodny
Venue: Integration, the VLSI Journal (2008)

Optimal ordering and sizing of wires in a constrained-width interconnect bundle are studied in this paper. It is shown that among all possible orderings of signal wires, a monotonic order of the signals according to their effective driver resistance yields the smallest weighted average delay. Minimizing weighted average delay is a good approximation for MinMax delay optimization. Three variants of monotonic ordering are proven to be optimal, depending on the Miller coupling factors (MCF) ratio between the signals at the sides of the bundle and that of the internal wires. The monotonic order property holds for a very broad range of VLSI circuit settings arising in common design practice. A simple, yet near-optimal, setting of wire widths within the bundle to yield the best average weighted delay is proposed. The theoretical results have been validated by numerical experiments on 65nm process technology and industrial design data. In all cases the ordering optimization yielded improvement in the range of 10% in wire delay, translated to about 5% improvement in the clock cycle of a high-performance microprocessor implemented in that technology.
Special Feature Microprocessors in Japan Status in 1978
Authors: R. Mori
Venue: Computer (1979)

By the third quarter of 1978, ten Japanese companies were producing some 80 types of microprocessors, including 61 original products. Both the rate of new product introductions and the directions of these developments are impressive.
Combination of HMM-Based Classifiers for the Recognition of Arabic Handwritten Words
Authors: R. Al-Hajj, C. Mokbel, L. Likforman-Sulem
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we present a two-stage system for the off-line recognition of cursive Arabic handwritten words. The proposed method is analytic without segmentation, and is able to cope with handwriting inclination and with shifted positions of diacritical marks. First, the recognition stage relies on 3 classifiers based on hidden Markov modelling (HMM). The second stage depends on the combination of these classifiers. The feature vectors used for recognition are related to pixel density distribution and to local pixel configurations. These vectors are extracted on word binary images by using a sliding window approach with different angles. We have experimented different combination schemes. The neural network-based combined system yields best performance on the IFN- ENIT benchmark data base of handwritten names of Tunisian villages/towns.
MIST: distributed indexing and querying in sensor networks using statistical models
Authors: Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformation of numeric data into symbols and the modeling of resulting symbolic sequences can be achieved using statistical models---Markov Chains (MCs) and Hidden Markov Models (HMMs). We consider the problem of distributed indexing and semantic querying over such sensor models. Specifically, we are interested in efficiently answering (i) range queries: return all sensors that have observed an unusual sequence of symbols with a high likelihood, (ii) top-1 queries: return the sensor that has the maximum probability of observing a given sequence, and (iii) 1-NN queries: return the sensor (model) which is most similar to a query model. All the above queries can be answered at the centralized base station, if each sensor transmits its model to the base station. However, this is communication-intensive. We present a much more efficient alternative---a distributed index structure, MIST (Model-based Index STructure), and accompanying algorithms for answering the above queries. MIST aggregates two or more constituent models into a single composite model, and constructs an in-network hierarchy over such composite models. We develop two kinds of composite models: the first kind captures the average behavior of the underlying models and the second kind captures the extreme behaviors of the underlying models. Using the index parameters maintained at the root of a subtree, we bound the probability of observation of a query sequence from a sensor in the subtree. We also bound the distance of a query model to a sensor model using these parameters. Extensive experimental evaluation on both real-world and synthetic data sets show that the MIST schemes scale well in terms of network size and number of model states. We also show its superior performance over the centralized schemes in terms of update, query, and total communication costs.
Virtual marionette theater using hand recognition
Authors: Daisuke Ninomiya, Koji Miyazaki, Ryohei Nakatsu
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

In this paper, we describe the virtual theater in which we can control computer graphics based marionette using hand gesture recognition.
Certificateless undeniable signature scheme
Authors: Shanshan Duan
Venue: Information Sciences: an International Journal (2008)

In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based cryptosystems. Also it can avoid the onerous management of certificates. Particularly, by using some cryptographic and mathematical techniques, we guarantee that the scheme's two component protocols satisfy the properties of zero-knowledge proofs. To address the security issues, we extend security notions of undeniable signatures to the complex certificateless setting, and consider two different types of adversaries. Based on these formally defined security notions, we prove that in the random oracle model, the certificateless undeniable signature scheme is secure in the sense of existential unforgeability under the Bilinear Diffie-Hellman assumption, and is secure in the sense of invisibility under the Decisional Bilinear Diffie-Hellman assumption.
From bold idea to product - a case study
Authors: W. Pree
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

In state-of-the-art methodologies the critical timing properties of embedded software systems are accidental consequences of an implementation, rather than specified parts of the design. The Giotto project, lead by Thomas Henzinger at the University of California, Berkeley, delivered the formally sound concept of logical execution time (LET) as abstraction for explicitly specifying the timing behavior of embedded software. The presentation outlines the various hurdles along the way from the initial idea in 2000 until the shipment of products that incorporate model-based design relying on LET in 2005. For example, it was tempting to overcome certain limitations of the programming model at the price of loosing crucial embedded software properties such as determinism.
Note: Covering symmetric semi-monotone functions
Authors: Roland Grappe, Zoltán Szigeti
Venue: Discrete Applied Mathematics (2008)

We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0,1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augmentation problem. Our contribution is to provide a significantly simpler and shorter proof.
SCTP Multihoming with Cross Layer Interface in Ad Hoc Multihomed Networks
Authors: Sakuna Charoenpanyasak, Beatrice Paillassa
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

As multihoming refers to a situation where a node can choose between several paths, the MANET networks that are mobile networks without infrastructure offer naturally a multihoming feature. It is managed at the network level by the routing protocol. Multihoming capacity is also present in the IETF transport protocol SCTP. In this work we consider multihoming both at transport and at network level. We focus on the SCTP protocol over AODV ad hoc networks1. After the presentation of the multihoming dysfunction, we propose a cross layer interface in order to achieve efficient combined multihoming. The proposed approach is examined through simulations. The benefit of multihoming is potentially greater goodput of the session in case of network failures. The obtained results show the advantage of multihoming with multiple fast retransmission policy.
On reciprocity indexes in the aggregation of fuzzy preference relations using the OWA operator
Authors: Yucheng Dong, Hongyi Li, Yinfeng Xu
Venue: Fuzzy Sets and Systems (2008)

Chiclana, Herrera and Herrera-Viedma studied conditions under which the reciprocity property is maintained in the aggregation of reciprocal fuzzy preference relations using the OWA operator guided by a relative linguistic quantifier. In this note, we focus on the reciprocity in the aggregation of fuzzy preference relations (that is, the additive reciprocity is not assumed) using the OWA operator. By defining a reciprocity index for measuring the non-reciprocity degree of fuzzy preference relations, we show that a sufficient (but not necessary) condition under which a ''collective'' fuzzy preference relation, obtained by aggregating a set of ''individual'' fuzzy preference relations using an OWA operator guided by a linguistic quantifier with parameter a and b, has a reciprocity index no greater than the largest of the corresponding ''individual'' reciprocity indexes. Our result is helpful to complete Chiclana et al.'s decision model [F. Chiclana, F. Herrera, E. Herrera-Viedma, Integrating three representation models in fuzzy multipurpose decision making based on fuzzy preference relations, Fuzzy Sets and Systems 97 (1998) 33-48].
A Novel Probabilistic Approach to Modeling the Pleasure-Arousal-Dominance Content of the Video based on "Working Memory"
Authors: Sutjipto Arifin, Peter Y. K. Cheung
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The rapid growth of digital video information nowadays is making video content classification and indexing tools a necessity. Little research efforts have been invested on content classification solutions based on the emotional content of the video, which have the potential of extending the scope of video indexing possibilities. The development of an affective content classification solution faces a number of challenges. These include the dynamic and time evolving nature of the video's emotional content and the uncertainty in the multimodal sensory observations. These challenges have resulted in the lack of reliable methods for video emotional content modeling. This paper introduce a novel probabilistic approach to model the emotional content of the video based on the Dynamic Bayesian Networks (DBNs). It is designed based on the Pleasure-Arousal-Dominance (P-A-D) emotion model [1], which in principle can represent a large number of emotions. It is also designed based on the concept of "working memory" [2], a theoretical framework within cognitive psychology that refers to the structures and processes used for temporarily storing and manipulating information [2]. Our experiment results demonstrate that "working memory" is an important aiding factor in complex emotional content analysis.
Detecting Change in Data Stream: Using Sampling Technique
Authors: Wei Li, Xiaoming Jin, Xiaojun Ye
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Detecting changes in data streams is an important area of research with many applications in which the underlying generating mechanism of data stream is constantly evolving, not liking the static data that was generated by a fixed process. To understand and study the evolving mechanism of the data stream, detecting the changes in data streams is necessary where the `change' is defined normally as `the change of distribution of the streaming data'. In many real-world applications, this problem is challenging. Firstly, only the data stored in a fixed size of memory can be examined, whereas the changes might occur within data items with much bigger size. Moreover, the streaming data arrive at a high speed rate, so if we can not process the data quickly, the detecting of the change will be impossible. In this paper, we attack the issues by introducing a change detection method that utilizing sampling technique. A formal definition of the change in data stream will be given. The approach assumes that the points in the data stream are independently generated, but otherwise no assumptions on the nature of the generating process. The empirical study demonstrates the superiority of our techniques over the existing ones in terms of both efficiency and effectiveness.
Design methodology to trade off power, output quality and error resiliency: application to color interpolation filtering
Authors: Georgios Karakonstantis, Nilanjan Banerjee, Kaushik Roy, Chaitali Chakrabarti
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Power dissipation and tolerance to process variations pose conflicting design requirements. Scaling of voltage is associated with larger variations, while Vdd up-scaling or transistor up-sizing for process tolerance can be detrimental for power dissipation. However, for certain signal processing systems such as those used in color image processing, we noted that effective trade-offs can be achieved between Vdd scaling, process tolerance and "output quality". In this paper we demonstrate how these tradeoffs can be effectively utilized in the development of novel low-power variation tolerant architectures for color interpolation. The proposed architecture supports a graceful degradation in the PSNR (Peak Signal to Noise Ratio) under aggressive voltage scaling as well as extreme process variations in sub-70nm technologies. This is achieved by exploiting the fact that some computations are more important and contribute more to the PSNR improvement compared to the others. The computations are mapped to the hardware in such a way that only the less important computations are affected by Vdd-scaling and process variations. Simulation results show that even at a scaled voltage of 60% of nominal Vdd value, our design provides reasonable image PSNR with 69% power savings.
The Third Generation of PC Graphics Controllers
Authors: J. James
Venue: IEEE Computer Graphics and Applications (1987)

This article surveys the current market status of PC-based graphics controllers. It reviews the short history of these products and provides a historical context for the changes in the market. The implications of these transitions are projected into the future to forecast market directions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
Authors: T. Lang
Venue: IEEE Transactions on Computers (1976)

The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array computer. Lawrie showed that this network can be used to perform some important permutations in log2 N steps. This work is extended and a network is proposed that permits the realization of any permutation in 0([mi][/mi]N) shuffle-exchange steps. Additional modifications to th
Security in outsourcing of association rule mining
Authors: W. K. Wong, David W. Cheung, Edward Hung, Ben Kao, Nikos Mamoulis
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Outsourcing association rule mining to an outside service provider brings several important benefits to the data owner. These include (i) relief from the high mining cost, (ii) minimization of demands in resources, and (iii) effective centralized mining for multiple distributed owners. On the other hand, security is an issue; the service provider should be prevented from accessing the actual data since (i) the data may be associated with private information, (ii) the frequency analysis is meant to be used solely by the owner. This paper proposes substitution cipher techniques in the encryption of transactional data for outsourcing association rule mining. After identifying the non-trivial threats to a straightforward one-to-one item mapping substitution cipher, we propose a more secure encryption scheme based on a one-to-n item mapping that transforms transactions non-deterministically, yet guarantees correct decryption. We develop an effective and efficient encryption algorithm based on this method. Our algorithm performs a single pass over the database and thus is suitable for applications in which data owners send streams of transactions to the service provider. A comprehensive cryptanalysis study is carried out. The results show that our technique is highly secure with a low data transformation cost.
Randomized radon transforms for biometric authentication via fingerprint hashing
Authors: Mariusz H. Jakubowski, Ramarathnam Venkatesan
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

We present a new technique for generating biometric fingerprint hashes, or summaries of information contained in human fingerprints. Our method calculates and aggregates various key-determined metrics over fingerprint images, producing short hash strings that cannot be used to reconstruct the source fingerprints without knowledge of the key. This can be considered a randomized form of the Radon transform, where a custom metric replaces the standard line-based metric. Resistant to minor distortions and noise, the resulting fingerprint hashes are useful for secure biometric authentication, either augmenting or replacing traditional password hashes. This approach can help increase the security and usability of Web services and other client-server systems.
A Hybrid Metaheuristic ACO-GA with an Application in Sports Competition Scheduling
Authors: Huang Guangdong, Ling Ping, Wang Qun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper presents a hybrid metaheuristic ACOGA for the problem of sports competition scheduling (SCS). ACO-GA combines ant colony optimization (ACO) and genetic algorithms (GA). The procedures of ACO-GA are as follows. First, GA searches the solution space and generates activity lists to provide the initial population for ACO. Next, ACO is executed, when ACO terminates, the crossover and mutation operations of GA generate new population. ACO and GA search alternately and cooperatively in the solution space. Then we test ACO-GA with Oliver30 and att48. The results indicate that ACO-GA is an effective method. Finally this paper deals with SCS using ACO-GA.
The application of GM (1,1) model of grey prediction to supply and demand of doctor's manpower for otolaryngologists in Taiwan
Authors: Chaang-Yung Kung, Ming-Tzung Ho, Li-Chen Chen
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Over the years, low-risk otolaryngology has been becoming a more popular choice for Taiwan's newly-admitted physicians given the fact that people in Taiwan are increasingly paying attention to medical matters, compounding more medical disputes and lowered national health insurance payment. It has resulted in a physician manpower imbalance. The imbalance will lead to the medical quality problem, so it is a crucial issue that the government shall place a high priority. Due to the short history of national health insurance in Taiwan, very few physician manpower statistics are available. Thus, it is difficult to get precise results by using conventional prediction methods with limited data. Under such circumstances, based on national health insurance statistics, this study uses the GM (1,1) model, which produces a grey prediction with a small amount of data, to proceed with the prediction for the demand and supply of physician manpower in Taiwan. The results show that the supply of otolaryngologists in Taiwan will exceed the demand for 2005 through 2008, and the gap will be increasing year by year. The study also suggests that the GM (1,1) model be applicable for the research on the planning of physician manpower.
Interconnection of Local Computer Networks: Modeling and Optimization Problems
Authors: G. Bernard
Venue: IEEE Transactions on Software Engineering (1983)

We study problems of optimization of the topology of interconnected local computer networks using random access to a single channel. An approach to modeling of the system by a queueing network is proposed: the analytical solution of the model allows us to obtain global performance measures, which may be used as evaluation criteria in network topology optimization problems. A heuristic is proposed for the latter aspect for one class of problems. We also derive from the model the time needed, for a new user which joins the network, to transmit its number of messages.