ppxscal/embedding_network huggingface dataset:
A New Time-Frequency Spectrogram Analysis of FH Signals by Image Enhancement and Mathematical Morphology
Authors: Xu Mankun, Ping Xijian, Li Tianyun, Xu Mantian
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A new method is proposed to extract the parameters of frequency hopping (FH) signals. After short-time Fourier transform (STFT), the time-frequency spectrogram of FH signals is treated as a kind of digital image with special contents. The spectrogram analysis is investigated to detect and extract FH parameters by useful image enhancement techniques and mathematical morphology. First, the spectrogram image is enhanced by contrast stretch and binarization. Then, morphological closing and opening cascaded operations are manipulated using rectangular structure elements horizontally and vertically. After morphological image processing, the spectrogram edges are extracted by boundary tracking and extraction. Finally, the important FH parameters, such as hopping carrier frequency, hop timing and hop rate can be estimated, which lay the foundations for later finer hopping frequency location. The experimental results and analysis on the short-wave FH signals show the good performance of the proposed method.
The Impact of Wide-Band Local Area Communication Systems on Distributed Computing
Authors: M. V. Wilkes
Venue: Computer (1980)

Work in the design and implementation of local area systems holds the key to the future of large distributed computer installations.
Job Satisfaction Evaluation Using Fuzzy Approach
Authors: Khairul A. Rasmani, Nor Azni Shahari
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Likert-type scale that employs ordinal values to represent linguistics terms has been very popular in the studies on job satisfaction evaluation. In this work, it is argued that the use of ordinal values in Likert scale does not offer the best way in representing the linguistic terms. This paper proposes the use of fuzzy sets to represent linguistic terms in Likert-type scale and employs the technique using fuzzy conjoint method in job satisfaction evaluation. Experimental results show that the analysis using fuzzy conjoint method produced consistent result compared to the analysis using the percentage. However, the fuzzy membership values obtained from fuzzy conjoint method can be used to compare the decisions between criteria used to measure job satisfaction, and hence is very useful in providing additional information for decision-making.
Efficient search ranking in social networks
Authors: Monique V. Vieira, Bruno M. Fonseca, Rodrigo Damazio, Paulo B. Golgher, Davi de Castro Reis, Berthier Ribeiro-Neto
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In social networks such as Orkut, www.orkut.com, a large portion of the user queries refer to names of other people. Indeed, more than 50% of the queries in Orkut are about names of other users, with an average of 1.8 terms per query. Further, the users usually search for people with whom they maintain relationships in the network. These relationships can be modelled as edges in a friendship graph, a graph in which the nodes represent the users. In this context, search ranking can be modelled as a function that depends on the distances among users in the graph, more specifically, of shortest paths in the friendship graph. However, application of this idea to ranking is not straightforward because the large size of modern social networks (dozens of millions of users) prevents efficient computation of shortest paths at query time. We overcome this by designing a ranking formula that strikes a balance between producing good results and reducing query processing time. Using data from the Orkut social network, which includes over 40 million users, we show that our ranking, augmented by this new signal, produces high quality results, while maintaining query processing time small.
Predicting unobserved links in incompletely observed networks
Authors: David J. Marchette, Carey E. Priebe
Venue: Computational Statistics Data Analysis (2008)

In this paper we consider networks in which the links (edges) are imperfectly observed. This may be a result of sampling, or it may be caused by actors (vertices) who are actively attempting to hide their links (edges). Thus the network is incompletely observed, and we wish to predict which of the possible unobserved links are actually present in the network. To this end, we apply a constrained random dot product graph (CRDPG) to rank the potential edges according to the probability (under the model) that they are in fact present. This model is then extended to utilize covariates measured on the actors, to improve the link prediction. The method is illustrated on a data set of alliances between nations, in which a subset of the links (alliances) is assumed unobserved for the purposes of illustration.
*MOD A Language for Distributed Programming
Authors: R. P. Cook
Venue: IEEE Transactions on Software Engineering (1980)

Distributed programming is characterized by high communications costs and the inability to use shared variables and procedures for interprocessor synchronization and communication. *MOD is a high-level language system which attempts to address these problems by creating an environment conducive to efficient and reliable network software construction. Several of the *MOD distributed programming constructs are discussed as well as an interprocessor communication methodology. Examples illustrating these concepts are drawn from the areas of network communication and distributed process synchronization.
Standards development and diffusion: a case study of RosettaNet
Authors: Wai Fong Boh, Christina Soh, Steven Yeo
Venue: Communications of the ACM (2007)

