ppxscal/embedding_network huggingface dataset:
A new approach for solving large traveling salesman problem
Authors: Cheng-Fa Tsai, Chun-Wei Tsai, Ching-Chang Tseng
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a novel metaheuristic approach called ACOMAC algorithm for solving the TSP (traveling salesman problem). It introduces the multiple ant clans concept from parallel genetic algorithms to search a solution space that uses different islands to avoid local minima and so as to obtain a global minimum for solving the traveling salesman problem. In addition, the paper presents two methods called multiple nearest neighbor (NN) and dual nearest neighbor (DNN) to ACOMAC to improve large TSPs thus obtaining good solutions quickly. According to our simulation results, the ACOMAC outperforms the ant colony system (ACS) in average length comparison of the traveling salesman problem. In this work, it is observed that ACOMAC or ACS adding DNN or NN approach as initial solutions can provide a significant improvement for obtaining a global optimum solution or a near global optimum solution in large TSPs.
BugCrawler: Visualizing Evolving Software Systems
Authors: Marco D'Ambros, Michele Lanza
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software evolution is aimed at analyzing and understanding the present state of a software system and at predicting its future development. This knowledge supports reverse engineering activities since it allows the analyst to infer causes of problems in the system and to detect components which need to be restructured. However, effectively using evolutionary information is challenging because it typically comes in large amounts, especially when several years of evolution are considered. Techniques are needed to break down the data quantity and complexity. BugCrawler is a language independent tool which supports software evolution and reverse engineering1. It is based on a combination of software metrics and interactive visualizations. BugCrawler integrates structural information computed from the source code with evolutionary information retrieved from CVS log files and Bugzilla problem reports. It has been validated on several large projects.
The Lost Sheep of ICT4D Literature
Authors: Gerard C. Raiti
Venue: Information Technologies and International Development (2007)

Information communication technologies for development (ICT4D) is a new field of study that contains few grand theories compared to other areas of social science. This article analyzes some shortcomings of ICT4D research. First, there is juxtaposition between ICT4D's being a multidisciplinary field while its authors are predominantly not multidisciplinary. Second, ICT4D is not a panacea; it is only a piece of the development puzzle. ICTs alone cannot lead to social elevation. Third, who is responsible for the structure of ICT4D literature? Fourth, Habermas's public sphere is applied to mobile telephony in sub-Saharan Africa to demonstrate how ICT4D could expand upon the theoretical tradition within media studies. The conclusion recommends the creation of a global summit on ICT4D and more grand theories.
A predominant-F/sub 0/ estimation method for CD recordings: MAP estimation using EM algorithm for adaptive tone models
Authors: M. Goto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper describes a predominant-F/sub 0/ (fundamental frequency) estimation method called PreFEst, which can detect melody and bass lines in monaural audio signals containing sounds of various instruments, While most previous methods premised mixtures of a few sounds and had difficulty dealing with such complex signals, our method can estimate the F/sub 0/ of the melody and bass lines without assuming the number of sound sources in compact-disc recordings. In this paper we propose the following three extensions to our previous PreFEst to make it more adaptive and flexible: introducing multiple harmonic-structure tone models, estimating the shape of tone models, and introducing a prior distribution of its shape and F/sub 0/ estimates These extensions were implemented by the MAP (maximum a posteriori probability) estimation by using the expectation-maximization algorithm. Experimental results with compact-disc recordings showed that our real-time system based on the extended PreFEst achieved performance improvement.
Access control management and security in multi-domain collaborative environments
Authors: Arif Ghafoor
Venue:  (2006)

