ppxscal/embedding_network huggingface dataset:
A Fast Evolutionary Algorithm for Traveling Salesman Problem
Authors: Xue-song Yan, Han-min Liu, Jia Yan, Qing-hua Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper we proposed a new algorithm based on Inver-over operator, for traveling salesman problems (TSP). Inver-over is based on simple inversion; however, knowledge taken from other individuals in the population influences its action. In the new algorithm we use some new strategies including selection operator, replace operator and some new control strategy, which have been proved to be very efficient to accelerate the converge speed. We also use this approach to solve dynamic TSP. A dynamic TSP is harder than a general TSP, which is a NP-hard problem, because the city number and the cost matrix of a dynamic TSP are time varying, the algorithm to solve the dynamic TSP problem, which is the hybrid of EN and Inver-Over algorithm. Through the experiment, the new algorithm shows great efficiency in solving the static TSP and dynamic TSP.
Two stage packet classification using most specific filter matching and transport level sharing
Authors: M. E. Kounavis, A. Kumar, R. Yavatkar, H. Vin
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

In this paper we introduce two new concepts to the design of packet classification systems. First, we propose most specific filter matching (MSFM), an improvement over the well known Cross Producting algorithm [V. Srinivasan, S. Suri, G. Varghese, M. Waldvogel, Fast and scalable layer four switching, in: Proceedings of ACM SIGCOMM, 1998] that significantly reduces the memory requirement of the earlier scheme. Second, we suggest that rules specifying the same source-destination IP prefix pair can be grouped together forming shared sets of transport level fields. This property of Transport Level Sharing (TLS), which characterizes real world classification databases is exploited for reducing a classifier's memory requirement and for hardware acceleration. We split the classification process into two stages. First, we perform classification on source-destination IP prefix pairs using the MSFM algorithm. Second, we perform classification on transport level fields exploiting transport level sharing. It is the combination of most specific filter matching and transport level sharing which results in a scheme that requires no more than 11 dependent memory accesses in the critical path independent of the size of the classification database. The memory access bandwidth of our scheme is also bounded when our scheme is accelerated in hardware. Compared to other schemes which involve a small and predictable number of steps in the critical path (e.g., Cross Producting [V. Srinivasan, S. Suri, G. Varghese, M. Waldvogel, Fast and scalable layer four switching, in: Proceedings of ACM SIGCOMM, 1998] or Recursive Flow Classification [P. Gupta, N. McKeown, Packet classification on multiple fields, in: Proceedings of ACM SIGCOMM, 1999]) the combination of most specific filter matching and transport level sharing is associated with the least memory requirement.
Semantic components enhance retrieval of domain-specific documents
Authors: Susan L. Price, Marianne Lykke Nielsen, Lois M. L. Delcambre, Peter Vedsted
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We seek to leverage knowledge about information organization in a domain to effectively and efficiently meet targeted information needs of expert users. The semantic components model represents document content in a manner that is complementary to full text and keyword indexing. Semantic component instances are segments of text about a particular aspect of the main topic of the document and may not correspond to structural elements in the document. This paper describes the semantic components model and presents experimental evidence from a large interactive searching study showing that semantic components, used to supplement full text and keyword indexing and to extend the query language, enhanced the retrieval of domain-specific documents in response to realistic queries posed by real users.
Tensor Voting Fields: Direct Votes Computation and New Saliency Functions
Authors: Paola Campadelli, Gabriele Lombardi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In the last ten years the tensor voting framework (TVF), proposed by Medioni at al., has proved its effectiveness in perceptual grouping of arbitrary dimensional data. In the computer vision and image processing fields, this algorithm has been applied to solve various problems like stereo-matching, 3D reconstruction, and image inpainting. The TVF technique can detect and remove a big percentage of outliers, but unfortunately it does not generate satisfactory results when the data are corrupted by additive noise. In this paper a new direct votes computation algorithm for high dimensional spaces is described, and a parametric class of decay functions is proposed to deal with noisy data. Preliminary comparative results between the original TVF and our algorithm are shown on synthetic data.
An efficient non-probabilistic search algorithm for the N-queens problem
Authors: Jing-Chao Chen
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