The RosettaNet consortium aligns its diffusion strategies with its development processes while adapting them to the local conditions in the home countries of its member organizations.
Model-based containment of process fault dissemination
Authors: Martijn van Veelen, Lambert Spaanenburg
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

The past decade has witnessed a marked increase in distributed system complexity. This was driven by a maturing technology that steadily decreased the number of faults. Unfortunately these fewer faults have become exponentially more costly. It becomes mandatory to detect faults prior to taking effect on the network. Such an early detection requires a new test, detection and fault containment strategy, of which the outline and some basic ingredients are sketched here.
Self-organizing schema mappings in the GridVine peer data management system
Authors: Philippe Cudré-Mauroux, Suchit Agarwal, Adriana Budura, Parisa Haghani, Karl Aberer
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer -- where data, schemas and mappings are managed -- from a physical layer consisting of a structured Peer-to-Peer network supporting efficient routing of messages and index load-balancing. Our system is totally decentralized, yet it fosters semantic interoperability through pairwise schema mappings and query reformulation. In this demonstration, we present a set of algorithms to automatically organize the network of schema mappings. We concentrate on three key functionalities: (1) the sharing of data, schemas and schema mappings in the network, (2) the dynamic creation and deprecation of mappings to foster global interoperability, and (3) the propagation of queries using the mappings. We illustrate these functionalities using bioinformatic schemas and data in a network running on several hundreds of peers simultaneously.
An efficient implementation of a low-complexity MP3 algorithm with a stream cipher
Authors: Chih-Hsu Yen, Yu-Shiang Lin, Bing-Fei Wu
Venue: Multimedia Tools and Applications (2007)

For portable devices with MP3 codec, the demands of digital right management arise recently. To provide a secure scheme to the most portable devices with MP3 codec, this work efficiently implements a secure MP3 algorithm on a dual-core system with one DSP and one RISC. The secure MP3 algorithm is a combination of a proposed low-complexity MP3 algorithm and a stream cipher. The low-complexity MP3 algorithm is executed on DSP and the stream cipher is on RISC. This separated design can dynamically update the type of stream ciphers in various applications. However, some of the main data, rather than an entire MP3 file, is encrypted in the MP3 frame. The partially encrypted data have variable size, determined by the specified security level. The security scheme offers two advantages. The first is that the encrypting and decrypting structures are identical. The second is that the scheme easily determines the quality of the encrypted MP3. For saving the computational power to obtain long playing time for a portable device, a low-complexity MP3 encoder and decoder are implemented using ADSP-2181 with 16-bit fixed-point data precision. MP3 encoding requires only 27.2 KB/16.8 KB (data RAM/program RAM), and decoding requires 23.6 KB/20.7 KB for decoder. The peak MIPS of the encoder and decoder are 21.05 and 17.67, respectively. This work can be applied to a Digital Rights Management (DRM) system for limiting the access of the music.
Test Point Selections for a Programmable Gain Amplifier Using NIST and Wavelet Transform Methods
Authors: Xinsong Zhang, Simon S. Ang, Chandra Carter
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Test point selections for a programmable gain amplifier (PGA) using the National Institute of Standard (NIST) and wavelet transform methods are investigated. Although the wavelet transform method is an efficient method in test point selection for many mixed-signal devices, for a PGA with 31 input steps, the NIST method is shown to be more accurate in predicting the output gain responses than the wavelet transform method.
Compact modeling of variational waveforms
Authors: V. Zolotov, J. Xiong, S. Abbaspour, D. J. Hathaway, C. Visweswariah
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In ultra-deep sub-micron technologies, modeling waveform shapes correctly is essential for accurate timing and noise analysis. Due to process and environmental variations, there is a need for a variational waveform model that is compact, efficient and accurate. The model should capture correlations due to common dependence on process parameters. This paper proposes a waveform model derived from basic transformations of a nominal waveform in the absence of variations. The transformations are parameterized by variational quantities that capture the sensitivity of the waveform to process parameters. The resulting waveform model works well with current-source models for static timing analysis. Numerical results are presented to demonstrate the accuracy of the model both in capturing variational waveforms and in propagating waveforms through logic gates.
An Efficient Ant Colony Algorithm for Multiple Sequences Alignment
Authors: Ling Chen, Lingjun Zou, Juan Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.
Book Review
Authors: H. S. Stone
Venue: Computer (1972)

