ppxscal/embedding_network huggingface dataset:
A Data Flow Approach to Procedural Modeling
Authors: Harold Hedelman
Venue: IEEE Computer Graphics and Applications (1984)

Procedural models can simulate an object's behavior as well as its appearance. When combined with data flow methods, they provide a useful approach to image composition and animation. 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
Semantic Web Infrastructure
Authors: Jiri Dokulil, Jaroslav Tykal, Jakub Yaghob, Filip Zavoral
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The Semantic Web is not widespread as it has been expected by its founders. This is partially caused by lack of standard and working infrastructure for the Semantic Web. We have built a working, portable, stable, highperformance infrastructure for the Semantic Web. This paper is focused on tasks performed by the infrastructure.
Overlay network symbiosis: evolution and cooperation
Authors: Naoki Wakamiya, Masayuki Murata
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Simultaneous overlay networks compete for physical network resources and disrupt each other. If they could establish cooperative relationships, the collective performance can be improved and they can coexist peacefully and comfortably. Taking inspiration from biology, in this paper we present a model of symbiotic overlay networks. Coexisting overlay networks dynamically evolve, interact with each other, and change their internal structures. Overlay networks in a symbiotic condition, i.e., mutualism, eventually establish the strong relationship and finally fuse into one. We first analyze characteristics of an overlay network which evolves based on three different models, i.e., the preferential attachment, random, and combination of them, by using mathematical analysis and simulation experiments. Next, we evaluate the effect of interconnecting two overlay networks from the viewpoint of the cost and the benefit.
Weighted Realizations of Switching Functions
Authors: F. M. Brown
Venue: IEEE Transactions on Computers (1975)

Any switching function has weighted representations, i.e., symmetric representations for which some of the arguments are repeated. We call a logic network based on such a representation a weighted realization. It is shown that a weighted realization may be implemented using a full-adder network (called a moment generator) whose outputs are fed to a multiplexer. A procedure is given to synthesize the full-adder network using the fewest possible modules and with strong coalescing of modules into multibit adders.
An Extensible Metamodel for Program Analysis (abstract only)
Authors: Dennis Strein, Rüdiger Lincke, Jonas Lundberg, Welf Löwe
Venue: IEEE Transactions on Software Engineering (2007)

Software maintenance tools for program analysis and refactoring rely on a metamodel capturing the relevant properties of programs. However, what is considered relevant may change when the tools are extended with new analyses, refactorings, and new programming languages. This paper proposes a language independent metamodel and an architecture to construct instances thereof, which is extensible for new analyses, refactorings, and new front-ends of programming languages. Due to the loose coupling between analysis, refactoring, and front-end components, new components can be added independently and reuse existing ones. Two maintenance tools implementing the metamodel and the architecture, VizzAnalyzer and X-develop, serve as proof of concept.
Canonical scattered context generators of sentences with their parses
Authors: Alexander Meduna, Jirí Techet
Venue: Theoretical Computer Science (2007)

Scattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L's sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals.
Development of a confocal optical system design for molecular imaging applications of biochip
Authors: Guoliang Huang, Shukuan Xu, Jiang Zhu, Cheng Deng, Zhonghua Dong, Yang Yang, Xiaoyong Yang, Xianhua Wang, Guofan Jin
Venue: Journal of Biomedical Imaging (2007)

