ppxscal/embedding_network huggingface dataset:
Methods based on discrete optimization for finding road network rehabilitation strategies
Authors: Geir Dahl, Harald Minken
Venue: Computers and Operations Research (2008)

We study a dynamic optimization problem arising in the (long-term) planning of road rehabilitation activities. In this area one seeks a pavement resurfacing plan for a road network under budget constraints. Our main approach is to model this as an integer programming problem with underlying dynamic programming structure. We investigate properties of this model and propose a solution method based on Lagrangian relaxation where one gets subproblems that are shortest path problems. Some computational experiences based on realistic data are reported.
Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs
Authors: Chunhui LIU, Jigui SUN, Jian GAO
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Concurrent search is an efficient technique for solving Distributed Constraint Satisfaction Problems (DisCSPs). Dynamic Variable Ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.
An Improved Algorithm for Eleman Neural Network to Avoid the Local Minima Problem
Authors: Zhiqiang Zhang, Guofeng Tang, Zheng Tang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Eleman Neural Network has been widely used in various fields, from classification to the prediction categories in natural language data. However, the local minima problem usually occurs in the process of the learning. To solve this problem and to speed up the process of the convergence, we propose an improved learning method by adding a term in error function which relates to the neuron saturation of the hidden layer for the Eleman Neural Network. The activation functions are adapted to prevent neurons in the hidden layer from getting into deep saturation area. We apply this method to the Boolean Series Prediction Questions to demonstrate its validity. The simulation result shows that the proposed algorithm can avoid the local minima problem, largely accelerate the speed of the convergence and get good results for the simulation tasks. keywords: Eleman Neural Network (ENN),Local Minima Problem,Gain parameter,Boolean Series Prediction Questions (BSPQ)
Priority-enabled optical shared protection: An online efficiency evaluation study
Authors: W. Fawaz, K. Chen, G. Pujolle
Venue: Computer Communications (2007)

The availability of an optical connection is considered to be a critical service differentiator in WDM optical networks. In this regard, the design of a protection scheme that is able to improve the availability of high priority connections while making efficient use of optical resources is a major concern for optical network operators. In a previous work, we proposed the so-called priority-aware shared protection as a potential survivability scheme for next generation WDM networks to deal with the previously exhibited concern. This paper develops an online study whose main purpose is to assess the efficiency of the aforementioned protection scheme. Through this study, we show that the priority-aware shared protection strategy is able to achieve both the best efficiency in terms of resource usage and in terms of availability satisfaction rate compared to existing protection solutions.
An ecology-based adaptive network control scheme for radio resource management in heterogeneous wireless networks
Authors: Jie Chen, Kai Yu, Guang Yang, ZhiYong Feng, Yang Ji, Ping Zhang, Qing Huang, Yong Bai, Lan Chen, Masahiro Minomo
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

The major challenge in future heterogeneous wireless networks is to promote the network welfare by well designing the radio resource management (RRM). Due to the similarity of both the ecological system and the heterogeneous wireless networks on the competitiveness, we propose a novel ecology-based adaptive network control (EBANC) scheme for RRM to optimize the network revenue, which introduces the Lotka-Volterra competition equations (L-V model) to predict the outcome of competitiveness. The proposed EBANC consists of two key algorithms, which are access selection algorithm on the user side and the price control algorithm on the network side. The simulation results exhibit the better performance of the EBANC scheme compared with other existing access selection scheme.
Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling
Authors: Gang Qu
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-a-chip, in particular DSP systems, can greatly improve performance through parallelism. On the other hand, dynamic voltage scaling (DVS) has been shown to be one of the most effective low power design techniques and multiple supply voltage system is among the most practical and well-studied DVS systems. The integration of multiple cores/processors on a chip naturally makes the system suitable for DVS with new innovations such as voltage island. In this paper, we discuss how to reduce multicore system's power consumption by utilizing multiple supply voltages. We first formulate the power management problem for multicore multi-voltage embedded systems and show that the problem is NP-hard, but the NPhardness can be removed for several real life applications. More specific, we develop polynomial algorithms to find the optimal solutions for two special cases. The first case is when preemption is allowed, and the second one is when the system uses the first-come-first- serve (FCFS) service strategy. We prove both algorithms' optimality and analyze their run-time complexity. Simulation on reallife and randomly generated tasks show that the optimal preemption scheduler provides significant energy saving. Our goal in this paper is to build a solid foundation for the power management problem on multicore multiple voltage systems and to study real life applications where the problem can be solved optimally.
Algorithms for l1-Embeddability and Related Problems
Authors: Pierre Hansen, Sylvain Perron
Venue: Journal of Classification (2007)

