ppxscal/embedding_network huggingface dataset:
NetLens: iterative exploration of content-actor network data
Authors: Hyunmo Kang, Catherine Plaisant, Bongshin Lee, Benjamin B. Bederson
Venue: Information Visualization (2007)

Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper offers an abstract Content-Actor network data model, a classification of tasks, and a tool to support them. The NetLens interface was designed around the abstract Content-Actor network data model to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify. NetLens is general and scalable in that it applies to any data set that can be represented with our abstract data model. This paper describes the use of NetLens with a subset of the ACM Digital Library consisting of about 4000 papers from the CHI conference written by about 6000 authors, and reports on a usability study with nine participants.
A Two Base Stations Algorithm for Energy Balanced Data Propagation in Smart Home Sensor Networks
Authors: Bao Nguyen Nguyen, Deokjai Choi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Nowadays Smart Home seems to be getting popular. An essential element of Smart Home is its sensor network to convey environment information to the control station. There have been many communication protocols for this sensor network. A problem from previous protocols is unbalanced energy consumption among sensor nodes. Even though they tried to overcome unbalanced energy consumption, they could not solve this problem completely yet. In this paper, we found that the basic reason for this unbalanced energy consumption is that there is normally one base node. Because of this architectural problem, the nodes around this sink node lose their energy more easily in relevance to other nodes. So, we propose the sensor network model with 2 and only 2 base stations with simulations, and its corresponding communication protocol.
The Application of Hybrid Genetic Particle Swarm Optimization Algorithm in the Distribution Network Reconfigurations Multi-Objective Optimization
Authors: Caiqing Zhang, Jingjing Zhang, Xihua Gu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

According to the single performance of most distribution network reconfigurations (DNR), this paper presents the multi-objective distribution network optimization model with the optimal network loss, load balancing, and power supply voltage. Combined with the evolution idea of genetic algorithm (GA) and population intellectual technique of particle swarm optimization (PSO) algorithm, it applies hybrid genetic particle swarm optimization algorithm (HGPSOA) to search the optimization. By the random-weighted method, it obtains the object that is the searching direction of Pareto front. During searching process, some individuals are iterated by PSO, the others follow the selection, crossover and mutation of GA, and the whole population information is shared by each agent. Simultaneously, it adopts the adaptive parameters mechanism and better fitness individuals surviving rules to evolve the population. Based on the above, distribution network optimization program can furthest enhance the security and the efficiency of distribution system, on the premise of ensuring that the distribution network is spokewise and also could satisfy heat capacity of feeder line, voltage redu-cing , transformer capacity and etc. Samples show that the algorithm has advantages both in effective-ness and efficiency.
A Sensor Failure Management Method Based on Fuzzy Neural Network
Authors: Jian-Jun Ni, Xiao-ping Niu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The sensor management is a new technology, which is developing quickly with the information fusion technology, and become the key part of the information fusion system to improve its performance and function. The sensor fail- ure management is one of the important tasks of the sensor management system, and is present problem under hot dis- cussion. Aim at the different type of the sensor failure, a new method based on fuzzy neural network is presented and the effects of it are studied by computer simulation. The re- sults show that the method based on fuzzy neural network can satisfy the requirements of the sensor failure manage- ment, and reduce the fusion data fluctuate and the error of sensor management system very well.
Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
Authors: Alireza Rahimi-Vahed, Ali Hossein Mirzaei
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional approaches. Therefore, a new multi-objective shuffled frog-leaping algorithm (MOSFLA) is introduced for the first time to search locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with three distinguished multi-objective genetic algorithms, i.e. PS-NC GA, NSGA-II, and SPEA-II. The computational results show that the proposed MOSFLA performs better than the above genetic algorithms, especially for the large-sized problems.
Program Complexity and Programmer Productivity
Authors: E. T. Chen
Venue: IEEE Transactions on Software Engineering (1978)

This paper proposes a measure of program control complexity from an information theory viewpoint. A set of empirical data showing programmer productivity as a function of program control complexity is also presented. The data reveals a step-function-like contour to programmer productivity with increasing program control complexity.
Modular Replacement of Combinational Switching Networls
Authors: D. C. Schmidt
Venue: IEEE Transactions on Computers (1975)

