ppxscal/embedding_network huggingface dataset:
Pseudo Parallel Ant Colony Optimization for Continuous Functions
Authors: Ying Lin, HuaChun Cai, Jing Xiao, Jun Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a pseudo parallel ant colony optimization (ACO) algorithm in continuous domain. The variables of a solution are optimized by two parallel cooperative ACO-based processes, either of which attacks a relatively-independent sub-component of the original problem. Both processes contain tunable and untunable solution vectors. The best tunable vector migrates into the other process as an untunable vector through a migration controller, in which the migration strategy is synchronously sprung or adaptively controlled according to the temporal stagnation situation. Implementation of this mechanism is suitable for hardware which supports parallel computation, resulting in decline of unit computational cost and improvement of training speed. Optimization to a set of benchmark functions is carried out to prove the feasibility and efficiency of this parallel ACO algorithm.
A Vague Relational Model and Algebra
Authors: Faxin Zhao, Z. M. Ma, Li Yan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Imprecision and uncertainty in data values are pervasive in real-world environments and have received much attention in the literature. Several methods have been proposed for incorporating uncertain data into relational databases. However, the current approaches have many shortcomings and have not established an acceptable extension of the relational model. In this paper, we propose a consistent extension of the relational model to represent and deal with fuzzy information by means of vague sets. We present a revised relational structure and extend the relational algebra. The extended algebra is shown to be closed and reducible to the fuzzy relational algebra and further to the conventional relational algebra.
nSpace and GeoTime: A VAST 2006 Case Study
Authors: Pascale Proulx, Lynn Chien, Robert Harper, David Schroh, Thomas Kapler, David Jonker, William Wright
Venue: IEEE Computer Graphics and Applications (2007)

GeoTime and nSpace are innovative visual analytic tools that enable investigation and understanding of complex, ambiguous situations. nSpace is a system of systems supporting the whole analytic workflow. GeoTime provides insight into events and behaviors in time and space. Junior analysts used the analytic capabilities these tools supported to investigate the 2006 VAST contest data set and produce an intelligence assessment report. This article describes how these tools created an analytical environment that enabled two novice analysts to examine the scenario, discover patterns, trace connections, assess evidence, visually represent meaningful hypotheses with associated evidence, track progress, collaborate with others, and produce a final report.
New results for molecular formation under pairwise potential minimization
Authors: Werner Schachinger, Bernardetta Addis, Immanuel M. Bomze, Fabio Schoen
Venue: Computational Optimization and Applications (2007)

We establish new lower bounds on the distance between two points of a minimum energy configuration of N points in ¿3 interacting according to a pairwise potential function. For the Lennard-Jones case, this bound is 0.67985 (and 0.7633 in the planar case). A similar argument yields an estimate for the minimal distance in Morse clusters, which improves previously known lower bounds. Moreover, we prove that the optimal configuration cannot be two-dimensional, and establish an upper bound for the distance to the nearest neighbour of every particle, which depends on the position of this particle. On the boundary of the optimal configuration polytope, this is unity while in the interior, this bound depends on the potential function. In the Lennard-Jones case, we get the value $\sqrt[6]{\frac {11}{5}}\approx1.1404$ . Also, denoting by V N the global minimum in an N point minimum energy configuration, we prove in Lennard-Jones clusters $\frac{V_{N}}{N}\ge-41.66$ for all N¿2, while asymptotically $\lim_{N\to\infty}\frac{V_{N}}{N}\le-8.611$ holds (as opposed to $\frac{V_{N}}{N}\ge-8.22$ in the planar case, confirming non-planarity for large N).
Special Feature: Computer Design to Minimize Memory Requirements
Authors: E. C. R. Hehner
Venue: Computer (1976)

Matching the instructions and their representations to the distributions of usage can save 75% of the space taken by contemporary machine representations. The gain in space may be accompanied by a reduction in execution time due to more efficient use of data paths. Variable-length codes can also eliminate all forms of overflow from machine-language, and greatly reduce the probability of overflow in data.
The structuring of legal knowledge in LOIS
Authors: Wim Peters, Maria-Teresa Sagri, Daniela Tiscornia
Venue: Artificial Intelligence and Law (2007)

Legal information retrieval is in need of the provision of legal knowledge for the improvement of search strategies. For this purpose, the LOIS project is concerned with the construction of a multilingual WordNet for cross-lingual information retrieval in the legal domain. In this article, we set out how a hybrid approach, featuring lexically and legally grounded conceptual representations, can fit the cross-lingual information retrieval needs of both legal professionals and laymen.
Sentence boundary detection in conversational speech transcripts using noisily labeled examples
Authors: Hironori Takeuchi, L. Venkata Subramaniam, Shourya Roy, Diwakar Punjani, Tetsuya Nasukawa
Venue: International Journal on Document Analysis and Recognition (2007)

