ppxscal/embedding_network huggingface dataset:
Endogenous versus exogenous self-management
Authors: Danny Weyns, Robrecht Haesevoets, Bart Van Eylen, Alexander Helleboogh, Tom Holvoet, Wouter Joosen
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Self-management is considered as one of the crucial means for software systems to deal with changing demands at runtime. Self-management endows a software systems with the ability to adapt its structure or behavior without human intervention. Two different approaches are put forward for self-management: (1) the system components adapt their structure or behavior to changing requirements and cooperatively realize system adaptation - this approach can be considered as endogenous self-management; (2) the system is adapted through a control loop, i.e. the system is monitored to maintain an explicit representation of the system and based on a set of high-level objectives, the system structure or its behavior is adapted - this approach can be considered as exogenous self-management. In this paper, we introduce a hybrid software architecture that combines both approaches. A multi-agent system architecture allows agents to flexibly adapt their behavior to changes in their context providing cooperative system adaptation. Then, we extend the multi-agent system architecture with a decentralized control loop adding self-healing properties to the system. We use intelligent monitoring of traffic jams as an illustrative case.
Generating diverse katakana variants based on phonemic mapping
Authors: Kazuhiro Seki, Hiroyuki Hattori, Kuniaki Uehara
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In Japanese, it is quite common for the same word to be written in several different ways. This is especially true for katakana words which are typically used for transliterating foreign languages. This ambiguity becomes critical for automatic processing such as information retrieval (IR). To tackle this problem, we propose a simple but effective approach to generating katakana variants by considering phonemic representation of the original language for a given word. The proposed approach is evaluated through an assessment of the variants it generates. Also, the impact of the generated variants on IR is studied in comparison to an existing approach using katakana rewriting rules.
Spiking neural P systems with extended rules: universality and languages
Authors: Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Păun, Gheorghe Păun, Mario J. Pérez-Jiménez
Venue: Natural Computing: an international journal (2008)

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.
Improved and generalized learning strategies for dynamically fast and statistically robust evolutionary algorithms
Authors: Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M. K. Tiwari
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper characterizes general optimization problems into four categories based on the solution representation schemes, as they have been the key to the design of various evolutionary algorithms (EAs). Four EAs have been designed for different formulations with the aim of utilizing similar and generalized strategies for all of them. Several modifications to the existing EAs have been proposed and studied. First, a new tradeoff function-based mutation has been proposed that takes advantages of Cauchy, Gaussian, random as well as chaotic mutations. In addition, a generalized learning rule has also been proposed to ensure more thorough and explorative search. A theoretical analysis has been performed to establish the convergence of the learning rule. A theoretical study has also been performed in order to investigate the various aspects of the search strategy employed by the new tradeoff-based mutations. A more logical parameter tuning has been done by introducing the concept of orthogonal arrays in the EA experimentation. The use of noise-based tuning ensures the robust parameter tuning that enables the EAs to perform remarkably well in the further experimentations. The performance of the proposed EAs has been analyzed for different problems of varying complexities. The results prove the supremacy of the proposed EAs over other well-established strategies given in the literature.
Efficient Decoder for Perfect Space-Time Codes
Authors: Junfeng Hu, Hailin Zhang
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Perfect space-time block code (STBC) is one of the most excellent space-time codes (STC). An equivalent vertical Bell Laboratories layered space-time (V-BLAST) decoding model is proposed for perfect STBC decoding in this paper. Then, the decoder of minimum mean-square error decision feedback equalizer (MMSE-DFE) Fano-search (abbreviated as “MMSE-DFE-Fano”), which is regarded as one of the most efficient decoding schemes available for STC decoding, is simply modified by unbiased extending and by boundary controlling. Simulation results show that the modified decoder approaches maximum-likelihood (ML) decoding performance with considerably reduced complexity. Compared with “MMSE-DFE-Fano” decoder, the proposed decoder obtains about 2 dB gains with almost no complexity increase at a wide range of signal-to-noise ratio (SNR). In addition, the proposed decoder is robust to any antenna configurations and to arbitrary modulation constellations. With such efficient decoder, perfect STBC is a promising scheme for broadband data transmission over wireless channels.
On Formal Description of Synchronization Requirements in Multimedia Systems
Authors: A. C. M. Fong, Andrew Simpson
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper explores how formal description techniques can be applied to some common synchronization requirements found in multimedia systems. The aim is to provide a framework for precise descriptions and understanding of some of the timing issues found in multimedia systems. Ultimately, this should lead to improvements in system performance and reliability.
Adapting to Run-Time Changes in Policies Driving Autonomic Management
Authors: Raphael M. Bahati, Michael A. Bauer
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The use of policies within autonomic computing has received significant interest in the recent past. Policy-driven management offers significant benefit since it makes it more straight forward to define and modify systems behavior at run-time, through policy manipulation, rather than through re-engineering. In this paper, we present an adaptive policy-driven autonomic management system which makes use of reinforcement learning methodologies to determine how to best use a set of active policies to meet different performance objectives. The focus, in particular, is on strategies for adapting what has been learned for one set of policy actions to a "similar'' set of policies when run-time policy modifications occur. We illustrate the impact of the adaptation strategies on the behavior of a multi-component Web server.
Digital Synchronization Utilizing Harmonic Signal Generator for Capacitive Pressure Sensor Measurement
Authors: L. Fujcik, R. Vrba, L. Michaeli, J. Haze
Venue: Proceedings of the Third International Conference on Systems (2008)