This paper discusses a technique whereby a logic design which is unconstrained may be replaced quasi-optimally with modules from a constrained library. Necessary and sufficient conditions for the replacement of modules within a network are developed and then reformulated as integer linear programs. These integer linear programs are solved during individual steps of a dynamic programming formulation of the network replacement problem. Execution time of the algorithm increases linearly with the network size and the algorithm produces optimal replacements of fan-out-free networks.
Peripheral Considerations for PC-CAD Users
Authors: Doyle Cavin
Venue: IEEE Computer Graphics and Applications (1987)

This article discusses some of the factors that can affect the choice of graphics peripherals for the majority of PC-CAD users, along with some of the barriers and technology enablers that will affect such choices in the future. It includes an in-depth discussion of pen plotter devices and a look at the technologies that will compete with pen plotters in the near future, including thermal, ink jet, and electrostatic. Input devices are also covered, with emphasis on digitizers. 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
3D Visibility and Partial Visibility Complex
Authors: Mojtaba NouriBygi, Mohammad Ghodsi
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Visibility is an important topic in computer graphics, motion planning, and computational geometry. To deal with the increasing complexity of the scenes considered, some research has been performed in visibility processing in order to accelerate the visibility determination. Two of the most studied such structures are visibility graph and visibility complex. Visibility graph is a fundamental geometric structure which is used in many applications, including illumination and rendering, motion planning, pattern recognition, and sensor networks. While the concept of visibility graph is widely studied for 2D scenes, there is no acceptable equivalence of visibility graph for 3D space. Similarly, 3D visibility complex, proposed as an extension of visibility complex to 3D, is very complicated and cannot be used for visibility computations. In this paper, we propose a new model for defining the visibility relations in 3D. The main idea is to replace the role of lines and segments in 2D with planes and planar polygons in 3D. Moreover, we define two new structures, namely 3D visibility graph and partial visibility complex, which we believe is the natural way to extend the earlier models. We show how to compute these structures in acceptable times. We also use partial visibility complex to compute the view around a point in 3D in O((|V (q)|+n2) log n) time, where |V (q)| is the size of the view.
Project Outcome Predictions: Risk Barometer Based on Historical Data
Authors: Darja Smite
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

The influence of globalization on software development has been recognized as significant by many studies. Existence of unique factors that distinguish globally distributed software development environment increases the complexity of software development processes and brings challenges to project managers in achieving project success. This paper describes a study on globally distributed projects, which aims to determine the severity of global threats and provide an approach for sustainable support in managing project outcome predictions. Risk Barometer has been developed based on empirical data from industrial projects investigated during the study. It calculates the probability of negative outcome for global threats upon historical data. The results of this study provide practitioners that lack knowledge and experience a tool for more effective risk management, as well as cost and effort estimation for a globally distributed project.
Parallelism and Representation Problems in Distributed Systems
Authors: M. J. Flynn
Venue: IEEE Transactions on Computers (1980)

A hierarchical view of program representation is used to explain the problems of matching various representations to underlying distributed architectures. If a program is to effectively use a distributed computer system, it is necessary to represent and detect a high degree of parallelism. Methods of detecting such parallelism and their limitations are discussed. The actual machine level representation of a high-level language program also affects the ability to achieve a good match between the computer system resources and the program. The concept of an ideal machine for the program leads naturally to a representation employing a directly executed language. The initial program representation profoundly influences the possibility of obtaining a good representation at other levels of the hierarchy. A poor initial language representation leads to unnecessary architectural contraints or insufficient information to efficiently execute a program. The issue of suitable initial representation for distributed hardware is approached employing a functional language basis.
Actions as Space-Time Shapes
Authors: Lena Gorelick, Moshe Blank, Eli Shechtman, Michal Irani, Ronen Basri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Human action in video sequences can be seen as silhouettes of a moving torso and protruding limbs undergoing articulated motion. We regard human actions as three- imensional shapes induced by the silhouettes in the spacetime volume. We adopt a recent approach [14] for analyzing 2D shapes and generalize it to deal with volumetric space-time action shapes. Our method utilizes properties of the solution to the Poisson equation to extract spacetime features such as local space-time saliency, action dynamics, shape structure and orientation. We show that these features are useful for action recognition, detection and clustering. The method is fast, does not require video alignment and is applicable in (but not limited to) many scenarios where the background is known. Moreover, we demonstrate the robustness of our method to partial occlusions, non-rigid deformations, significant changes in scale and viewpoint, high irregularities in the performance of an action, and low quality video.
Blind Image Restoration Based on Constant Modulus with Averaging and ANFIS
Authors: Li-yun Su, Hong Ma, Zheng Li, Sheng-gen Ju
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, a new approach for blurred noisy image restoration is presented. The blurred noisy image is assumed to be the output of a linear space-invariant system with an unknown point spread function contaminated by an additive noise. The scheme passes the blurred noisy image through a two-dimensional finite impulse response filter whose parameters are updated by the modified constant modulus algorithm with averaging and adaptive neruofuzzy inference system. When convergence occurs, the output of the filter is an estimate of the unobserved true image. Experimental results show that the proposed scheme is effective.
Interactive smart character in a shooting game
Authors: Chun-Chieh Chen, Tsai-Yen Li
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Interactivity is a critical issue in designing a good game or similar virtual environments. As the computer hardware is continuously improved, more computing power can be invested in interactivity in addition to graphics rendering. For games with virtual characters, how a character interact with a user is usually specified at design time according to a given scene. Consequently, the characters in a game usually can only display canned motions at designated locations of a scene. After several runs of practice, the user may easily get bored because these actions become predictable. Therefore, it is highly desirable to have a smarter character that can plan its motions according to the inputs from the user as well as other constraints from the environments.
Concurrency in Operating Systems
Authors: J. W. Atwood
Venue: Computer (1976)