This paper presents a technique for adding sentence boundaries to text obtained by Automatic Speech Recognition (ASR) of conversational speech audio. We show that starting with imprecise boundary information, added using only silence information from an ASR system, we can improve boundary detection using Head and Tail phrases. We develop our technique and show its effectiveness on two manually transcribed and one automatically transcribed corpus. The main purpose of adding sentence boundaries to ASR transcripts is to improve linguistic analysis, namely information extraction, for text mining systems that handle huge volumes of textual data and analyze trends and features of the concepts. Hence, we also show how the addition of boundaries improves two basic natural language processing tasks&#x2014;PoS label assignment and adjective-noun extraction.
Flip-flop Selection to Maximize TDF Coverage with Partial Enhanced Scan
Authors: Gefu Xu, Adit D. Singh
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Enhanced scan designs support high coverage TDF testing but with significant overhead. We present a flip-flop selection strategy for partial enhanced scan designs that offers a favorable trade-off between coverage and overhead. Experimental results using commercial ATPG tools show that 60-90% of the TDF coverage benefits of enhanced scan can be achieved at 10-30% of the cost.
Dynamic environment evaluation for reliable AmI applications based on untrusted sensor
Authors: Pedro Malagon, Juan Carlos Vallejo, Jose M. Moya, Alvaro Araujo, Octavio Nieto-Taladriz
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

This paper evaluates the cost of encrypted communications for wireless sensor networks with tight resource constraints. We demonstrate that software encryption (3DES, AES, and Blowfish are evaluated) is not generally affordable, and therefore the whole system architecture should take into account that sensor data is not to be trusted. We propose a dynamic environment evaluation strategy for decision making in AmI applications, based on dynamic trusting levels of the sensor objects and documented decision chains.
On Holy Wars and a Plea for Peace
Authors: D. Cohen
Venue: Computer (1981)

Which bit should travel first? The bit from the big end or the bit from the little end? Can a war between Big Endians and Little Endians be avoided? 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
Algorithms for the Automatic Design of WiMAX networks
Authors: R. K. Taplin, D. M. Ryan, S. M. Allen, S. Hurley, N. J. Thomas
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

This paper demonstrates the design of broadband wireless access (WiMAX) networks using an automated planning tool that considers both technical and economic parameters. The accurate representation of these parameters is essential since both affect the nature of the network design. Central to automatic planning is the optimization algorithm which searches for the optimum network solution for a given network scenario. Here, the effectiveness of a tabu search algorithm is demonstrated by comparison to a number of alternative optimization algorithms. Three real world network deployment scenarios are examined. In all cases the tabu search meta-heuristic algorithm finds the better network solution.
The Aristotelian rainbow: from philosophy to computer graphics
Authors: Jeppe Revall Frisvad, Niels Jørgen Christensen, Peter Falster
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Developments in the graphics discipline called realistic image synthesis are in many ways related to the historical development of theories of light. And theories of light will probably continue to inspire the ongoing search for realism in graphics. To nurture this inspiration, we present the first in-depth, source-based historical study that pinpoints events with relevance for graphics in the development of theories of light. We also show that ancient mathematical models for light scattering phenomena may still find a use in the branch of realistic image synthesis concerned with real-time rendering. As an example we use Aristotle's theory of rainbow formation to construct a method for real-time rendering of rainbows. This example serves as an invitation to use the overview and references provided in this paper, not only for understanding where many of the physical concepts used in graphics come from, but also for finding more mathematical and physical models that are useful in graphics.
Image-Based Model Reconstruction Using Textured Planes
Authors: Bin Sheng, Enhua Wu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we propose a representation of image-based models by textured planes augmented to surface geometry reconstructed from a sequence of depth images. Each textured plane is a textured and partially transparent plane into which the texture from the input images is mapped using projective texturing. That is, a set of textured planes, or billboards, that look like the input when seen from the input viewpoints. The process comprises two fundamental steps, repeated until the input data has been exhausted. These steps in our method, are spatial sampling of the input scene and search for fitting planes. In the first step, the geometry of the objects in the input scene is sampled using measures of optic flow. Then, we find a set of planes that fit the approximate sampled geometry obtained in the first step. Under this hybrid reconstruction, texture mapping can be employed to deterministically identify coincident rays from different view points and thus achieve high quality rendering, with taking full advantages of the acceleration utility of graphics.
An Analysis of Instruction-Fetching Strategies in Pipelined Computers
Authors: R. W. Holgate
Venue: IEEE Transactions on Computers (1980)