We present a new heuristic search for the N-queens problem, which is neither backtracking nor random search. This algorithm finds systematically a solution in linear time. Its speed is faster than the fastest algorithm known so far. On an ordinary personal computer, it can find a solution for 3000000 queens in less than 5 seconds.
Power Quality Faint Disturbance Identification Using Wavelet Packet Energy Entropy and Weighted Support Vector Machines
Authors: Guo-sheng Hu, Feng-feng Zhu, You-zhi Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Wavelet packet energy (WPE) features are usually used to detect power quality disturbances (PQDs) in recent literatures, but by computing, we find that WPE features are not valid to detect faint disturbances. In this paper, wavelet packet energy entropy (WPEE) and weighted support vector machines (WSVMs) are utilized to detect and classify PQDs automatically. Electric power quality is an aspect of power engineering that has been with us since the inception of power systems. The types of concerned disturbances including voltage sag, swell, harmonics, flicker and interruption. Wavelet packet are utilized to decompose the signals into different special frequency bands, then to obtain five common features for sampling PQ disturbances including energy entropies of frequency bands. WSVMs are designed and trained for making a decision regarding the type of the disturbances. Simulation illustrates the algorithm feasibility and effectiveness.
On Some Results of Regular Digraphs as Coset Graphs and Their Applications
Authors: Wenjun Xiao, Mingxin He, Wenhong Wei, Weidong Chen
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In this paper, we obtain the representation of connected regular digraphs as coset graphs of Sn. Applying this representation, we give the conditions of isomorphisms and the formula of automorphism groups of connected regular digraphs, and their applications to Thompson's problem. It would have further more applications for parallel and distributed computing.
Lessons learned using two versions of textbook for programming language learning: classical and electronic
Authors: Slobodanka Djenic, Jelena Mitic, Svetlana Strbac
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper describes lessons learned using two versions of textbook for "C" programming language: classical and electronic. The Advanced school of electrical engineering in Belgrade offers two versions of course for this programming language learning: classic and modern, both practical courses. First, classical course is available through classroom and home work. Another, electronic course is interactive and this course is available through home work only or in combination with classic course. Combination of classic and modern approach in high level programming learning provided the best of both and students in this school widely accepted this approach.
The ATM forum: wireless ATM working group meeting in Portland (July, 27--30, 1998)
Authors: Bala Rajagopalan
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

The main development in the Portland meeting is the clear definition of the Release 1.0 WATM capability set [1]. The baseline text of the specifications prior to the Portland meeting was rather comprehensive indicating several scenarios for WATM access and deployment, including ad-hoc networking. The capability set for Release 1.0 is an edited version of the original baseline, with a limited number of reference configurations. Furthermore, the Release 1.0 features for handover and location management reflect a more realistic view of what can be achieved in the short term by the working group. Specifically, the handover requirements do not call for lossless delivery of cells during handover [2] and the location management architecture is restricted to a simple, two-level configuration of location servers [3].
Competency-based training in SMES: the role of e-learning and e-competence
Authors: Ileana Hamburg, Steffi Engert
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper, we examine the training situation of European Small and Medium Enterprises (SMEs), especially in regard to e-learning. While e-learning has been widely presented as the solution for the training needs of SMEs, analyses of the real situation show quite another picture. Some of these analyses are results of the project ARIEL - Analyzing and Reporting the Implementation of Electronic Learning in Europe (www.ariel-eu.net). ARIEL was an international joint project (2004-2005) funded by the European Commission in the framework of its e-learning Initiative. In the final section of the paper, we propose Competency-Based Training (CbT) as a systematic approach and thus as a possible solution for improving learning processes in SMEs and present conclusions on the challenges to be met in vocational and further training in SMEs.
Biologically inspired self-governance and self-organisation for autonomic networks
Authors: Sasitharan Balasubramaniam, Dmitri Botvich, William Donnelly, Mícheál Ó Foghlú, John Strassner
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

The current complexity of network management has helped drive the need for autonomic capabilities. The vision of autonomic network management provides the ability for network devices to cooperatively self-organise and self-govern in the support of high level business goals. These principles are inspired by biological systems. In this paper, we propose key self-organisation and self-governance techniques that are drawn from principles of molecular biology including (i) blood glucose homeostasis, (ii) reaction diffusion like principles, (iii) microorganism mobility using chemotaxis techniques, and (iv) hormone signaling. Preliminary simulation results have also been presented to validate our model.
The diameter of sparse random graphs
Authors: Daniel Fernholz, Vijaya Ramachandran
Venue: Random Structures Algorithms (2007)