As general-purpose computing systems become larger and more complex, it has become uneconomical to restrict their use to a single user or program. This has introduced the necessity of finding ways to safely share them.
Clustering based pruning for statistical criticality computation under process variations
Authors: Hushrav D Mogal, Haifeng Qian, Sachin S Sapatnekar, Kia Bazargan
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

We present a new linear time technique to compute criticality information in a timing graph by dividing it into "zones". Errors in using tightness probabilities for criticality computation are dealt with using a new clustering based pruning algorithm which greatly reduces the size of circuit-level cutsets. Our clustering algorithm gives a 150X speedup compared to a pairwise pruning strategy in addition to ordering edges in a cutset to reduce errors due to Clark's MAX formulation. The clustering based pruning strategy coupled with a localized sampling technique reduces errors to within 5% of Monte Carlo simulations with large speedups in runtime.
Decrypting a Class of Stream Ciphers Using Ciphertext Only
Authors: T. Siegenthaler
Venue: IEEE Transactions on Computers (1985)

Pseudonoise sequences generated by linear feedback shift registers [1] with some nonlinear combining function have been proposed [2]-[5] for cryptographic applications as running key generators in stream ciphers. In this correspondence it will be shown that the number of trials to break these ciphers can be significantly reduced by using correlation methods. By comparison of computer simulations and theoretical results based on a statistical model, the validity of this analysis is demonstrated. Rubin [6] has shown that it is computationally feasible to solve a cipher proposed by Pless [2] in a known plaintext attack, using as few as 15 characters. Here, the number of ciphertext symbols is determined to perform a ciphertext-only attack on the Pless cipher using the correlation attack. Our conclusion from the analysis is that the pseudonoise generator's output sequence and the sequences generated by the linear feedback shift registers should be uncorrelated. This leads to constraints for the nonlinear combining function to be used.
Bibliographic Attributes Extraction with Layer-upon-Layer Tagging
Authors: W. Wei, I. King, J. H-M. Lee
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Bibliographic attributes extraction is an important re- search topic for digital libraries. In this paper we pro- pose a rule-based method for bibliographic attributes ex- traction with Layer-upon-Layer Tagging (LLT). The method analyzes bibliographic attributes' appearances and punc- tuations to perform format and semantic taggings on two defined parsing layers. The method also resolves to specif- ically constructed lexicons to achieve high accuracy of se- mantic tagging. In the experimental evaluation on 1,000 reference strings, the accuracy of author tagging reaches to 96.8% and the accuracy of whole reference tagging is 82.9%. The experimental results demonstrate that the pro- posed LLT method can tag bibliographic attributes in refer- ence strings with high degree of accuracy.
Ballistic Missile Defense: A Supercomputer Challenge
Authors: C. G. Davis
Venue: Computer (1980)

Incredibly complex ballistic missile defense computational problems have been a rich source of technological advance. The BMD challenge will stimulate supercomputer development through the 1980's.
Architecture and testbed implementation of vertical handovers based on SIP session border controllers
Authors: Stefano Salsano, Luca Veltri, Andrea Polidoro, Alessandro Ordine
Venue: Wireless Personal Communications: An International Journal (2007)