A novel confocal optical system design and a dual laser confocal scanner have been developed to meet the requirements of highly sensitive detection of biomolecules on microarray chips, which is characterized by a long working distance (wd > 3.0 mm), high numerical aperture (NA = 0.72), and only 3 materials and 7 lenses used. This confocal optical system has a high scanning resolution, an excellent contrast and signal-to-noise ratio, and an efficiency of collected fluorescence of more than 2-fold better than that of other commercial confocal biochip scanners. The scanner is as equally good for the molecular imaging detection of enclosed biochips as for the detection of biological samples on a slide surface covered with a cover-slip glass. Some applications of gene and protein imagings using the dual laser confocal scanner are described.
An Approach for Multifont Arabic Characters Features Extraction Based on Contourlet Transform
Authors: N. Ben Amor, N. Ben Amara
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we propose a method for features extraction from multifont Arabic characters images based on the Contourlet Transform, which has been recently introduced. In our previous works, we noticed that Wavelet transforms are not capable of reconstructing curved images perfectly; the Contourlet Transform offers a solution to remedy to this insufficiency. It allows a multiresolution and directional decomposition of a signal using a combination of Laplacian Pyramid (LP) and a Directional Filter Bank (DFB). The Contourlet Transform has good approximation properties for smooth 2D functions and finds a direct discrete-space construction, and is therefore computationally efficient. Experimental tests have been carried out on a set of 175.000 samples of characters corresponding to 9 different Arabic fonts. Some promising experimental results are reported.
Experiences with Introducing a new Software Process Model at T-Systems
Authors: Frank Marschall
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Software process models are essential for software companies, because they embody their core competences in applying software development processes. In this paper experiences made at the development and enactment of a process model for T-Systems, one of Germany's largest software companies, are depicted. Starting from the basic objectives the Software Engineering Book (SE Book) is introduced and the measures to achieve the given objectives are presented. The process model was prototypically implemented by 29 pilot projects. The results of this pilot phase are summarized subsequently and an overview over activities that accompany the roll out of the SE Book is given.
Suboptimal control of logical-dynamic systems under parametric uncertainty conditions
Authors: A. S. Bortakovskii
Venue: Automation and Remote Control (2007)

Sufficient optimality conditions of logical-dynamic systems are obtained, the logical portion of which models the operation of a memory-equipped automaton. Equations are derived for the definition of the optimal programmed control and full feedback control. Optimal processes with multiple switchings of the logical (automaton) portion at fixed instants of time are investigated. On the basis of sufficient conditions, algorithms are suggested for the development of the suboptimal control of logical-dynamic systems under parametric uncertainty conditions. The use of optimality and suboptimality conditions is illustrated by examples.
MixPR_An Approach of Combining Content and Links of Web Page
Authors: Ye Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Pagerank was used in systems based on hyperlink struc- ture such as Google. TFIDF was widely used in IR systems based on the vector space model (VSM). It was significative to combine the advantages of two systems. In this paper, we set up a new model by using the content of web pages and the links among pages. We set up the transition probability matrix, which composed of link information and the rele- vant value of pages with the given query. The relevant value was denoted by TFIDF. We got the MixPR (Mixed Pager- ank) by solving the equation with the coefficient of matrix. In this model, part of the pages, which would be used to compute the TFIDF, had been downloaded from the Inter- net firstly, and the link information which started from those pages was stored in local server, too. The importance of the page was determined by content and the links. Experimen- tal results showed that the new model worked well, and the precision approached to the result of the TFIDF did.
On the Construction of Small Fully Testable Circuits with Low Depth
Authors: Gorschwin Fey, Anna Bernasconi, Valentina Ciriani, Rolf Drechsler
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

During synthesis of circuits for Boolean functions area, delay and testability are optimization goals that often contradict each other. Multi-level circuits are often quite small while circuits with low depth are often larger regarding the area requirements. A different optimization goal is good testability which can usually only be achieved by additional hardware overhead. In this paper we propose a synthesis technique that allows to trade-off between area and delay. Moreover, the resulting circuits are 100% testable under the stuck-at fault model. The proposed approach relies on the combination of 100% testable circuits derived from binary decision diagrams and 2-SPP networks. Full testability under the stuck-at fault model is proven and experimental results show the trade-off between area and depth.
Intelligence Model for the Sensitivity Analysis of Financial Time Series
Authors: Hua Zheng, Li Xie, Lizi Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Sensitivity analysis on electricity price is one of focused and unsolved problems in the researches of electricity market. A challenge is that there is no definite mathematical equation of price due to the special complexity of electricity market. So a novel model based on fuzzy neural network (FNN) is presented for the sensitivity analysis of financial time series, for example, electricity price. Here the work mainly consists two parts. One is to build an intelligence model to study the mapping relationship of price and its influence factors by FNN. The other is to build a sensitivity model by simulation using the trained FNN, where the responding price is estimated by simulating the changes in the influence factors. In this way, price sensitivity analysis is accomplished. Case studies are used to test the proposed model.
The Management and Validation of Business Rules in Telecom Operator's Settlement and Apportion System
Authors: Biying Lin, Yanhui Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