We derive an expression of the form c ln n + o(ln n) for the diameter of a sparse random graph with a specified degree sequence. The result holds asymptotically almost surely, assuming that certain convergence and supercriticality conditions are met, and is applicable to the classical random graph Gn,p with np = &Theta;(1) + 1, as well as certain random power law graphs. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Sorter based permutation units for media-enhanced microprocessors
Authors: Giorgos Dimitrakopoulos, Christos Mavrokefalidis, Kostas Galanopoulos, Dimitris Nikolos
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Single or multibit subword permutations are useful in many multimedia and cryptographic applications. Several specialized instructions have been proposed to handle the required data rearrangements. In this paper, we examine the hardware implementation of the powerful permutation instruction group (GRP). The design of the proposed permutation unit is based on the functionality of sorting networks. Two variants of the sorter-based GRP unit are introduced and analyzed and their energy-delay behavior is investigated using static CMOS implementations in a 130-nm CMOS technology.
A multilayer data copy test data compression scheme for reducing shifting-in power for multiple scan design
Authors: Shih-Ping Lin, Chung-Len Lee, Jwu-E. Chen, Ji-Jan Chen, Kun-Lun Luo, Wen-Ching Wu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The random-like filling strategy pursuing high compression for today's popular test compression schemes introduces large test power. To achieve high compression in conjunction with reducing test power for multiple-scan-chain designs is even harder and very few works were dedicated to solve this problem. This paper proposes and demonstrates a multilayer data copy (MDC) scheme for test compression as well as test power reduction for multiple-scan-chain designs. The scheme utilizes a decoding buffer, which supports fast loading using previous loaded data, to achieve test data compression and test power reduction at the same time. The scheme can be applied automatic test pattern generation (ATPG)-independently or to be incorporated in an ATPG to generate highly compressible and power efficient test sets. Experiment results on benchmarks show that test sets generated by the scheme had large compression and power saving with only a small area design overhead.
Anomaly Detection in XML databases by means of Association Rules
Authors: Giulia Bruno, Paolo Garza, Elisa Quintarelli, Rosalba Rossato
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Anomaly detection has the double purpose of discovering interesting exceptions and identifying incorrect data in huge amounts of data. Since anomalies are rare events which violate the frequent relationships among data, we propose a method to detect frequent relationships and then extract anomalies. The RADAR (Research of Anomalous Data through Association Rules) method is based on data mining techniques to extract frequent "rules" from datasets, in the form of quasi-functional dependencies. Such dependencies are extracted by using association rules. Given a quasi-functional dependency, we can discover the associated anomalies by querying either the original database or the association rules previously mined. The analysis on this kind of anomaly can either derive the presence of erroneous data or highlight novel information which represents significant outliers of frequent rules. Our method does not require any previous knowledge and directly infers rules from the data. Experiments performed on real XML databases are reported to show the applicability and effectiveness of the proposed approach.
Using fuzzy places and hypertokens to reduce the number of states in stochastic Petri nets
Authors: A. de Korvin, R. Kleyle_c
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

A difficulty often encountered when using the Petri net approach to stochastic modeling is a proliferation in the number of states in the associated Markov chain. In this paper we present a solution to this proliferation problem by introducing the concept of a fuzzy stochastic Petri net. This paper then focuses on the problem of finding the stationary probability of reaching some selected output nodes, starting from selected input nodes when using a fuzzy set approach to modeling with stochastic Petri nets.
Mobility Estimation and Analysis in Medical X-ray Images Using Corners and Faces Contours Detection
Authors: Mohammed Benjelloun, Said Mahmoudi
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper describes a new segmentation approach used for detecting the location and the orientation of the cervical spinal column in medical x-ray images. A first preprocessing step consists on determining a global polygonal region for each vertebra. After this, we propose two different methods to calculate vertebrae orientation. The first method is based on the four faces detection of each vertebra contour when the second is essentially based on automatic corners localization. A specific goal of the proposed application is to create an efficient semi-automated method of identifying the overall spine curvature and the orientation angles of each vertebra. The final goal is to determine vertebrae motion induced by their movement between two or several positions.
A Novel Algorithm for Multi-valued Image Representation
Authors: Chuanbo Chen, Yunping Zheng, Mudar Sarem, Wei Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Although the representation methods of the quadtree for the multi-valued image have many important applications in different fields, they put too much emphasis upon the symmetry of image segmentation. Therefore, they are not the optimal representation methods. In this paper, inspired by the concept of the packing problem, we present a novel algorithm of Binarybit Plane Decomposition based on the Non-symmetry and Anti-packing pattern representation Model (BPD-based NAM) for the multi-valued image representation. The theoretical analyses and experimental results presented in this paper show that when the algorithm of BPD-based NAM is compared with that of the popular quadtree, the former can reduce the data storage much more effectively than the latter and it is a better method to represent the multi-valued image. This novel algorithm of BPD-based NAM opens a new research area with respect to the multi-valued image representation and is valuable for the further theoretical research and potential business foreground.
Hierarchical mobile network binding scheme for route optimization in NEMO
Authors: Moon Sang Jeong, Yeong Hun Cho, Jong Tae Park
Venue: Wireless Personal Communications: An International Journal (2007)

