ppxscal/embedding_network huggingface dataset:
Hotmap: Looking at Geographic Attention
Authors: Danyel Fisher
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Understanding how people use online maps allows data acquisition teams to concentrate their efforts on the portions of the map that are most seen by users. Online maps represent vast databases, and so it is insufficient to simply look at a list of the most-accessed URLs. Hotmap takes advantage of the design of a mapping system's imagery pyramid to superpose a heatmap of the log files over the original maps. Users' behavior within the system can be observed and interpreted. This paper discusses the imagery acquisition task that motivated Hotmap, and presents several examples of information that Hotmap makes visible. we discuss the design choices behind Hotmap, including logarithmic color schemes; low-saturation background images; and tuning images to explore both infrequently-viewed and frequently-viewed spaces.
Wideband Beam-Space DOA Estimation Based on Genetic Algorithm
Authors: Yong Jin, Jianguo Huang, Jianjun Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Many of the DOA methods such as MUSIC, ESPRIT and ML are applicable only to narrowband signal sources. However, in many case, using information from multiple frequency bins in a wideband methods is necessary to achieve the processing gain needed to obtain good estimates. A beam-space genetic algorithm (BGA) is introduced for Direction of Arrival (DOA) estimation of wideband signals in this paper. By transforming array data to beam-space using frequency invariant beam forming matrix, the beam-space genetic algorithm is applied to estimate DOA of wideband signals. Simulation results show this proposed algorithm performs better than sub-space algorithm, maximum likelihood algorithm and element space genetic algorithm in low SNR ranges.
The Two's Complement Quasi-Serial Multiplier
Authors: T. G. McDonald
Venue: IEEE Transactions on Computers (1975)

This correspondence develops a multiplier for two's complement numbers, similar to the quasi-serial multiplier which operates on sign magnitude numbers. The method offers an alternative to add shift techniques for low cost two's complement multiplication.
Global exponential stability analysis of delayed Cohen-Grossberg neural networks with distributed delays
Authors: Xuyang Lou, Baotong Cui
Venue: International Journal of Systems Science (2007)

In this article, the global exponential stability problem of Cohen-Grossberg neural networks with both discrete-time delays and distributed delays is investigated. The existence and global stability for the unique equilibrium of the Cohen-Grossberg neural networks with distributed delays are achieved by using some new Lyapunov functionals, M-matrix theory and some analytic techniques, and some less restrictive conditions are obtained. An example is also worked out to validate the advantages of our results.
Unicode Steganographic Exploits: Maintaining Enterprise Border Security
Authors: Frank J. Mabry, John R. James, Aaron J. Ferguson
Venue: IEEE Security and Privacy (2007)

Unicode is rapidly becoming the preferred means for representing symbols used in creating multimedia content, especially for information that's presented in multiple languages. A vulnerability in unicode leaves such content susceptible to being used for the creation of covert channel communications.
A New Economical Implementation for Scannable Flip-Flops in MOS
Authors: Dilip Bhavsar
Venue: IEEE Design Test (1986)

A New implementation for scannable flip-flops in MOS is economical for use in systems that use single latch design. The ?SystemLatch-Scannable Flop? (SL-SF) requires two additional transfer gates, two test clocks, and possibly a test mode signal. Hardwarepernalties paid in SL-SF can be the least among other implementations with equivalent test functionality. This article discussesSL-SF only in the context of its scan-path implementation; its applicability to linear feedback shift-register-based self-testshould be obvious. 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
Network Traffic Prediction Algorithm and its Practical Application in real network
Authors: Jun Lv, Tong Li, Xing Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Due to the complicated and ever-changing characteristics of Internet, network traffic prediction is a very complex and difficult issue in the network management and design. This paper shows a model with a new algorithm (MLSL), which updates the model parameters and improves the adaptive ability of the model. Generating Self-similar series to simulate the network traffic and do some test, the experimental results of simulating and actual network traffic data have proved that this algorithm has the advantage of high accuracy and fast convergence.
Optimal Design of Distributed Information Systems
Authors: P. P. -S. Chen
Venue: IEEE Transactions on Computers (1980)

