ppxscal/embedding_network huggingface dataset:
An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
Authors: A. Mohammed, M. Ould-Khaoua, L. M. Mackenzie, J. Abdulai
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Broadcasting is a fundamental and frequently usedoperation in mobile ad hoc networks (MANETs) wherea source node diffuses a message to all other nodes inthe networks. Flooding, the process in which eachnode retransmits every uniquely received packetexactly once is the simplest and most commonly usedmechanism for broadcasting in MANETs. Despite itssimplicity, it can result in high redundantretransmission, contention and collision, aphenomenon collectively referred to as the broadcaststorm problem, which can greatly increase thenetwork communication overhead. This paperproposes an adjusted counter-based scheme whichcombines the advantages of probability and counterbasedapproaches to mitigate this inherent problem.The scheme is simple, efficient and uses tworebroadcast probabilities to differentiate betweenmobile nodes in sparse and dense area as againstdropping the rebroadcast packet when a node is indense area. We evaluate the performance of ourscheme by comparing it against flooding, fixedprobability and counter-based schemes. Simulationresults reveal that our scheme achieves betterperformance in terms of saved rebroadcast, end-toenddelay and without sacrificing reachability.
Building computational institutions for agents with RoleX
Authors: Giacomo Cabri, Luca Ferrari, Rossella Rubino
Venue: Artificial Intelligence and Law (2008)

While the sociality of software agents drives toward the definition of institutions for multi agent systems, their autonomy requires that such institutions are ruled by appropriate norm mechanisms. Computational institutions represent useful abstractions. In this paper we show how computational institutions can be built on top of the RoleX infrastructure, a role-based system with interesting features for our aim. We achieve a twofold goal: on the one hand, we give concreteness to the institution abstractions; on the other hand, we demonstrate the flexibility of the RoleX infrastructure.
Graphs, polymorphisms and the complexity of homomorphism problems
Authors: Libor Barto, Marcin Kozik, Todd Niven
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We use a connection between polymorphisms and the structure of smooth digraphs to prove the conjecture of Bang-Jensen and Hell from 1990 and, as a consequence, a conjecture of Bang-Jensen, Hell and MacGillivray from 1995. The conjectured characterization of computationally complex coloring problems for smooth digraphs is proved using tools of universal algebra. We cite further graph results obtained using this new approach. The proofs are based in an universal algebraic framework developed for the Constraint Satisfaction Problem and the CSP dichotomy conjecture of Feder and Vardi in particular.
Determining Photosynthesis Rate Constants in Lake Harapan Penang
Authors: Teh Su Yean, Koh Hock Lye, Ahmad Izani Md Ismail, Mashhor Mansor
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Lake Harapan was created in 1990 to serve as a runoff detention pond in Universiti Sains Malaysia USM. The lake is eutrophic with occasional high levels of 300 ug/l chl a, with dissolved oxygen reaching 12 - 16 mg/l in the late afternoon and near anaerobic condition in late night. A decision was arrived at by USM to rehabilitate Lake Harapan recently, based upon previous model study completed in early 2005 by the authors. Model analysis indicates that USM campus contributes around 23 kg per day of BOD. Process rates have been estimated as follows: reaeration rate is 1.0 - 1.6 per day, respiration rate is 3.4 - 5.6 mg/l/day, and photosynthesis rate is 37.7 - 51.6 mg/l/day. This paper presents a summary of this modeling analysis, including a new reliable method to estimate reaeration rate. These process rates will be used to formulate a model to assist the rehabilitation.
A multi-objective approach to RBF network learning
Authors: Illya Kokshenev, Antonio Padua Braga
Venue: Neurocomputing (2008)

The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) complexity measure for RBF networks is considered. For the specific case of RBF network, bounds on the complexity measure are formally described. As the synthetic and real-world data experiments show, the proposed MOBJ learning method is capable of efficient generalization control along with network size reduction.
Methods for extracting and classifying pairs of cognates and false friends
Authors: Ruslan Mitkov, Viktor Pekar, Dimitar Blagoev, Andrea Mulloni
Venue: Machine Translation (2007)