Recently, there has been a great deal of research on network mobility management that can support the movement of a mobile network consisting of several mobile nodes. The IETF NEMO working group proposed a basic support protocol, which defines methodology for supporting network mobility by using bi-directional tunneling between the home agent and the mobile router. This protocol, however, suffers from the `pinball routing problem,' and most of the research attempts to solve this problem still have limitations in the efficiency of intra-domain communication. Moreover, these methods require additional binding procedures in case of the root mobile router handover. In this paper, we propose new route optimization methodology that can remedy these limitations by using asymmetric tunneling and a hierarchical local binding mechanism, which can provide faster signaling and data transmission. It can also be easily extended to support micro-mobility without the need for additional extensions. The performance is evaluated by simulation which can show the efficiency of the approach, compared with several previous route optimization methods.
SP1: introducing the best of ada 2005
Authors: John G. P. Barnes
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

Ada 2005 is the latest chapter in the Ada story. Ada 95 was a huge leap forward from Ada 83. However, experience showed that Ada 95 has a number of gaps. Ada 2005 is not such a giant leap forward but aims rather to round off Ada 95 and so provide the community with a really smooth programming language suited for the demanding applications of the 21st century. John will explain the specific goals of the development and introduce the key new features of Ada 2005. The most obvious new features are in the OO model with the introduction of interfaces and in the real-time area with more control over timing and scheduling plus much more in the predefined library. But there are other improvements as well in areas such as visibility control, exceptions and generics. And of course also downward closures so that Ada is at last as good as Algol 60 in that area.
Computer Society Connection: IEEE President-Elect Candidates Address Computer Society Concerns
Venue: Computer (2007)

Recognizing the influence of the IEEE leadership over the Computer Society and in turn the power of Computer Society members' votes to influence the selection of the IEEE leadership, key volunteers posed questions to this year's IEEE president-elect candidates about matters of concern to Society members.
Six-Port Architecture based Receiver for MB-OFDM UWB Systems
Authors: Thomas Hardtke, Raik Richter, Hans-Joachim Jentschel
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

In this paper, we present the investigation of a six-port architecture based receiver for multi-band OFDM ultrawide band (UWB) systems. An UWB system simulator is implemented in MATLAB for specification compliant signal processing according to [1] and is represented by transmitter and receiver models. A six-port based receiver is presented which is used in the RF front-end of an UWB system. Its model includes six-port specific errors addressed in following case studies. Additionally, a performance influencing receiver environment is taken into account when we investigate the suitability of six-port architecture for UWB. We conclude this work by system performance evaluation under the considered application scenario.
Preference relation approach for obtaining OWA operators weights
Authors: Byeong Seok Ahn
Venue: International Journal of Approximate Reasoning (2008)

Actual result of aggregation performed by an ordered weighted averaging (OWA) operator heavily depends upon the weighting vector used. A number of approaches for obtaining the associated weights have been suggested in the academic literature. In this paper, we present a method for determining the OWA weights when (1) the preferences of some subset of alternatives over other subset of alternatives are specified in a holistic manner across all the criteria, and (2) the consequences (criteria values) are specified in one of three different formats: precise numerical values, intervals and fuzzy numbers. The OWA weights are to be estimated in the direction of minimizing deviations from the OWA weights implied by the preference relations, thus as consistent as possible with a priori preference relations.
A Self-Evolutionary Method for Service Emergence in Pervasive Computing Environments
Authors: Hongbin Sun, Yongsheng Ding
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The paper proposes a self-evolutionary approach of service emergence inspired by the characteristics of biological neuroendocrine and immune system. In pervasive computing environments, services are represented by autonomous bio-entities (mobile agents with biological operation), and bio-entities establish relationship network based on affinity to provide service emergence. Affinity adjustment depends on three factors, namely, the matching strength of bio-entities, the service quality score, and the trust. The method completes a series of work from composition to management autonomously. The simulation results show that the approach can form relationship clusters and significantly improve the service emergence performance. It adapts well to the changes of dynamic environments.