Assouad has shown that a real-valued distance d = (dij)1 ¿ i < j ¿ n is isometrically embeddable in ¿1space if and only if it belongs to the cut cone on n points. Determining if this condition holds is NP-complete. We use Assouad's result in a constructive column generation algorithm for ¿1-embeddability. The subproblem is an unconstrained 0-1 quadratic program, solved by Tabu Search and Variable Neighborhood Search heuristics as well as by an exact enumerative algorithm. Computational results are reported. Several ways to approximate a distance which is not ¿1-embeddable by another one which is are also studied.
Techniques for Memory Testing
Authors: J. M. Crafts
Venue: Computer (1979)

Semiconductor memory production relies hedvily on test technology. One testing technique real-time bit mapping offers more advantages than any other.
Protocols for Deadlock Detection in Distributed Database Systems
Authors: G. S. Ho
Venue: IEEE Transactions on Software Engineering (1982)

In distributed databases, deadlocks may occur due to conflicts in data file lockings A system is in a deadlock if and only if there is a directed cycle in its demand graph. However, due to the inherent communication delay in a distributed system, it is not easy to construct a consistent demand graph for a distributed system. In this paper, three deadlock detection protocols are discussed. The first protocol uses two communication phases. The second protocol uses a single communication phase. Based on the second protocol, a one-phase hierarchical deadlock detection protocol is developed.
A New Mechanical Algorithm for Solving System of Volterra Integral Equation
Authors: Weiming Wang, Zhenbing Zeng, Lu Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, by using the theories and methods of mathematical analysis and computer algebra, a complete iterated collocation method for solving system of Volterra integral equation is established, furthermore, the truncated error is discussed. And a new mechanical algorithm VoltEqns is established, too. The algorithm can provide the approximate solution of system of Volterra integral equation. Some examples are presented to illustrate the efficiency and accuracy of the algorithm. This will be useful for the integral system solving and mathematical theorems automatic proving.
GQM^+ Strategies -- Aligning Business Strategies with Software Measurement
Authors: Victor Basili, Jens Heidrich, Mikael Lindvall, Jurgen Munch, Myrna Regardie, Adam Trendowicz
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

GQM^+ Strategies is a measurement approach that builds on the well-tested GQM approach to planning and implementing software measurement. Although GQM has proven itself useful in a variety of industrial settings, one recognized weakness is the difficulty for GQM users to link software measurement goals to higher-level goals of the organization in which the software is being developed. This linkage is important, as it helps to justify software measurement efforts and allows measurement data to contribute to higher-level decisions. GQM^+ Strategies provides mechanisms for explicitly linking software measurement goals, to higher-level goals for the software organization, and further to goals and strategies at the level of the entire business.
On the Performance of Hybrid Wireless/Wired Mesh Networks
Authors: Sebastian Max, Lothar Stibor, Guido R. Hiertz, Dee Denteneer
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Wireless Mesh Networks (WMNs) transparently ex- tend the coverage of a portal via Mesh Points (MPs) which relay data over multiple hops to the associated stations. While this concept lowers costly wire installa- tions, capacity is reduced by the multiple transmissions. Therefore, multiple portals are needed to limit the route length, resulting in a wireless network supported by a wired backbone. In this paper, we analyze how the variation of the average ratio of MPs per portal effects the network performance. To do so, a realistic system model is defined which incorporates the typical char- acteristics of a wireless link based on IEEE 802.11a. Then, we use an analytical framework which allows to compute the capacity in an arbitrary network topology under the conditions of the system model. The comparison of the average system capacity with different ratios shows that the performance gain dimin- ishes with increasing number of portals: While the step from one to two portals doubles the capacity, there is only a small difference between 1 and 0.5 MPs per por- tal. Furthermore, a simple cost model provides insights to the economical feasibility of WMNs: In the case that an MP costs about 10% of a portal, the optimal ratio is found to be around 5 MPs per portal.
A description of holland's royal road function
Authors: Terry Jones
Venue: Evolutionary Computation (1994)