The harmonic signal generator utilizing sigma-delta modulation for capacitive pressure sensor measurement was designed in AMIS CMOS 0.7 μm technology. Harmonic signal generator is a one of important parts of complex measurement system for capacitive pressure sensor measurement. Whole capacitive measurement system is based on bandpass (BP) Σ−Δ modulation. Phasing of harmonic signal and digital sampling signal is main requirement for proper function of capacitive pressure sensor measurement utilizing BP Σ−Δ modulator. Harmonic signal generator was designed using VHDL. Synthesis of digital synchronization utilizing harmonic signal generator was accomplished in Cadence BuildGates and implemented in Cadence Silicon Ensemble.
Letter to the Editor: On the global convergence of Chebyshev's iterative method
Authors: S. Amat, S. Busquier, J. M. Gutiérrez, M. A. Hernández
Venue: Journal of Computational and Applied Mathematics (2008)

In [A. Melman, Geometry and convergence of Euler's and Halley's methods, SIAM Rev. 39(4) (1997) 728-735] the geometry and global convergence of Euler's and Halley's methods was studied. Now we complete Melman's paper by considering other classical third-order method: Chebyshev's method. By using the geometric interpretation of this method a global convergence theorem is performed. A comparison of the different hypothesis of convergence is also presented.
A Framework of Machine Learning Based Intrusion Detection for Wireless Sensor Networks
Authors: Zhenwei Yu, Jeffrey J. P. Tsai
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Some security protocols or mechanisms have been designed for wireless sensor networks (WSNs). However, an intrusion detection system (IDS) should always be deployed on security critical applications to defense in depth. Due to the resource constraints, the intrusion detection system for traditional network cannot be used directly in WSNs. Several schemes have been proposed to detect intrusions in wireless sensor networks. But most of them aim on some specific attacks (e.g. selective forwarding) or attacks on particular layers, such as media access layer or routing layer. In this paper, we present a framework of machine learning based intrusion detection system for wireless sensor networks. Our system will not be limited on particular attacks, while machine learning algorithm helps to build detection model from training data automatically, which will save human labor from writing signature of attacks or specifying the normal behavior of a sensor node.
Local stereo matching with adaptive support-weight, rank transform and disparity calibration
Authors: Zheng Gu, Xianyu Su, Yuankun Liu, Qican Zhang
Venue: Pattern Recognition Letters (2008)

In this paper, a new window-based method for stereo matching is proposed. Differing with the existing local approaches, our algorithm divides the matching process into two steps, initial matching and disparity calibration. Initial disparity is first approximated by an adaptive support-weight and a rank transform method, and then a compact disparity calibration approach is designed to refine the initial disparity, so an accurate result can be acquired. The experimental results are evaluated on the Middlebury dataset, showing that our method is better than other local methods on standard stereo benchmarks.
Ecological optimization of pollution control equipment and planning from a simulation perspective
Authors: William Conley
Venue: International Journal of Systems Science (2008)