In this paper a model is developed for the optimization of distributed information systems. Compared with the previous work in this area, the model is more complete, since it considers simultaneously the distribution of processing power, the allocation of programs and databases, and the assignment of communication line capacities. It also considers the return flow of information, as well as the dependencies between programs and databases. In addition, an algorithm, based on the "bounded branch and bound" integer programming technique, has been developed to obtain the optimal solution of the model. The algorithm is more efficient than several existing general nonlinear integer programming algorithms. Also, it avoids some of the disadvantages of heuristic and decomposition algorithms which are used widely in the optimization of computer networks and distributed databases. The algorithm has been implemented in Fortran, and the computation times of the algorithm for several test problems have been found very reasonable.
Fast Route Optimization for Dynamic Nested NEMO
Authors: Jae-Kwon Seo, Sung-Hyun Nam, Kyung-Geun Lee
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

As wireless communication and terminal technologies develop, the mobility of users rapidly increases. The users in this dynamic state also want to connect their devices and to receive seamlessly services anywhere, anytime. Standard groups therefore progress the research and standardization for "mobility support'. Network Mobility (NEMO) proposed by IETF focuses on the condition where the entire network moves. However, in the "NEMO basic support protocol', the tunneling overheads increase and the pinball-routing problem occurs as the levels of nesting of a mobile network increase. Thus, various schemes have been proposed under the route optimization of the nested NEMO. However, the existing schemes have a long convergence time in route optimization after handoff. In addition, if the levels of nesting are changed, the communication is disrupted. Therefore, we propose a fast route optimization to support real-time applications even if the levels of nesting of a mobile network are dynamically changed.
Multiple structural alignment and clustering of RNA sequences
Authors: Elfar Torarinsson, Jakob H. Havgaard, Jan Gorodkin
Venue: Bioinformatics (2007)

Motivation: An apparent paradox in computational RNA structure prediction is that many methods, in advance, require a multiple alignment of a set of related sequences, when searching for a common structure between them. However, such a multiple alignment is hard to obtain even for few sequences with low sequence similarity without simultaneously folding and aligning them. Furthermore, it is of interest to conduct a multiple alignment of RNA sequence candidates found from searching as few as two genomic sequences. Results: Here, based on the PMcomp program, we present a global multiple alignment program, foldalignM, which performs especially well on few sequences with low sequence similarity, and is comparable in performance with state of the art programs in general. In addition, it can cluster sequences based on sequence and structure similarity and output a multiple alignment for each cluster. Furthermore, preliminary results with local datasets indicate that the program is useful for post processing foldalign pairwise scans. Availability: The program foldalignM is implemented in JAVA and is, along with some accompanying PERL scripts, available at http://foldalign.ku.dk/ Contact: gorodkin@genome.ku.dk
Orientation Adaptive Discrete Packet Wavelet Decomposition via Shifting Operators for Image Compression
Authors: Stefano Andriani, David Taubman
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper we present novel techniques to adapt conventional wavelet transforms to follow locally oriented features found in images. We introduce a shift operator before each step in a lifting implementation of the DWT. The best shifts are estimated by minimizing the high-pass coefficient energy and then used in both the prediction and update lifting steps. To approximate the asymptotically optimal rate-distortion performance of a piece-wise regular function more closely, we adopt a packet wavelet decomposition. Experimental results obtained integrating the proposed transform into the JPEG2000 codec show improvements in both visual and objective tests, allowing for a "better" representation of the edges at very-low rates. Very recently, some related ideas have been presented by other authors. The most distinctive features of this paper include a more flexible packet wavelet decomposition structure and a comparison between subband- and image-domain shifting operators.
Mathematical modeling and optimization of intratumor drug transport
Authors: D. A. Klyushin, N. I. Lyashko, Yu. N. Onopchuk
Venue: Cybernetics and Systems Analysis (2007)

A pseudohyperbolic problem of optimal control of intratumoral drug distribution is formulated. It takes into account the heterogeneity of tumor tissues and effects of convection diffusion in a fissured porous medium. A mathematical model constructed and the corresponding optimal control problem are shown to be correct.
Optimal buffer allocation in finite closed networks with multiple servers
Authors: Mustafa Yuzukirmizi, J. MacGregor Smith
Venue: Computers and Operations Research (2008)