This paper contains a description of John Holland's Royal Road function, which was presented at the Fifth International Conference on Genetic Algorithms in July 1993 and posted to the Internet Genetic Algorithms mailing list in August 1993.
StereoBox: a robust and efficient solution for automotive short-range obstacle detection
Authors: Alberto Broggi, Paolo Medici, Pier Paolo Porta
Venue: EURASIP Journal on Embedded Systems (2007)

This paper presents a robust method for close-range obstacle detection with arbitrarily aligned stereo cameras. System calibration is performed by means of a dense grid to remove perspective and lens distortion after a direct mapping between image pixels and world points. Obstacle detection is based on the differences between left and right images after transformation phase and with a polar histogram, it is possible to detect vertical structures and to reject noise and small objects. Found objects' world coordinates are transmitted via CAN bus; the driver can also be warned through an audio interface. The proposed algorithm can be useful in different automotive applications, requiring real-time segmentation without any assumption on background. Experimental results proved the system to be robust in several envitonmental conditions. In particular, the system has been tested to investigate presence of obstacles in blind spot areas around heavy goods vehicles (HGVs) and has been mounted on three different prototypes at different heights.
Using P2P, GRID and Agent technologies for the development of content distribution networks
Authors: Giancarlo Fortino, Wilma Russo
Venue: Future Generation Computer Systems (2008)

Content Distribution Networks (CDNs) have recently emerged as an innovative technology to improve the efficiency of static, time-dependent, and rich media content delivery atop large-scale IP-based networks. Apart from network technology advances, the design and implementation of robust and efficient CDNs in large-scale computing environments call for paradigms and software technologies which are able to support the core functionalities of CDNs, namely distribution, management, discovery, and delivery of content. Agent, GRID, and P2P computing paradigms and technologies have already demonstrated their suitability in supporting the development of high-performance systems over large-scale, dynamic, and heterogeneous environments. Therefore the combined use of all three paradigms and technologies which are characterized by dynamism, robustness, and intelligence, is expected to increase the effectiveness and boost the efficiency of future CDNs. In this paper, we present UPGRADE-CDN, an experimental component-based platform which jointly uses P2P, GRID, and Agent based mechanisms for client request redirection, CDN monitoring, and content delivery.
Context-Aware Architecture for Intelligent Application Services in Ubiquitous Computing
Authors: Jae-Woo Chang, Hyun-Jo Lee
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper, we design a context-aware architecture for dealing with intelligent application services in ubiquitous computing. The context-aware architecture is composed of middleware, context server, and client. The middleware component of our context-aware architecture plays an important role in recognizing a moving node with mobility by using a Bluetooth wireless communication technology as well as in executing an appropriate execution module according to the context acquired from a context server. The context server functions as a manager that efficiently stores into the database server context information, such as user's current status, physical environment, and resources of a computing system. To verify the usefulness of our architecture, we finally develop a context-aware application system base on it, which provides users with a music playing service in ubiquitous computing environment.
Some New Error Bounds and Approximations for Pattern Recognition
Authors: J. T. Chu
Venue: IEEE Transactions on Computers (1974)

For the average error probability Pe associated with the Bayes recognition procedures for two possible patterns, using no context, new upper and lower bounds and approximations are obtained. Results are given in terms of simple functions of feature "reliability" and a priori probabilities of the patterns. Two kinds of feature "reliability" are considered, i.e., distance between probability distrib
Neural correlates of multisensory integration of ecologically valid audiovisual events
Authors: Jeroen J. Stekelenburg, Jean Vroomen
Venue: Journal of Cognitive Neuroscience (2007)

A question that has emerged over recent years is whether audiovisual (AV) speech perception is a special case of multi-sensory perception. Electrophysiological (ERP) studies have found that auditory neural activity (N1 component of the ERP) induced by speech is suppressed and speeded up when a speech sound is accompanied by concordant lip movements. In Experiment 1, we show that this AV interaction is not speech-specific. Ecologically valid nonspeech AV events (actions performed by an actor such as handclapping) were associated with a similar speeding-up and suppression of auditory N1 amplitude as AV speech (syllables). Experiment 2 demonstrated that these AV interactions were not influenced by whether A and V were congruent or incongruent. In Experiment 3 we show that the AV interaction on N1 was absent when there was no anticipatory visual motion, indicating that the AV interaction only occurred when visual anticipatory motion preceded the sound. These results demonstrate that the visually induced speeding-up and suppression of auditory N1 amplitude reflect multisensory integrative mechanisms of AV events that crucially depend on whether vision predicts when the sound occurs.
Note: Cyclic bandwidth with an edge added
Authors: W. H. Chan, Peter C. B. Lam, W. C. Shiu
Venue: Discrete Applied Mathematics (2008)