With the increase in information and data accessibility, there is a growing concern for security and privacy of data. In large corporate Intranets, the insider attack is a major security problem. Numerous studies have shown that unauthorized accesses, in particular by insiders, pose a major security threat for distributed enterprise environments. This problem is highly magnified in a multi-domain environment that spans multiple enterprises collaborating to meet their business requirements. The challenge is in developing new or extending existing security models for efficient security management and administration in multi-domain environments that allow extensive interoperation among individuals or systems belonging to different security domains.In this dissertation, we have addressed the issue of secure interoperation from policy management perspective. In particular, we have developed a policy-based framework that allows secure information and resource sharing in multi-domain environments supporting both tightly-coupled and loosely-coupled collaborations. The level of coupling in such environments is characterized by the degree of interoperation, the level of trust among domains, and the security, autonomy, and privacy requirements of the collaborating domains. The proposed framework provides efficient solutions and strategies for ensuring secure interoperation in both tightly-coupled and loosely-coupled multi-domain environments. This framework is designed for distributed systems that employ role based access control (RBAC) policies, and therefore addresses the secure interoperability requirements of emerging distributed application systems.
Periodically nonuniform bandpass sampling as a tapped-delay-line filtering problem
Authors: D. Scholnik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We consider systems for demodulation/modulation which use periodically nonuniform sampling (of arbitrary order) of the bandpass signal to circumvent the carrier-frequency restrictions of uniform sampling. The design of a particular tapped-delay-line (demodulation) or piecewise-constant-impulse-response (modulation) equivalent filter determines both the actual implementation filters and system performance. The tap spacing of the former and the transition times of the latter are periodically nonuniform. Following a characterization of the equivalent filter response, the special case of second-order sampling is examined for insight into the choice of sampling offset. A set of example designs demonstrates that, while nonuniform sampling permits carrier frequencies not allowed with uniform sampling, the resulting system performance is limited by the choice of carrier frequency.
Existence of positive solutions for nonlinear three-point problems on time scales
Authors: İsmail Yaslan
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, by using fixed point theorems in cones, we study the existence of at least one, two and three positive solutions of a nonlinear second-order three-point boundary value problem for dynamic equations on time scales. As an application, we also give some examples to demonstrate our results.
Methods of function approximation and modern computer-based technologies (Review)
Authors: O. N. Litvin, I. V. Sergienko
Venue: Cybernetics and Systems Analysis (2007)

The paper reviews publications over the last five years devoted to efficient solutions of some important practical problems using interlineation and interflation (blending function interpolation) and blending function approximation.
Fault-tolerant analysis of a class of networks
Authors: Jun-Ming Xu, Qiang Zhu, Min Xu
Venue: Information Processing Letters (2007)

In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G"0,G"1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computation 140 (2003) 245-254]. As applications of the results, we obtain that the 2-extraconnectivities of several well-known interconnection networks, such as hypercubes, twisted cubes, crossed cubes, Mobius cubes and locally twisted cubes, are all equal to 3n-5 when their dimension n is not less than 8. That is, when n>=8, at least 3n-5 vertices must be removed to disconnect any one of these n-dimensional networks provided that the removal of these vertices does not isolate a vertex or an edge.
Domain specific languages for ad hoc distributed applications
Authors: Matthew Fuchs
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