Once pollution control equipment is installed in a factory (or at another pollution source site) it needs to be adjusted for optimal performance. Typically trying to decide the optimal settings for several control knobs on the machine in question can give rise to a nonlinear multivariate optimization problem. It can be difficult to solve with theoretical techniques. Therefore, multi-stage Monte Carlo simulation is tried here on a hypothetical problem of this kind along with other pollution control problems. Additionally a discussion of the multi-stage simulation theory and other potential applications to pollution control from a management and planning perspective is presented. The multi stage Monte Carlo optimization theory is further demonstrated with some geometric and statistical illustrations. Also the generality of the multi stage approach to other areas of modeling and simulation is featured.
Potentials and Defiances of Mobile Devices and Wireless Networks
Authors: Jürgen Sieck
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

information systems developed at the author’s university. It examines key features of the systems, shows multiple ways of mobile content access and outlines future research potentials.
Instance-Based Ontology Mapping
Authors: Karin K. Breitman, Daniela Brauner, Marco Antonio Casanova, Ruy Milidiú, Alexandre Gazola, Marcelo Perazolo
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

We have explored the use of formal ontology and alignment techniques as a general approach to mediate and reconcile different representations. This approach proved to be very effective when fueled by ontologies rich in detail, (properties, restrictions, attributes and axioms that hold among classes), but performs poorly when available representations are incomplete or lacking, which is often the case in real life settings. In this paper we propose an enhancement to the original approach, based on a, instance-based matching technique.
Reenginering Clinical Research Teams: An Organizational Modeling Approach
Authors: Elias Cesar Araujo De Carvalho, Jatin Shah, Anand Shah, Aleksandro Montanha, Ricardo Pietrobon
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this study, simulation models were developed to explore the effects of decentralization and interdependence on individuals working in research groups. We conducted the study by simulating clinical health-services research with large repositories of data. First, we modeled the standard research process, which we called "centralized activity," in which a highly-paid researcher accomplishes all tasks. In our second model, which we called "distributed activity," tasks were performed in parallel by specialized technicians at lower wage scales. The results showed that centralized activity is slower (21.5 weeks vs. 17.7 weeks) and more expensive ($69,700 final cost vs. $34,600) than distributed activity, and places too great a load on the lone researcher. We concluded that while the distributed model may initially seem more complex, it results in shorter completion times and lower overall costs.
A New Road Network Model and Its Application in a Traffic Information System
Authors: Weifeng Lv, Wenjie Liao, Dongdong Wu, Jiong Xie
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The traditional road network used in the traffic information system consider little about the complicated structure of the road, and regard all roads as the same. However, in the Traffic Information System using the Floating Car Data (FCD), the GPS sampling rate is low, and it is probable to figure out the incorrect information from the map matching algorithm when the vehicle is in the intersection area. To solve this problem, this paper designs a new road network and a data structure for intersections to describe the complex road structure, and uses the road network in the map matching algorithm. At last, it presents the results of the experiment to indicate that it can improve the accuracy of information which the traffic information system provides to use this road network.
Hourglasses and Hamilton cycles in 4-connected claw-free graphs
Authors: Tomáš Kaiser, MingChu Li, Zdeněk Ryjáček, Liming Xiong
Venue: Journal of Graph Theory (2005)

We show that if G is a 4-connected claw-free graph in which every induced hourglass subgraph S contains two non-adjacent vertices with a common neighbor outside S, then G is hamiltonian. This extends the fact that 4-connected claw-free, hourglass-free graphs are hamiltonian, thus proving a broader special case of a conjecture by Matthews and Sumner. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 267&ndash;276, 2005
The Grid Workloads Archive
Authors: Alexandru Iosup, Hui Li, Mathieu Jan, Shanny Anoep, Catalin Dumitrescu, Lex Wolters, Dick H. J. Epema
Venue: Future Generation Computer Systems (2008)