B"c(G) denotes the cyclic bandwidth of graph G. In this paper, we obtain the maximum cyclic bandwidth of graphs of order p with adding an edge e@?E[G@?] as follows:B"c(G+e)=2B"c(G)ifB"c(G)=p8. We also show that this bound is sharp.
Support Vector Machine for Classification of Hyperspectral Remote Sensing Imagery
Authors: Chen-guang Dai, Xiao-bo Huang, Guang-jun Dong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

As one of the popular and advanced statistical learning algorithms, Support Vector Machine (SVM) has been the new hot study area of pattern recognition and machine learning in recent years. SVM has such advantages as suitableness to high dimensional data, requirement of few samples and robustness to uncertainty, so it can be used to hyperspectral remote sensing image classification effectively. Based on the theory of SVM, a new approach for information classification on hyperspectral sensor has been developed by the experimental case of spatial infor- mation classification in central area of Shanghai city with PHI image. The algorithm is synthetically compared with the traditional classification methods. The experiment results confirm the effectiveness of the proposed method, which results in higher classifi- cation accuracy than the traditional methods.
Improving adaptive fuzzy control performance by speeding up identification&colon; Application to an electric furnace
Authors: J. Valente de Oliveira, J. M. Lemos
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

The development and application to a physical system of an adaptive predictive fuzzy controller is presented. The target process is a small electric furnace used in ceramic manufacturing. The proposed controller attempts to minimize a multi-step quadratic cost under the assumption that the control actions are all free over the prediction horizon. The control law relies on a simplified fuzzy relational model identified on-line. A convenient selection of the triangular norms used in the composition operator is made for allowing the application of Recursive Least Squares (RLS) to fuzzy relational structures, thus speeding up identification. It is shown that for a particular selection of norms, relational structures require less parameters to be described, and they can be interpreted as a set of simplified fuzzy rules. Examples are presented in which the controller developed outperforms other controllers with identification procedures based on gradient.
The Performance of Multistage Interconnection Networks for Multiprocessors
Authors: C. P. Kruskal
Venue: IEEE Transactions on Computers (1983)

This paper studies the performance of unbuffered and buffered, packet-switching, multistage interconnection networks. We begin by reviewing the definition of banyan networks and introducing some generalizations of them. We then present an asymptotic analysis of the performance of unbuffered banyan networks, thereby solving a problem left open by Patel. We analyze the performance of the unbuffered generalized banyan networks, and compare networks with approximately equivalent hardware complexity. Finally, we analyze the performance of buffered banyan networks and again compare networks with approximately equivalent hardware complexity.
Semantic Wikipedia
Authors: Markus Krötzsch, Denny Vrandečić, Max Völkel, Heiko Haller, Rudi Studer
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

Wikipedia is the world's largest collaboratively edited source of encyclopaedic knowledge. But in spite of its utility, its content is barely machine-interpretable and only weakly structured. With Semantic MediaWiki we provide an extension that enables wiki-users to semantically annotate wiki pages, based on which the wiki contents can be browsed, searched, and reused in novel ways. In this paper, we give an extended overview of Semantic MediaWiki and discuss experiences regarding performance and current applications.
Printer Technology: Competition for the Ribbon Bangers
Authors: D. F. Busch
Venue: Computer (1975)

Most DP managers know that systems come with printers. They also know that when ordering a system, one must analyze the printed output requirements and order a sufficient number of printers to handle the load on schedule. The units are assumed to be reliable and, in view of the cost of the large volume of paper processed each month, not overly expensive. In most medium- and large-size installations, the cost of the paper exceeds the cost of the printers. 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
Personalized Information Recommendation Service System Based on GIS
Authors: Zu Xiaofang, Luo Jin, Luo Qi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

To realize personalized location service, personalized information recommendation service system based on GIS is proposed and realized. The structure of system, workflow and key technologies of realizing feature selection module, user interest module, personalized maps resources filtering module are introduced in the paper. After the test use of the system by some certain users, we found that the system could improve the learners' initiative participation in location based service. The paper serves as a case study tries to expose the potential of wireless technology to serve LBSs. The future study focuses on an object-oriented database system capable for large spatial dataset.