In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included.
Meta-models of Domain Modeling Framework for Networked Software
Authors: Jian Wang, Keqing He, Bing Li, Wei Liu, Rong Peng
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Networked software is a complex software system deployed on network environment. Web services are the essential components of Networked software, and reuse in this granularity is especially significant. In this paper, we propose a domain modeling framework for Networked software named O-RGPS, which is a layered network including five layers. O-RGPS models the common requirements of a family of systems, and provides feasible solutions for these requirements by aggregating Web services. We introduce the meta-models of each layer in O-RGPS in detail.
Intuitive quasi-eigen faces
Authors: Ig-Jae Kim, Hyeong-Seok Ko
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In blendshape-based facial animation, two main approaches are used to create the key expressions: manual sculpting and statistically-based techniques. Hand-generated expressions have the advantage of being intuitively recognizable, thus allowing animators to use conventional keyframe control. However, they may cover only a fraction of the expression space, resulting in large reproduction/animation errors. On the other hand, statistically-based techniques produce eigenfaces that give minimal reproduction errors but are visually non-intuitive. In this paper we propose a technique to convert a given set of hand-generated key expressions into another set of so-called quasi-eigen faces. The resulting expressions resemble the original hand-generated expressions, but have expression space coverages more like those of statistically generated expression bases. The effectiveness of the proposed technique is demonstrated by applying it to hand-generated expressions.
Detecting distance-based outliers in streams of data
Authors: Fabrizio Angiulli, Fabio Fassetti
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to detect anomalies in the current window. Two algorithms are presented. The first one exactly answers outlier queries, but has larger space requirements. The second algorithm is directly derived from the exact one, has limited memory requirements and returns an approximate answer based on accurate estimations with a statistical guarantee. Several experiments have been accomplished, confirming the effectiveness of the proposed approach and the high quality of approximate solutions.
An Integrated Instrumentation Environment for Multiprocessors
Authors: Z. Segall
Venue: IEEE Transactions on Computers (1983)

This paper introduces the concept of an integrated instrumentation environment (IIE) for multiprocessors. The primary objective of such an environment is to assist the user in the process of experimentation. The emphasis in an IIE is on experiment management (including stimulus generation, monitoring, data collection and analysis), rather than on techniques for program development as in conventional programming environments. We believe the functionality of the two environments should eventually be provided in one comprehensive environment.
Semantic Analysis for Topical Segmentation of Videos
Authors: Youngja Park, Ying Li
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Topic segmentation of videos enables topic-based categorization, retrieval and browsing and also facilitates efficient video authoring. Existing video topic segmentation techniques, however, are domain specific to news or narrative videos while generic approaches based on video shot analysis generate too fine-grained micro-segments. This paper addresses this challenge through a multi-modal semantic analysis technique for recognizing topical segments. We analyze the content of a video by using textual and audio features such as keyword synonym sets, sentence boundary information, silence/music breaks and speech similarity. Specifically, we propose a new natural language processing (NLP) technique for constructing synonym sets from video transcripts. A synonym set is a list of domainspecific keywords that are semantically related and represent a topic. We align the synonym sets with audio cues to identify the topical segments. Our experiments with six instructional videos show that the system produced very small number of false positives, and the topical segments generated by our system are 5.5 times longer on average compared to those generated by a state-of-the-art micro-segmentation system. The system has been embedded in an e-Learning project, and the user feedback on using the generated topical segments is very encouraging. The experiments were conducted with instructional videos, but our approach is domain-general and is not restricted to instructional videos.
Conjugate schema and basis representation of crossover and mutation operators
Authors: Sanza T. Kazadi
Venue: Evolutionary Computation (1998)

In genetic search algorithms and optimization routines, the representation of the mutation and crossover operators are typically defaulted to the canonical basis. We show that this can be influential in the usefulness of the search algorithm. We then pose the question of how to find a basis for which the search algorithm is most useful. The conjugate schema is introduced as a general mathematical construct and is shown to separate a function into smaller dimensional functions whose sum is the original function. It is shown that conjugate schema, when used on a test suite of functions, improves the performance of the search algorithm on 10 out of 12 of these functions. Finally, a rigorous but abbreviated mathematical derivation is given in the appendices.
Peer to patent needs your expertise
Authors: Andy Oram
Venue: Communications of the ACM (2008)

You can help ensure that computer-related patents are properly reviewed and stop the worthless ones from being granted.
A New Ridgelet Neural Network Training Algorithm Based on Improved Particle Swarm Optimization
Authors: Rijian Su, Li Kong, Shengli Song, Pu Zhang, Kaibo Zhou, Jingjing Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