The computer revolution, like most revolutions, concerns a change in the decision-making structure of society. Computer technology has already had a tremendous impact in industry and government in its relatively short lifetime, and future technological advances have the potential for bringing truly incredible changes in our way of life. The issue faced by Rothman and Mossman, an issue that we all must face, is how can we guarantee that computer technology be used to the greatest benefit of society? Certainly, we have enough examples of technological advances that have been mixed blessings to society. A case in point is the automobile. If we had known a half century ago that the automobile would be a major factor in air pollution and urban sprawl, what would we have done differently to protect the health and environment of society?
Cooperative games with fuzzy coalitions and fuzzy characteristic functions
Authors: Surajit Borkotokey
Venue: Fuzzy Sets and Systems (2008)

In this paper, an extension of a cooperative fuzzy game is proposed, which admits the representation of the rate of participation of every player in a coalition and also associates fuzziness with the value of the game. Games, subject to fuzzy coalitions as well as those pertaining to fuzzy characteristic functions or vague expectations are separately studied in the literature. We propose an extension of a fuzzy game with fuzzy coalitions and vague expectations together and obtain some interesting properties. It has been observed that most of the properties satisfied by a crisp game hold good in the fuzzy sense in this extension. A practical application of the proposed model in Investment Theory is being provided. Further, a Shapley function in the fuzzy sense has been proposed as a solution concept to this class of games. The notion of a fuzzy population monotonic allocation function (FPMAF) is defined and established that the proposed Shapley function is an FPMAF also.
Global Flow Analysis in Automatic Logic Design
Authors: L. Trevillyan
Venue: IEEE Transactions on Computers (1986)

This correspondence concerns applications of optimization techniques based on global flow analysis to the automated design of logic. Previous optimization work on logic design has relied primarily on either local transformations on the circuit graph or on the use of two-level Boolean minimization. Our methods involve linear time algorithms which extend the scope of local optimizations to the entire design. Their use, in some cases, has resulted in a reduction in gate count, in improved control over path length, and in better detection and elimination of redundancy.
Effective OLAP Mining of Evolving Data Marts
Authors: Ronnie Alves, Orlando Belo, Fabio Costa
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Organizations have been used decisions support systems to help them to understand and to predict interesting business opportunities over their huge databases also known as data marts. OLAP tools have been used widely for retrieving information in a summarized way (cube-like) by employing customized cubing methods. The majority of these cubing methods suffer from being just data-driven oriented and not discovery-driven ones. Data marts grow quite fast, so an incremental OLAP mining process is a required and desirable solution for mining evolving cubes. In order to present a solution that covers the previous mentioned issues, we propose a cube-based mining method which can compute an incremental cube, handling concept hierarchy modeling, as well as, incremental mining of multidimensional and multilevel association rules. The evaluation study using real and synthetic datasets demonstrates that our approach is an effective OLAP mining method of evolving data marts.
A Simplified Summation Array for Cellular Logic Modules
Authors: D. W. Hutton
Venue: IEEE Transactions on Computers (1974)

A greatly simplified configuration is proposed for the array that performs summation in a cellular logic module. Such modules realize arbitrary, multioutput, combinational switching behavior as sums of products (or sums of other terms). Special cases of these modules are random-access and associative memories (conventional or READ-ONLY). The simplifications are achieved by taking advantage of the symmetries among the product (or term) buses and symmetries among the output lines, as well as the fact that extensive sharing of terms among output functions does not normally occur in practice. In many cases of interest, the simplified memory array can be reduced to a single column of cells.
Making FF Faster in ADL Domains
Authors: Dunbo Cai, Jigui Sun, Minghao Yin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The Fast-Forward planning system (FF), which obtains heuristics via a relaxed Planning Graph to guide the enforced hill-climbing search strategy, has shown excellent performance in most STRIPS domains. When it comes to ADL domains, FF handles actions with conditional effects in a way similar to factored expansion. The result is that enforced hill-climbing guided by the relaxed Graphplan always fails in some ADL domains. We have discovered that the reason behind this issue is the relaxed Graphplan's inability to handle relationships between actions' components. We propose a novel approach called delayed partly reasoning on a naïve conditional-effects Planning Graph (DP-CEPG). We do not ignore action's delete effects and consider restricted induced component mutual exclusions between factored expanded actions. Preliminary results show that enforced hill-climbing while guided by DP-CEPG gains obvious improvements in most ADL problems in terms of both solution length and runtime.
Partial query resolution for animation authoring
Authors: Phani S. Kotharu, B. Prabhakaran
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