This paper describes a Session Initiation Protocol (SIP) based solution for mobility management that provides seamless mobile multimedia services in a heterogeneous scenario where different radio access technologies are used (802.11/ WiFi, Bluetooth, 2.5G/3G networks). The solution relies on the so called "Session Border Controllers" which are now widely used in many commercial SIP telephony solutions, mainly to deal with NAT traversal. Session Border Controller functionality has been extended to support seamless mobility for multimedia applications. A prototype of the proposed solution focused on VoIP services has been implemented in a test bed which is able to perform seamless handovers (and NAT traversal) using the 802.11, Bluetooth and 3G (UMTS) access networks. Measurements results are reported which analyze the performance of the solution in a real world environment, using commercial WiFi and 3G services.
An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers
Authors: C. Montangero
Venue: IEEE Transactions on Computers (1974)

This paper illustrates an algorithm for finding a read-only memory (ROM) specification, optimal in the sense that it results in a minimum ROM bit dimension, starting with an instruction set description which employs acyclic directed graphs. The algorithm selects (by a tabular technique) a descriptive graph subset, shown to be sufficient; then it performs a heuristically guided search among possible solutions generated by the graphs in the subset. The algorithm works for instructions which are such that a microevent occurs at most once in a single instruction; some results apply to the general case as well.
Hybrid traveling in fully-immersive large-scale geographic environments
Authors: Frank Steinicke, Gerd Bruder, Klaus Hinrichs
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

In this paper we present hybrid traveling concepts that enable users to navigate immersively through 3D geospatial environments displayed by arbitrary applications such as Google Earth or Microsoft Virtual Earth. We propose a framework which allows to integrate virtual reality (VR) based interaction devices and concepts into such applications that do not support VR technologies natively. In our proposed setup the content displayed by a geospatial application is visualized stereoscopically on a head-mounted display (HMD) for immersive exploration. The user's body is tracked in order to support natural traveling through the VE via a walking metaphor. Since the VE usually exceeds the dimension of the area in which the user can be tracked, we propose different strategies to map the user's movement into the virtual world intuitively. Moreover, commonly available devices and interaction techniques are presented for both-handed interaction to enrich the navigation process.
Parallelization and Performance Analysis of Video Feature Extractions on Multi-Core Based Systems
Authors: Qi Zhang, Yurong Chen, Jianguo Li, Yimin Zhang, Yinlong Xu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Content-Based Video Information Retrieval (CBVIR) has becoming one of the best solutions for retrieving useful information from today's video information explosion. And with the rapid development of modern technologies, CBVIR is emerging as a mass market desktop application. There is evidence that visual feature extraction is the most time-consuming part in a CBVIR system. In this paper, we implement three video visual feature extractions in parallel by exploring different kinds of thread-level parallelism. We also conduct detailed scalability and memory performance analysis on two multi-core based systems, in order to gain more insights into video-analysis related applications on future multi-core systems. From our analysis we identify the likely causes of bottlenecks in these kinds of applications and suggest ways to improve scalability.
Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems
Authors: Hsin-Wen Wei, Yi-Hsiung Chao, Shun-Shii Lin, Kwei-Jay Lin, Wei-Kuan Shih
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Many optimal uniprocessor schedulers, such as Earliest Deadline First (EDF) and Rate Monotonic (RM), do not have a good schedulability bound on multiprocessor systems. In this paper, we study an on-line algorithm Earliest Deadline First until Zero laxity (EDZL) for multiprocessor systems. A set of tasks scheduled by EDZL is scheduled using EDF until a job experiences a zero laxity. To avoid the job from missing its deadline, the priority of the job is immediately promoted to the highest priority. We derive the schedulability bound of 3/2+|umax-1/2| for two-processor systems, where umax is the maximum utilization of an individual task in the given task set. We also discuss the best known upper bound and lower bound on EDZL schedulability conditions.
1978 Asilomar Workshop on Microprocessors
Authors: B. L. Peuto
Venue: Computer (1979)

After eight years, microprocessors are finally growing up. Those generally available since their introduction in 1971 have been technological marvels, but, by and large, architectural oddities. A combination of complexity limitations and designer inexperience resulted in chips which could execute instructions, but which were difficult to interface and frustrating to program when used as general-purpose computers.