An improved particle swarm optimization is used to train ridgelet neural network instead of the traditional gradient algorithms. Firstly, the model of rigdelet neural network and the traditional Particle Swarm Optimization(PSO) algorithm are briefly described. Secondly, an improved particle swarm optimization with self-adaptation mutation factor is proposed. Then the improved particle swarm optimization is applied to rigdelet neural network training. Experimental results demonstrate that the new algorithm is better than the traditional particle swarm optimization algorithm in training ridgelet neural network. It has both a better stability and a steady convergence, and is easy to be realized.
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"
Authors: Chao-Chih Yang
Venue: IEEE Transactions on Computers (1975)

This correspondence provides some clarifications and revision to the above-mentioned paper.1 It also presents the generalized versions of the definitions and theorems related to closure classes. These versions are applicable to arbitrary subsets of the state set of a sequential machine.
Hippocrates: First-Do-No-Harm Detailed Placement
Authors: Haoxing Ren
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Physical synthesis optimizations and engineering change orders typically change the locations of cells, resize cells or add more cells to the design after global placement. Unfortunately, those changes usually lead to wirelength increases; thus another pass of optimizations to further improve wirelength, timing and routing congestion characteristics is required. Simple wirelength-driven detailed placement techniques could be useful in this scenario. While such techniques can help to reduce wirelength, ones without careful timing constraint considerations might degrade the timing characteristics (worst negative slack, total negative slack, etc) and/or introduce more electrical violations (exceeding maximum output load constraints and maximum input slew constraints). In this paper, we propose a new detailed placement paradigm, which use a set of pin-based timing and electrical constraints in detailed placement to prevent it from degrading timing or violating electrical constraints while reducing wire-length, thus dubbed as Hippocrates: FIRST-DO-NO-HARM optimizations. Our experimental results show great promises. By honoring these constraints, our detailed placement technique not only reduces total wirelength (TWL), but also significantly improves timing, achieving 37% better total negative slack (TNS).
The national weather sensor grid
Authors: Hock Beng Lim, Keck Voon Ling, Wenqiang Wang, Yuxia Yao, Mudasser Iqbal, Boyang Li, Xiaonan Yin, Tarun Sharma
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

With the rapid advances in technologies such as MEMS sensors, low-power embedded processing and wireless networking, sensor networks are becoming more powerful in terms of data acquisition and processing capabilities. Sensor networks can now be deployed in the physical world for various important applications such as environmental monitoring, weather monitoring and modeling, military surveillance, healthcare monitoring, tracking of goods and manufacturing processes, smart homes and offices, etc.
k-dimensional Size Functions for Shape Description and Comparison
Authors: Andrea Cerri, Silvia Biasotti, Daniela Giorgi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper advises the use of k-dimensional size functions for comparison and retrieval in the context of multidimensional shapes, where by shape we mean something in two or higher dimensions having a visual appearance. The attractive feature of k-dimensional size functions is that they allow to readily establish a similarity measure between shapes of arbitrary dimension, taking into account different properties expressed by a multivalued real function defined on the shape. In particular, we outline the potential of this approach in a series of experiments.
A Logical Model for Detecting Irregular Actions in Physical Access Environment
Authors: Antonio Leong, Simon Fong, Zhuang Yan
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper proposes a framework to learn about irregular and abnormal behavior of access card user's pattern based on the real-time analysis data. The aim of the technique is to overcome the security level problem set by human and therefore relying on the collected real-time data in order to study the pattern of the access users. The concept of studying the irregular bahavior of the access user is using Predicate Logics for rule checking. An architecture of the model is described which includes the relationship between the user-level and the dependants as well as the accessing points.
Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields
Authors: Arash Hariri, Arash Reyhani-Masoleh
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

Finite field arithmetic is used in applications like cryptography, where it is crucial to detect the errors. Therefore, concurrent error detection is very beneficial to increase the reliability in such applications. Multiplication is one of the most important operations and is widely used in different applications. In this paper, we target concurrent error detection in the Montgomery multiplication over binary extension fields. We propose error detection schemes for two Montgomery multiplication architectures. First, we present a new concurrent error detection scheme using the time redundancy and apply it on semi-systolic array Montgomery multipliers. Then, we propose a parity based error detection scheme for the bit-serial Montgomery multiplier over binary extension Fields.