The performance of pipelined processors is heavily influenced by the effects of control-transfer, or branching, instructions, and various strategies have been used to reduce the delays incurred by these instructions. The position of the "control point" in the pipeline is an important factor that must also be taken into account, however, and this paper presents an analysis of its effects. Results are given of measurements made with a hardware performance monitor during the running of benchmark programs on the highly pipelined MU5 processor. These results support the argument for placing the control point as late in the pipeline as possible, and for using a prediction mechanism to supply correct sequences of instructions to the pipeline.
Forecast the Dangerous Level of Gas Outburst Based on GASA Neural Networks in Coal Mine
Authors: Yanjing Sun, Jiansheng Qian
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

To decrease casualties and actualize unmanned roadway, the neural nets based on hybrid learning scheme of genetic algorithm and simulated annealing (GASA) with output and hidden weight optimization is put forward to forecast the coal and gas outburst in roadway face. Although the neural net based on OHWO does better than others in the convergence, it has the instinctive shortcomings of local minima and oscillation problem. GASA combines the ability of evolution of GA and probability searching of SA. The proposed neural nets based on GASA with global search ability can simultaneously optimize weight and threshold of artificial neural network. The improved NN can accurately capture the complicated relationships among feature values of coal-gas outbursts and dangerous circumstances. Results show that it is a highly feasible and creative technique to forecast coal-gas outburst in roadway face.
A New Hybrid Genetic Algorithm for the Stochastic Loader Problem
Authors: Wang Hong, Pei-xin Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In 2004, Tang proposed a new NP-hard combinational optimization problem that frequently arises in practice--The Loader Problem. Two special cases of the problem (the restricted loader problem and the equal loader problem) and optimal solution strategy have been considered. In this paper, we extend Tang's model by proposing the stochastic quantity of load and unload at each station that make the model more applicable in practice. For finding the optimal solutions, we present a new hybrid genetic algorithm that combines self-adapting crossover and stochastic mutation operators. Comparing with the basic genetic algorithm, this improved algorithm adequately utilizes the adaptability information of current individuals and has better convergence efficiency and higher solution precision. Two numerical examples illustrate the validity and efficiency of the new hybrid genetic algorithm.
A General Approach for Partitioning Web Page Content Based on Geometric and Style Information
Authors: H. Guo, J. Mahmud, Y. Borodin, A. Stent, I. Ramakrishnan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we describe a general-purpose approach for partitioning Web page content. The novelty of our ap- proach lies in the use of detailed layout information from a Web page renderer to determine spatial locality and identify visual separators, and the use of relaxed matching over pre- sentation style information to determine presentation style similarity. We present several examples to illustrate the gen- erality of our approach.
Test Procedure Optimization for Layered Protocol Implementations
Authors: T. Kawaoka
Venue: IEEE Transactions on Computers (1985)

This correspondence describes an algorithm for generating a set of test items and a test sequence which can be used at a minimal cost for testing protocol implementations for a layered protocol. "Set" and "weight" concepts are introduced and "test cost" is defined as the weighted sum of directed arcs.
An evolutionary algorithm for interval solid transportation problems
Authors: Fernando Jiménez, José L. Verdegay
Venue: Evolutionary Computation (1999)

The Solid Transportation Problem arises when bounds are given on three item properties. Usually, these properties are source, destination and mode of transport (conveyance), and may be given in an interval way. This paper deals with solid transportation problems in which the data in the constraint set are expressed in an interval form, i.e. when sources, destinations and conveyances have interval values instead of point values. An arbitrary linear or nonlinear objective function is also considered. To solve the problem, an Evolutionary Algorithm which extends and generalizes other approaches considering only point values, is proposed.
Semi-supervised learning of the hidden vector state model for extracting protein-protein interactions
Authors: Deyu Zhou, Yulan He, Chee Keong Kwoh
Venue: Artificial Intelligence in Medicine (2007)

Objective: The hidden vector state (HVS) model is an extension of the basic discrete Markov model in which context is encoded as a stack-oriented state vector. It has been applied successfully for protein-protein interactions extraction. However, the HVS model, being a statistically based approach, requires large-scale annotated corpora in order to reliably estimate model parameters. This is normally difficult to obtain in practical applications. Methods and materials: In this paper, we present two novel semi-supervised learning approaches, one based on classification and the other based on expectation-maximization, to train the HVS model from both annotated and un-annotated corpora. Results and conclusion: Experimental results show the improved performance over the baseline system using the HVS model trained solely from the annotated corpus, which gives the support to the feasibility and efficiency of our approaches.
Rewritable Programmable Logic Array of Current Mode Logic
Authors: M. Tanaka
Venue: IEEE Transactions on Computers (1981)