From the perspective of practical application, this article elaborates on the business rules management module developed in the telecom operator's settlement and apportion system, analyses potential problems that may arise in the business rules management module, provides a design approach and solution to the business rules management, and validates the effectiveness and correctness of the business rules at all levels. At present, the system has been put in production and proved to be effective.
Challenges and Best Practices in Policy-Based Autonomic Architectures
Authors: Radu Calinescu
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Based on insights from the development of a commercial framework for the autonomic management of data center resources, we identify some of the main challenges faced by autonomic architectures. We describe a number of best practices for overcoming or, in some cases, working around these challenges, and we propose a general-purpose autonomic architecture that complies with our best practices and builds on recent advances in autonomic solution development. The core component of the architecture is a universal policy engine configured by means of a model of the resources placed under its control, and using a set of flexible policies for their management. This model-driven approach enables the development of effective autonomic systems comprising a heterogeneous mix of legacy resources and autonomic-enabled components.
Nash Equilibrium Stability of Rent-seeking Competition And Its Game Analysis
Authors: Bin Wang, Silian Sui, Hongliang Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we study two game models of rent-seeking competition under two behavior rules by use of difference equation, one is a competition game model between two myopic rent-seekers with bounded rationality, the other is an evolution game model between the myopic rent-seeker, who can make choice of its behavior rule, and Nash rent-seeker with complete rationality, and then give the Nash equilibrium conclusion and its stability. The conclusion shows that under certain condition the myopic rent-seeker will trend to Nash equilibrium after repeated games. The game model selecting behavior rule shows that the simple myopic rule can't be washed out by complicated Nash rule, and instead the rent-seekers will select myopic rule, under certain condition whose rent-seeking input x_t* will trend to Nash equilibrium input gradually.
A PC-based freehand three-dimensional ultrasound
Authors: Shalihatun Azlin Aziz, Nor Ashidi Mat Isa, Umi Kalthum Ngah, Haidi Ibrahim, Mohd Ezane Aziz
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Breast cancer is the number one killer disease among women in Malaysia. In the diagnosis of breast cancer, breast ultrasound examination is commonly used as a supplement to mammography. Ultrasound examination is a non ionizing technique, free of harmful effects. Unfortunately, ultrasound is also known as a time-consuming examination technique with high operator dependency with the results from the examination difficult to discuss, document and reproduce. Three-dimensional imaging provides new information and allows a better interpretation of the standard two-dimensional images. The aim of this study is to therefore develop a PC-based three dimensional ultrasound system to help in the examination and evaluation of breast lesions. The system consists of a PC-based ultrasound system and a magnetic tracking sensor. A sequence of breast ultrasound images were acquired along with the coordinates. These data were then filtered, segmented and finally reconstructed into a 3D image.
A Portable Operating System Interface and Utility Library
Authors: E. Biagioni
Venue: IEEE Software (1986)