The Internet provides a medium to combine human and computational entities together for ad hoc co-operative transactions. To make this possible, there must be a framework allowing all parties (human or other) to communicate with each other. The current framework makes a fundamental distinction between human agents (who use HTML) and computational agents, which use CORBA or COM. We propose DSLs as a means to allow all kinds of agents to "speak the same language." In particular we adopt some ideas (and syntax) from SGML/XML, especially the strict separation of syntax and semantics, so each agent in a collaboration is capable of applying a behavioral semantics appropriate to its role (buyer, seller, editor). We develop the example of a card game, where the syntax of the language itself implies some of the semantics of the game.
JOLIE: a Java Orchestration Language Interpreter Engine
Authors: Fabrizio Montesi, Claudio Guidi, Roberto Lucchi, Gianluigi Zavattaro
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Service oriented computing is an emerging paradigm for programming distributed applications based on services. Services are simple software elements that supply their functionalities by exhibiting their interfaces and that can be invoked by exploiting simple communication primitives. The emerging mechanism exploited in service oriented computing for composing services -in order to provide more complex functionalities- is by means of orchestrators. An orchestrator is able to invoke and coordinate other services by exploiting typical workflow patterns such as parallel composition, sequencing and choices. Examples of orchestration languages are XLANG [IBM, ''XLANG: Web Services for Business Process Design,''http://www.gotdotnet.com/team/xml_wsspecs/xlang-c/default.htm] and WS-BPEL [OASIS, ''Web Services Business Process Execution Language Version 2.0, Working Draft,''http://www.oasis-open.org/committees/download.php/10347/wsbpel-specification-draft-120204.htm]. In this paper we present JOLIE, an interpreter and engine for orchestration programs. The main novelties of JOLIE are that it provides an easy to use development environment (because it supports a more programmer friendly C/Java-like syntax instead of an XML-based syntax) and it is based on a solid mathematical underlying model (developed in previous works of the authors [N. Busi, R. Gorrieri, C. Guidi, R. Lucchi and G. Zavattaro, Towards a formal framework for Choreography, in: Proc. of 3rd International Workshop on Distributed and Mobile Collaboration (DMC 2005) (2005), N. Busi, R. Gorrieri, C. Guidi, R. Lucchi and G. Zavattaro, Choreography and orchestration conformance for system design, in: Proc. of 8th International Conference on Coordination Models and Languages (COORDINATION'06), LNCS to appear, 2006, C. Guidi and R. Lucchi, Mobility mechanisms in service oriented computing, in: Proc. of 8th International Conference on on Formal Methods for Open Object-Based Distributed Systems (FMOODS'06), LNCS to appear, 2006]).
Reproducible research in computational economics: guidelines, integrated approaches, and open source software
Authors: Giovanni Baiocchi
Venue: Computational Economics (2007)

Traditionally, computer and software applications have been used by economists to off-load otherwise complex or tedious tasks onto technology, freeing up time and intellect to address other, intellectually more rewarding, aspects of research. On the negative side, this increasing dependence on computers has resulted in research that has become increasingly difficult to replicate. In this paper, we propose some basic standards to improve the production and reporting of computational results in economics for the purpose of accuracy and reproducibility. In particular, we make recommendations on four aspects of the process: computational practice, published reporting, supporting documentation, and visualization. Also, we reflect on current developments in the practice of computing and visualization, such as integrated dynamic electronic documents, distributed computing systems, open source software, and their potential usefulness in making computational and empirical research in economics more easily reproducible.
Inferring and debugging path MTU discovery failures
Authors: Matthew Luckie, Kenjiro Cho, Bill Owens
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

If a host can send packets larger than an Internet path can forward, it relies on the timely delivery of Internet Control Message Protocol (ICMP) messages advising that the packet is too big to forward. An ICMP Packet Too Big message reports the largest packet size - or Maximum Transmission Unit (MTU) - that can be forwarded to the next hop. The iterative process of determining the largest packet size supported by a path by learning the next-hop MTU of each MTU-constraining link on the path is known as Path MTU Discovery (PMTUD). It is fundamental to the optimal operation of the Internet. There is a perception that PMTUD is not working well in the modern Internet due to ICMP messages being firewalled or otherwise disabled due to security concerns. This paper provides a review of modern PMTUD failure modes. We present a tool designed to help network operators and users infer the location of a failure. The tool provides fairly detailed information about each failure, so the failure can be resolved. Finally, we provide data on the failures that occurred on a large jumbo-capable network and find that although disabling ICMP messages is a problem, many other failure modes were found.
FPGA Architecture for RF Transceiver System and Mixed-Signal Low Cost Tests
Authors: Ivo Koren, Frank Demmerle, Roland May, Martin Kaibel, Sebastian Sattler
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

Standard automated test equipment (ATE) for radio frequency (RF) transceiver production testing of today is limited by digital signal processing and data transfer. These constraints can be considerably relaxed by the application of new technology based on field programmable gate array (FPGA). The methods proposed are capable of handling all tasks flexibly and at-speed. FPGA hardware resources are embedded into available ATE environment and support modular signal processing as well as high-speed interfacing. Avoiding any ATE upgrades, the costs for RF transceiver production testing can be driven to an absolute minimum that is achievable.
Prefetching hyperlinks
Authors: Dan Duchamp
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

This paper develops a new method for prefetching Web pages into the client cache. Clients send reference information to Web servers, which aggregate the reference information in near-real-time and then disperse the aggregated information to all clients, piggybacked on GET responses. The information indicates how often hyperlink URLs embedded in pages have been previously accessed relative to the embedding page. Based on knowledge about which hyperlinks are generally popular, clients initiate prefetching of the hyperlinks and their embedded images according to any algorithm they prefer. Both client and server may cap the prefetching mechanism's space overhead and waste of network resources due to speculation. The result of these differences is improved prefetching: lower client latency (by 52.3%) and less wasted network bandwidth (24.0%).
The design and performance of meta-programming mechanisms for object request broker middleware
Authors: Nanbor Wang, Kirthika Parameswaran, Douglas Schmidt, Ossama Othman
Venue: Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6 (2001)

Distributed object computing (DOC) middleware shields developers from many tedious and error-prone aspects of programming distributed applications. Without proper support from the middleware, however, it can be hard to evolve distributed applications after they are deployed. Therefore, DOC middleware should support meta-programming mechanisms, such as smart proxies and interceptors, that improve the adaptability of distributed applications by allowing their behavior to be modified without changing existing software drastically. This paper presents three contributions to the study of metaprogramming mechanisms for DOC middleware. First, it illustrates, compares, and contrasts several meta-programming mechanisms from an application developer's perspective. Second, it outlines the key design and implementation challenges associated with developing smart proxies and portable interceptors features for CORBA. Third, it presents empirical results that pinpoint the performance impact of smart proxies and interceptors. Our goal is to help researchers and developers determine which meta-programming mechanisms best suit their application requirements.
A simulation study of multi-recipient messages in the session initiation protocol
Authors: I. Miladinovic, J. Stadler
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In a multiparty session a signaling message is often sent to several or to all session participants. Nowadays. these messages are usually sent over unicast to each participant in turn. because there are serious security problems when a signaling message is sent over multicast. On the other side, replicated messages over unicast essentially increase signaling traffic when the number of message recipients increases. This paper introduces an extension to the Session Initiation Protocol (SIP) that reduces the signaling traffic for multirecipient messages. We also present the result of simulations where we compare the signaling traffic with and without the extension. Several simulation scenarios are presented and analyzed and all of them clearly show that the extension considerably reduces the signaling traffic for multi-recipient messages, even when some SIP components do not support the extension.
Sensor Scheduling for Aggregate Monitoring inWireless Sensor Networks
Authors: Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubramanian
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Most of the applications of wireless sensor networks involve primarily data collection with in-network processing in which continuous aggregate queries are posed and processed. There are two principle concerns with this type of applications. First, due to the use of batteries, limited power resource has been identified as a major challenge in deploying wireless sensor networks. Second, data is usually expected to be gathered as soon as possible to facilitate the monitoring of and the response to the physical phenomena. In this paper, we tackle these challenges through sensor state scheduling. The proposed technique is based on the observation that there are two types of traffic in sensor networks designed for data aggregation, bottom-up and top-down within an abstract tree structure. We show that it is possible to achieve deterministic schedules for data aggregation with very good performance. Specifically, we develop greedy algorithms to schedule transmission and listening operations for each sensor node to achieve collisionfree communication. We show that the schedules can maximize the time sensor nodes spent on low-power states which helps achieve great energy efficiency, as well as allow fast data aggregation.
Fading-resistant and MUI-free codes for CDMA systems
Authors: A. Scaglione
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A new class of codes was proposed recently for perfect multi-user interference (MUI) suppression in code division multiple access (CDMA) systems. These so called Lagrange-Vandermonde (LV) codes offer deterministic MUI elimination without channel estimation, and convert frequency selective channels into flat fading channels. In this work, we develop dual CDMA transceivers, naturally termed Vandermonde Lagrange (VL), with the precoder-decoder roles interchanged, in order to improve the system flexibility in the code assignment. We also derive and test nonredundant and redundant techniques for combating the residual flat fading.
An extension of an interior-point method for entropy minimization
Authors: I. F. Gorodnitsky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Entropy optimization is used in signal compression, coding, estimation, and resource scheduling, among other applications. The paper presents a novel algorithm for entropy optimization. The algorithm is motivated by the efficient interior-point methods developed in linear programming. The algorithm uses a generalized affine scaling transformation that is an extension of the affine scaling transformation utilized in interior-point methods. I show that for some entropy functions the proposed algorithm has superior convergence properties when compared to comparable interior-point methods. The proposed algorithm is also shown to be related to, and a more general case of, the FOCUSS algorithm.
Social Decision Making with Multi-Relational Networks and Grammar-Based Particle Swarms
Authors: Marko A. Rodriguez
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Social decision support systems are able to aggregate the local perspectives of a diverse group of individuals into a global social decision. This paper presents a multirelational network ontology and grammar-based particle swarm algorithm capable of aggregating the decisions of millions of individuals. This framework supports a diverse problem space and a broad range of vote aggregation algorithms. These algorithms account for individual expertise and representation across different domains of the group problem space. Individuals are able to pose and categorize problems, generate potential solutions, choose trusted representatives, and vote for particular solutions. Ultimately, via a social decision making algorithm, the system aggregates all the individual votes into a single collective decision.