This paper describes new ways to construct a rewritable programmable logic array (R-PLA) of current mode logic (CML) and to control READ/WRITE operations of the R-PLA. The R-PLA is constructed by splitting a conventional Random Access Memory (RAM) of CML into two parts. Therefore, each cell structure of the new R-PLA is identified with that of the conventional RAM, differing from a complicated cell structure proposed in the past. Because of the identification the comparison for the number of cells between the new R-PLA and the RAM becomes possible according to the historical discussions of the PLA and the memory. It will be demonstrated logically and electrically that SEARCH and READ parts of the new R-PLA can perform logic-in-memory without using special AND gates in each cell in the READ mode and can enter a WRITE data from a word direction in the WRITE mode.
An Energy Efficient Design of Multi-resolution Storage for Ubiquitous Data Management
Authors: Siliang Tang, Jianhua Yang, Zhaohui Wu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Ubiquitous computing enables dense sensing of the environment, offering unprecedented opportunities for observing the physical world. In many scientific applications in dense sensor arrays, efficient support for multi-resolution storage and drill-down queries is essential. We argue that technology trends in embedded platforms and flash memories call for rethinking multi-resolution storage designing. We articulate a vision of a storage-centric sensor network where sensor nodes will be equipped with high-capacity and energy-efficient local flash storage. The data are pulled or pushed from remote sensors by proxies, which are assumed to be less resource and energy constrained than remote sensors. We then describe how COSA enables this vision through some innovative features including energyefficient use of flash memory, multi-resolution summarization and aging, query processing, and caching.
The 3-Tiered Methodology: Pragmatic Insights from New Generation Software Product Lines
Authors: Charles W. Krueger
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Early generation software product line (SPL) methodologies tended to be large, complex, and offer many options and choices, making adoption in practice difficult to comprehend, justify and achieve. We have identified a simpler pattern for SPL methodology, referred to as the 3-Tiered Methodology, based on observations during deployments and operation of new generation SPL practices. This methodology is useful not only for the operation of full-scale SPL practice, but also in understanding, explaining and justifying SPLs, as well as for planning and making transitions to SPL practice.
Virtual worlds as a medium for advertising
Authors: Stuart Barnes
Venue: ACM SIGMIS Database (2007)

Online virtual worlds, such as Second Life, are rapidly becoming recognized as a technology of substantial future importance for marketers and advertisers. Many of these virtual worlds provide the potential medium for very rich and varied new and enhanced modes of advertising--all in one online channel. Such varied advertising experiences can be immersive or absorptive, active or passive. Potential modes of advertising include product placement of 3-D objects (such as brand-name clothing), billboards, radio, musical performances, movies and videos, advergames (typically mini-worlds or mini-games) and cross-promotional offers and activities. Little is known about the effectiveness of advertising in virtual worlds on purchasing intention towards a product. The purpose of this paper is to introduce the concept of advertising in virtual worlds and to create an agenda for future experimental research in this exceptionally new domain. As a result, we hope to encourage others to begin to further engage in research on this topic over the period from 2007-2014.
The Effects of Over and Under Sampling on Fault-prone Module Detection
Authors: Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, Takeshi Kakimoto, Ken-ichi Matsumoto
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which are preprocessing procedures for a fit dataset. The sampling methods are expected to improve prediction performance when the fit dataset is imbalanced, i.e. there exists a large difference between the number of fault-prone modules and not-fault-prone modules. So far, there has been no research reporting the effects of applying sampling methods to fault-proneness models. In this paper, we experimentally evaluated the effects of four sampling methods (random over sampling, synthetic minority over sampling, random under sampling and one-sided selection) applied to four fault-proneness models (linear discriminant analysis, logistic regression analysis, neural network and classification tree) by using two module sets of industry legacy software. All four sampling methods improved the prediction performance of the linear and logistic models, while neural network and classification tree models did not benefit from the sampling methods. The improvements of F1-values in linear and logistic models were 0.078 at minimum, 0.224 at maximum and 0.121 at the mean.
Evaluating fault-tolerant system designs using FAUmachine
Authors: S. Potyra, V. Sieh, M. Dal Cin
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

This paper presents an elaborate framework for early evaluation of fault-tolerant behaviour of complex hardware/software systems in the presence of hardware faults. The evaluation is based on sophisticated fault injection experiments. An illustrative example for such experiments is discussed in some details.