OSSI provides the interface missing between Modula-2 and system-dependent I/O operations. It can be ported between systems with minimal changes.
System Co-Design and Co-Analysis Approach to Implementing the XDRTM Memory System of the Cell Broadband EngineTM Processor: Realizing 3.2 Gbps Data Rate per Memory Lane in Low Cost, High Volume Production
Authors: Wai-Yeung Yip, Scott Best, Wendemagegnehu Beyene, Ralf Schmitt
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper describes the design and analysis of the 3.2 Gbps XDR¿ memory system of the Cell Broadband Engine¿ (Cell BE) processor developed by Sony Corporation, Sony Computer Entertainment, Toshiba and IBM. A System Co-Design and Co-Analysis Approach was applied where different components of the system are designed and analyzed simultaneously to allow trade-offs to be made to optimize system electrical characteristics at low overall system cost. The XDR memory interface circuit implemented in the Cell BE processor, the power delivery system design and analysis, and the interface statistical signal integrity analysis will be described to illustrate this design and analysis approach.
Ranked subsequence matching in time-series databases
Authors: Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Haifeng Jiang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence matching under time warping, which finds top-k subsequences most similar to a query sequence from data sequences. To the best of our knowledge, this is the first and most sophisticated subsequence matching solution mentioned in the literature. Specifically, we first provide a new notion of the minimum-distance matching-window pair (MDMWP) and formally define the mdmwp-distance, a lower bound between a data subsequence and a query sequence. The mdmwp-distance can be computed prior to accessing the actual subsequence. Based on the mdmwp-distance, we then develop a ranked subsequence matching algorithm to prune unnecessary subsequence accesses. Next, to reduce random disk I/Os and bad buffer utilization, we develop a method of deferred group subsequence retrieval. We then derive another lower bound, the window-group distance, that can be used to effectively prune unnecessary subsequence accesses during deferred group-subsequence retrieval. Through extensive experiments with many data sets, we showcase the superiority of the proposed methods.
Effects of code growth and parsimony pressure on populations in genetic programming
Authors: Terence Soule, James A. Foster
Venue: Evolutionary Computation (1998)

Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases parsimony pressure degrades the performance of the genetic program. In this paper we show that poor average results with parsimony pressure are a result of “failed” populations that overshadow the results of populations that incorporate parsimony pressure successfully. Additionally, we show that the effect of parsimony pressure can be measured by calculating the relationship between program size and performance within the population. This measure can be used as a partial indicator of success or failure for individual populations.
Bringing Forward Semantic Relations: Issues and Proposals
Authors: Francisco Alvarez, Antonio Vaquero, Fernando Saenz, Manuel de Buenaga
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Semantic relations are an important element in the construction of ontologies and models of problem domains. Nevertheless, they remain fuzzy or under- specified. This is a pervasive problem in Software Engineering and Artificial Intelligence. Thus, we find semantic links that can have multiple interpretations in wide-coverage ontologies, semantic data models with abstractions that are not enough to capture the relation richness of problem domains, and improperly structured taxonomies. However, if relations are provided with precise semantics, some of these problems can be avoided, and meaningful operations can be performed on them. In this paper we present some insightful issues about the modeling, representation and usage of relations including the available taxonomy structuring methodologies as well as the initiatives aiming to provide relations with precise semantics. Moreover, we explain and propose the control of relations as a key issue for the coherent construction of ontologies.
Communication and Coordination in Wireless Sensor and Actor Networks
Authors: Tommaso Melodia, Dario Pompili, Vehbi C. Gungor, Ian F. Akyildiz
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper, coordination and communication problems in Wireless Sensor and Actor Networks (WSANs) are jointly addressed in a unifying framework. A sensor-actor coordination model is proposed, based on an event-driven partitioning paradigm. Sensors are partitioned into different sets and each set is constituted by a data-delivery tree associated with a different actor. The optimal solution for the partitioning strategy is determined by mathematical programming, and a distributed solution is proposed. In addition, a new model for the actoractor coordination problem is introduced. The actor coordination is formulated as a task assignment optimization problem for a class of coordination problems in which the area to be acted upon needs to be optimally split among different actors. An auctionbased distributed solution of the problem is also presented.Performance evaluation shows how global network objectives, such as compliance with real-time constraints and minimum energy consumption, can be achieved in the proposed framework with simple interactions between sensors and actors that are suitable for large-scale networks of energy-constrained devices.
Laboratory modules for conducting comparative analysis of 802.11 frames
Authors: Raheel A. Malik, Raymond A. Hansen, James E. Goldman, Anthony H. Smith
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

As wireless networking in the enterprise has gained popularity within recent years, the demand for technical talent has increased in direct proportion to that demand. This has occurred partially due to the complexity of troubleshooting and security issues. Professional wireless networking certification programs have also become popular as a result of the financial incentives associated with this demand. Since the content taught in these professional certifications is an appropriate reflection of the challenges faced in the real world as reported by Fortune magazine and the ChannelWeb network [11], it makes sense to align the content of undergraduate wireless networking courses with that of these certifications. University professors have often taken the approach of teaching 802.11 wireless networks starting from the signal processing layer and immediately transitioning to the higher layers. This process bypasses the Media Access Control (MAC) layer in consequence. Understanding the MAC layer is of utmost importance for understanding wireless network security because it contains the management frames that control both authentication and encryption. In this paper, course modules were created for undergraduates that focus on the 802.11 and 802.3 MAC layers and can be used to facilitate teaching troubleshooting and security concepts for wireless networking with the help of packet sniffers. These modules provide students with the hands-on experience of what is generally illustrated in only text for Wired Equivalent Privacy (WEP), Wi-Fi Protected Access (WPA) and Virtual Private Networking (VPN) as well as troubleshooting skills.