The identification of cognates has attracted the attention of researchers working in the area of Natural Language Processing, but the identification of false friends is still an under-researched area. This paper proposes novel methods for the automatic identification of both cognates and false friends from comparable bilingual corpora. The methods are not dependent on the existence of parallel texts, and make use of only monolingual corpora and a bilingual dictionary necessary for the mapping of co-occurrence data across languages. In addition, the methods do not require that the newly discovered cognates or false friends are present in the dictionary and hence are capable of operating on out-of-vocabulary expressions. These methods are evaluated on English, French, German and Spanish corpora in order to identify English---French, English---German, English---Spanish and French---Spanish pairs of cognates or false friends. The experiments were performed in two settings: (i) assuming `ideal' extraction of cognates and false friends from plain-text corpora, i.e. when the evaluation data contains only cognates and false friends, and (ii) a real-world extraction scenario where cognates and false friends have to first be identified among words found in two comparable corpora in different languages. The evaluation results show that the developed methods identify cognates and false friends with very satisfactory results for both recall and precision, with methods that incorporate background semantic knowledge, in addition to co-occurrence data obtained from the corpora, delivering the best results.
Bin packing with controllable item sizes
Authors: José R. Correa, Leah Epstein
Venue: Information and Computation (2008)

We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an allowed size for this item, together with a nonnegative penalty, and an item can be packed using any configuration in its list. The goal is to select a configuration for each item so that the number of unit bins needed to pack the sizes plus the sum of penalties is minimized. This problem has applications in operating systems, bandwidth allocation, and discrete time-cost tradeoff planning problems. For the offline version of the problem we design an augmented asymptotic PTAS. That is, an asymptotic approximation scheme that uses bins of size slightly larger than 1. We further consider the online bounded space variant, where only a constant number of bins can be open simultaneously. We design a sequence of algorithms, where the sequence of their competitive ratios tends to the best possible asymptotic competitive ratio. Finally, we study the bin covering problem, in which a bin is covered if the sum of sizes allocated to it is at least 1. In this setting, penalties are interpreted as profits and the goal is to maximize the sum of profits plus the number of covered bins. We design an algorithm of best possible competitive ratio, which is 2. We generalize our results for online algorithms and unit sized bins to the case of variable sized bins, where there may be several distinct sizes of bins available for packing or covering, and get that the competitive ratios are again the same as for the more standard online problems.
A neural adaptive feedback linearization control for CSTR, using NARMA-L2 model
Authors: Farzad Hourfar, Karim Salahshoor, Alireza Paivar
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this paper we present a method for adaptive feedback linearization contorl of CSTR. Because of the nature of CSTR, the parameters of the system, like feed flowrate, feed temperature, concentration of components in the feed and inlet temperature of coolant, may change with time. So for detecting these changes, online system identification is performed and the NARMA-L2 model of the plant is updated in each sampling time. Experimental results demonstrate quick learning, excellent closed-loop performance, and robustness of the adaptive neurocontroller.
The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster)
Authors: Mark Moir, Kevin Moore, Dan Nussbaum
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Sun has recently announced that its forthcoming multicore processor, code-named Rock, will support a form of hardware transactional memory (HTM). Our poster describes this feature, and presents the Adaptive Transactional Memory Test Platform (ATMTP)---a simulator we have developed that allows us and others to experiment with code that uses it, as well as the results of some preliminary experiments conducted using ATMTP.
DaCAP - A Distributed Anti-Cheating Peer to Peer Architecture for Massive Multiplayer On-line Role Playing Game
Authors: Huey-Ing Liu, Yun-Ting Lo
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

MMOG is one of the most popular amusements for people today and MMORPG is the hottest of all types of MMOGs. Due to the massive number of players, huge server load and player cheating are the two major problems of MMOGs. This paper studies the load and cheating issues of MMORPGs. Hybrid architecture by combining P2P architecture and client/server architecture is proposed for MMORPGs to reduce server load and improve scalability and flexibility. A fully distributed anti-cheating mechanism with players reciprocally monitoring is also designed in this paper. Analytical and simulation results demonstrate that the proposed architecture significantly reduces server load, increase system scalability, and efficiently detects cheating.
Top-down lower bounds for depth 3 circuits
Authors: J. Hastad
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We present a top-down lower bound method for depth 3 AND-OR-NOT circuits which is simpler than the previous methods and in some cases gives better lower bounds. In particular we prove that depth 3 AND-OR-NOT circuits that compute PARITY resp. MAJORITY require size at least 2/sup 0.618/ .../spl radic/n/ resp. 2/sup 0.849/.../spl radic/n/. This is the first simple proof of a strong lower bound by a top-down argument for non-monotone circuits.
A SIMPLE TIME VARIANT METHOD FOR FUZZY TIME SERIES FORECASTING
Authors: Shiva Raj Singh
Venue: Cybernetics and Systems (2007)

Forecasting using fuzzy time series models needs computations of fuzzy relations in adjacent observations of time series data. In view of getting better forecasted values, these fuzzy relations have been considered as time invariant and time variant, and have been computed in several ways. However, the complication lies with the various rules developed for obtaining these fuzzy relations and then the defuzzification process. In this article, we propose a simple time variant method for time series forecasting. It uses the difference operator and the values obtained have been used for developing fuzzy rules for forecast. We develop algorithms to forecast enrollments of the University of Alabama and compared them with existing methods. The method has been also implemented to forecast rice production of Pantnagar (farm), India. The computational algorithms of the proposed method are simple and provide higher accuracy in forecasting.
Onspect: ontology based aspects
Authors: Parisa Rashidi, Roger T. Alexander
Venue: Proceedings of the 7th workshop on Foundations of aspect-oriented languages (2008)

In software engineering community, semantic interoperability usually has been ignored despite its significant importance. To achieve semantic level interoperability, ontology as a powerful means of expressing and sharing knowledge can be used to add meaningful standard semantics to syntactic annotations. In this paper we describe semantic pointcuts based on ontology modeling. Current AOP models, like many other programming models, primarily rely on a syntactic representation and mostly ignore pointcut expression at semantic level. We present a pointcut modeling approach based on semantics instead of underlying program's syntax, by using ontology modeling to conceptually modularize crosscutting concerns.
Multistream Compression
Authors: Jirí Kochánek, Jan Lánský, Petr Uzel, Michal emlicka
Venue: Proceedings of the Data Compression Conference (2008)

We present a data transformation and compression method based on decomposition of input stream into multiple streams of counters of passes through individual nodes of the tree. The streams are coded separately - using methods that can compress them best. The use of multiple streams has given the method its name: multistream compression (MC). The method differs from other models based on splitting data into different streams by the fact that in this case the streams do not contain symbols, but counters.
Mechanics of the normal woman's breast
Authors: Amit Gefen, Benny Dilmoney
Venue: Technology and Health Care (2007)

Knowledge on the forces acting on a woman's breast and on the mechanical properties of the breast tissues is important for studying the effects of plastic surgery techniques for breast reconstruction as well as for the design of cosmetic breast implants. Surprisingly, there are no data in the literature regarding mechanical loads on the breast tissues during daily or sport activities, and there are no coherent sources of data in regard to mechanical properties of the breast tissues. Accordingly, this paper is aimed at reviewing the mechanics of the normal breast. First, the anatomy of the breast and major aging-related changes are described. Second, the mechanical characteristics of all tissue components of the breast are detailed. Last, analytical approximations are made in regard to the forces acting on the breast during normal activity, and the respective internal breast forces supported by the suspensory ligaments, pectoralis fascia and ribs are calculated. The data presented in this paper are useful for biomechanical modeling of the breast as well as for evaluating the loads acting on surgical repairs and breast implants.
eMuse: QoS Guarantees for Shared Storage Servers
Authors: Dan Feng, Chengtao Lu, Fang Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Storage consolidation as a perspective paradigm inevitably leads to the extensive installations of shared storage servers in product environments. However, owing to the dynamics of both workloads and storage systems, it is pragmatic only if each workload accessing common storage servers can surely possess a specified minimum share of system resources even when competing with other workloads and consequently obtain predictable quality of service(QoS). This paper presents an I/O scheduling framework for shared storage servers. The eMuse algorithm in the framework employs a dynamic assignment mechanism that not only accommodates a weighted bandwidth share for every active workload, but also fulfills their latency requirements through a fair queuing policy. Experimental results demonstrate that our scheduling framework can accomplish performance isolation among multiple competing workloads as well as the effective utilization of system resources.
Safety of component-based systems: analysis and improvement using Fujaba4Eclipse
Authors: Matthias Tichy, Stefan Henkler, Matthias Meyer, Markus von Detten
Venue: Companion of the 30th international conference on Software engineering (2008)

Todays embedded and safety-critical systems incorporate increasing amounts of software. Consequently, the software architecture and its connection to hardware elements have a big impact on the safety of those systems. We present in this paper an approach and its implementation in the Fujaba4Eclipse environment for the analysis and improvement of component-based systems w.r.t. their safety which specifically exploits the software and system structure.
Developing a model of technology behavior intension on strategic web resource
Authors: Hsieh-Hua Yang, Jui-Chen Yu, Hung-Jen Yang, Hsiao-Chih Lin
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The purpose of this study was to develop senior high school students' awareness of Technology strategic usefulness of Web-search. Nonequivalent pretest-posttest control group design was applied in the study. The research samples were one hundred and eleven students, with fifty-five of them as the experiment groups, and the other fifty-six as the other as control groups. Experiment groups accepted the teaching of "Technology Strategic Usefulness, TSU" material. On the other hand, the researcher just taught students in control groups ordinary uses of Web-search. After the experimental teaching, students took Web-search Logic Achievement Test and Technology strategic usefulness of Web-search Scale. Based upon the research findings, a model of technology behavior intension on strategic web resource was concluded.
Predicates for line transversals to lines and line segments in three-dimensional space
Authors: Olivier Devillers, Marc Glisse, Sylvain Lazard
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

When an observer is in a 3D scene, a topological change in the view arises when the line of sight is tangent to four objects. If we consider polyhedral scenes, the relevant lines of sight are transversals to some edges of the polyhedra. In this paper we investigate predicates about visibility events arising in this context. Namely, we consider the predicates for counting the number of line transversals to lines and segments in 3D and the predicate for determining whether a line of sight is intersected by a triangle. We also consider a predicate that order these visibility events in the rotating plane-sweep algorithm of Brönnimann et al. (2007) We present a new approach for solving these predicates and show that the degree of the resulting procedures are significantly smaller than the naive approach based on Plücker coordinates. All the degrees are considered here in the Cartesian coordinates of the points defining the lines and segments. In particular, we present a procedure of degree 12 (resp. 15) for determining the number of transversals to four (resp. five or more) segments. We present procedures of degree 15 for the occlusion predicate and of degree 36 for the ordering predicate. In comparison, the degree of the standard procedure based on the Plücker coordinates for solving these predicates range from 36 to 168 [Everett et al. 2006].
Near Optimal Broadcasting in Optimal Triple Loop Graphs
Authors: Hovhannes A. Harutyunyan, Edward Maraachlian
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Triple loop networks (graphs) are generalizations of the ring topology where every vertex v is linked to 6 vertices v ± a, v ± b, v ± c. In this paper, we study the broadcast problem in optimal triple loop graphs. In 1987 for a restricted case a = -(b + c) the (maximum) number of vertices in the sub-optimal Triple loop graph has been proved to be aquadratic function of diameter d. In 1998 the broadcast time of this graph is proved to be d + 3. Recently, in 2003 the Optimal Triple Loop Graph in general was constructed, where its number of vertices is a cubic function of d. In this paper we prove d + 2 lower bound and d + 5 upper bound for broadcasting in general Optimal Triple Loop Graph. We also generalize our upper bound algorithm in Multiple Loop Graphs giving d + 2k - 1 general upper bound where the degree of every vertex is 2k.
A Performance-Effective and High-Scalable Grid File System
Authors: Chin-Chen Chu, Ching-Hsien Hsu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

A high-performance file system is normally a key point for large cluster installations, where hundreds or even thousands of nodes frequently need to manage large volumes of data. Distributed Storage Resource Broker (SRB) Server architecture is designed for facilitating reliable file sharing and high-performance distributed and parallel data computing in a Grid across administrative domains by providing a global virtual file system. SRBFS is an attempt to implement a global virtual file system that supports a complete set of standard POSIX APIs, while still retaining the parallel and distributed data computing feature of distributed SRBFS Server architectureIn this paper we investigate the possibilities of a distributed model for the SRB server which is based on SDSC SRB client-server middleware. A prototype has been built upon the user-level SRBFS and a performance evaluation is carried out. We present a comparison of wide-area file transfer performance of the SRBFS and SEMPLAR which is SRB enabled MPI-IO library for access to remote storage. On the NCHC cluster, the ROMIO Perf benchmark attained an aggregate write bandwidth of 225 MBbps with 12 clients. The benchmark results are encouraging and show that distributed SRB Server provides applications with scalable, high-bandwidth I/O across wide area networks
An approach for continuous inspection of source code
Authors: Christian R. Prause, Stefan Apelt
Venue: Proceedings of the 6th international workshop on Software quality (2008)

With multiple developers engaged in collaboratively writing software code, responsibility for a specific piece of code is difficult to assign. Nonetheless, responsibility is a major factor in achieving quality and preventing code from being developed carelessly. We present a new approach for statistically acquiring per developer per document accountabilities and enable learning and self-monitoring processes within a development team while maintaining anonymity to a certain degree in order to not endanger team spirit.
Stories in GeoTime
Authors: Ryan Eccles, Thomas Kapler, Robert Harper, William Wright
Venue: Information Visualization (2008)

A story is a powerful abstraction used by intelligence analysts to conceptualize threats and understand patterns as part of the analytical process. This paper demonstrates a system that detects geo-temporal patterns and integrates story narration to increase analytic sense-making cohesion in GeoTime. The GeoTime geo-temporal event visualization tool was augmented with a story system that uses narratives, hypertext-linked visualizations, visual annotations, and pattern detection to create an environment for analytic exploration and communication, thereby assisting the analyst in identifying, extracting, arranging, and presenting stories within the data. The story system lets analysts operate at the story level with higher level abstractions of data, such as behaviors and events, while staying connected to the evidence. The story system was developed in collaboration with analysts. A formal evaluation was completed that showed high utility and usability.