While large grids are currently supporting the work of thousands of scientists, very little is known about their actual use. Due to strict organizational permissions, there are few or no traces of grid workloads available to the grid researcher and practitioner. To address this problem, in this work we present the Grid Workloads Archive (GWA), which is at the same time a workload data exchange and a meeting point for the grid community. We define the requirements for building a workload archive, and describe the approach taken to meet these requirements with the GWA. We introduce a format for sharing grid workload information, and tools associated with this format. Using these tools, we collect and analyze data from nine well-known grid environments, with a total content of more than 2000 users submitting more than 7 million jobs over a period of over 13 operational years, and with working environments spanning over 130 sites comprising 10000 resources. We show evidence that grid workloads are very different from those encountered in other large-scale environments, and in particular from the workloads of parallel production environments: they comprise almost exclusively single-node jobs, and jobs arrive in ''bags-of-tasks''. Finally, we present the immediate applications of the GWA and of its content in several critical grid research and practical areas: research in grid resource management, and grid design, operation, and maintenance.
Investigation into the Creation and Application of a Composite Application Software Development Process Framework (CASDPF)
Authors: Mohammed Al-Maharmeh, Bhuvan Unhelkar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents the arguments for Creation and Validation of a Composite Process Framework that would enable formal modeling and management of the Application Software Development & Integration (CASDPF). The arguments for this research are based on the practical understanding of the authors that no single ‘type’ of process appears to be suitable for software development projects. Increasingly, there appears to be a need to use high-ceremony ‘waterfall’ type approaches at the programme and project management level, whereas at individual level, ‘agile’ aspects of a process seem to help. The dichotomy between extensive modeling of the high-ceremony approach and the practically nil modeling of the low-ceremony ‘agile’ approach needs to be studied, understood and incorporated in a process. A composite process framework has the potential for accepting this responsibility of balancing the modeling with software projects, as is argued in this paper.
No better ways to generate hard NP instances than picking uniformly at random
Authors: R. Impagliazzo
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Distributed NP (DNP) problems are ones supplied with probability distributions of instances. It is shown that every DNP problem complete for P-time computable distributions is also complete for all distributions that can be sampled. This result makes the concept of average-case NP completeness robust and the question of the average-case complexity of complete DNP problems a natural alternative to P=?NP. Similar techniques yield a connection between cryptography and learning theory.
Mireval
Authors: William Ritchie, François-Xavier Théodule, Daniel Gautheret
Venue: Bioinformatics (2008)

Summary: We have developed an online tool called mirEval which can search sequences of up to 10 000 nt for novel microRNAs in multiple organisms. It is a comprehensive tool, easy to use and very informative. It will allow users with no prior knowledge of in-silico detection of microRNAs to take advantage of the most successful approaches to investigate sequences of interest. Availability: The mirEval web server is available at http://tagc.univ-mrs.fr/mireval Contact: W.Ritchie@centenary.org.au Supplementary information:Supplementary data are available at Bioinformatics online.
AN ACL FOR SPECIFYING FAULT-TOLERANT PROTOCOLS
Authors: Nicola Dragoni, Mauro Gaspari, Davide Guidi
Venue: Applied Artificial Intelligence (2007)

Agent communication languages (ACLs) should allow the developer to adopt human-like communication mechanisms in agent programming, facilitating the development of distributed protocols in multi-agent systems (MASs). However, to implement robust protocols, ACLs should provide a way to deal with the failures of agents, as MASs are prone to the same failures that can occur in any distributed software system. In this paper, we address this issue showing how an asynchronous ACL that provides high-level mechanisms to deal with crash failures of agents can be effectively used to specify fault tolerant protocols.
Security issues with the IP multimedia subsystem (IMS)
Authors: Michael T. Hunter, Russell J. Clark, Frank S. Park
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

The IP Multimedia Subsystem (IMS) is the basis for a significant new architecture for mobile applications incorporating voice, video and data services. The IMS is an overlay network on top of IP that uses SIP as the primary signaling mechanism. The IMS presents several new security challenges for both network providers and network users. This paper provides an overview of the IMS architecture and the security challenges that it raises. It is intended as the basis for developing a new set of research objectives around IMS security.
Combining document- and paragraph-based entity ranking
Authors: Henning Rode, Pavel Serdyukov, Djoerd Hiemstra
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We study entity ranking on the INEX entity track and propose a simple graph-based ranking approach that enables to combine scores on document and paragraph level. The combined approach improves the retrieval results not only on the INEX testset, but similarly on TREC's expert finding task.
A Concept of an Anonymous Direct P2P Distribution Overlay System
Authors: Igor Margasinski, Michal Pioro
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The paper introduces a peer-to-peer system called P2PRIV (peer-to-peer direct and anonymous distribution overlay). Basic novel features of P2PRIV are: (i) a peer-to-peer parallel content exchange architecture, and (ii) separation of the anonymization process from the transport function. These features allow a considerable saving of service time while preserving high degree of anonymity. In the paper we evaluate anonymity measures of P2PRIV (using a normalized entropy measurement model) as well as its traffic measures (including service time and network dynamics), and compare anonymity and traffic performance of P2PRIV with a well known system called CROWDS.