Animations are a part of multimedia and techniques such as motion mapping and inverse kinematics aid in reusing models and motion sequences to create new animations. This reuse approach is facilitated by the use of content-based retrieval techniques that often require fuzzy query resolution. Most fuzzy query resolution approaches work on all the attributes of the query to minimize the database access cost thus resulting in an unsatisfactory result set. It turns out that the query resolution can be carried out in a partial manner to achieve user satisfactory results and aid in easy authoring. In this article, we present two partial fuzzy query resolution approaches, one that results in high-quality animations and the other that produces results with decreasing number of satisfied conditions in the query.
Research on Ant Colony Neural Network PID Controller and Application
Authors: Cao Chengzhi, Guo Xiaofeng, Liu Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

NN (Neural Network) combine with traditional PID (Proportional Integral Derivative) control to make control system has corresponding degree aptitude. However, NN rate of convergence is slower and is liable to get into local minima and affect NN application in the real time control. In order to search speediness algorithm of global convergence to satisfy the real time control and better performance, this paper applies ACA (Ant Colony Algorithm) to optimize the parameters of NN-PID controller to improve the on-line self-tuning capability of this controller. At the same time, the strategy is implemented using TMS320F240 digital signal processor on induction motor drive DTC (Direct Torque Control) system. Experiment results validate that this method is validity and the system has a better dynamic and static state performance.
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT
Authors: Miroslav N. Velev
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Many important EDA problems can be formulated as graph coloring, which is a class of the Constraint Satisfaction Problem (CSP). This paper makes three contributions. First, we define new encodings for representing CSPs as equivalent Boolean Satisfiability (SAT) problems: 1) a generalization of the log encoding by using ITE trees to select the domain values of a CSP variable, so that only conflict clauses are required; and 2) a simplified direct encoding, derived from the direct encoding (where each domain value of a CSP variable is indexed by a unique Boolean variable) by omitting one of the Boolean variables and the at-least-one clause. Second, we propose the use of hierarchical encodings that combine several simple encodings to index the domain values of CSP variables, in order to produce SAT formulas that depend on fewer Boolean variables and are easier to solve. Third, we study schemes for static ordering of the Boolean variables in a Conjunctive Normal Form (CNF) representation of a CSP, based on the structure of the CSP graph, such that the resulting variable order is used for the decisions made by a SAT solver when evaluating the CNF. We compare 12 previously known SAT encodings for CSP with the two new encodings, as well as with 10 hybrid encodings. With symmetry-breaking constraints enforced, static variable ordering produced up to 2 orders of magnitude speedup. Additionally exploiting hierarchical encodings resulted in another order of magnitude speedup.
Microdare Special Feature Microdare: A Fast, Direct-Executing High-level Language System for Small Computers
Authors: G. A. Korn
Venue: Computer (1979)

Embedded in an advanced Basic dialect, this system promises to simplify end-user applications in areas such as simulation and laboratory automation.
Map navigation with mobile devices: virtual versus physical movement with and without visual context
Authors: Michael Rohs, Johannes Schöning, Martin Raubal, Georg Essl, Antonio Krüger
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

A user study was conducted to compare the performance of three methods for map navigation with mobile devices. These methods are joystick navigation, the dynamic peephole method without visual context, and the magic lens paradigm using external visual context. The joystick method is the familiar scrolling and panning of a virtual map keeping the device itself static. In the dynamic peephole method the device is moved and the map is fixed with respect to an external frame of reference, but no visual information is present outside the device's display. The magic lens method augments an external content with graphical overlays, hence providing visual context outside the device display. Here too motion of the device serves to steer navigation. We compare these methods in a study measuring user performance, motion patterns, and subjective preference via questionnaires. The study demonstrates the advantage of dynamic peephole and magic lens interaction over joystick interaction in terms of search time and degree of exploration of the search space.