ppxscal/embedding_network huggingface dataset:
A Novel Group Management Protocol for IP Multicast (LW-IGMPv3)
Authors: Liu Jiwen, Wang Wendong, Gong Xiangyang, Liu Hui, Cao Wei, Gao Xuesong
Venue: International Journal of Distributed Sensor Networks (2009)

With the deployment of multicast service, people gradually find that hardly any practical application uses Exclude filter mode to block sources. For this reason it is generally unnecessary to support the filtering function to block sources. In addition, the newly proposed SSM service model has defined several modifications to IGMPv3; therefore certain modifications to IGMPv3 must be performed before it can be deployed in the SSM model. On the basis of the above analysis, LW-IGMPv3 is designed as a simplified version of IGMPv3 by Huawei Technology Co., which has been accepted by the IETF Mboned working group as a new draft. LW-IGMPv3 follows the query/response model adopted by all the previous IGMP versions. Therefore the network overhead of LW-IGMPv3 is basically the same with IGMPv3. The major difference between IGMP and LW-IGMPv3 is below. First, the reception state for each attached network maintained by the multicast router is simplified as: (multicast address, group timer, (source records)); second, most record types have the same operation rule in both ASM and Include state, and only the TO_IN record type need to vary its operation according to the value of its group timer; third, the forwarding suggestion rule no longer needs to take the filter mode into consideration. Functional research is performed, in which protocol states and message operation procedures are analyzed and compared to those of IGMPv3. A simulation is conducted with our developed C++ simulator to generate network traffic and LW-IGMPv3 and IGMPv3 protocols deployed on the open source router platform XORP in order to compare router performance of LW-IGMPv3 and IGMPv3. During the simulation, the performance, which was measured by CPU processing time and Memory occupancy, of the device running LW-IGMPv3 is improved substantially compared to the one running IGMPv3 and the value of all the parameters of both IGMP protocol and multicast routing protocol are the same. Also, a simulation environment is established and a series of test cases is designed to verify the compatibility of LW-IGMPv3. The result shows that LW-IGMPv3 is not only compatible with old versions of IGMP, but also shows great improvements in router performance and scalability.
Evaluation of Copyright Marking Systems
Authors: Fabien A. P. Petitcolas, Ross J. Anderson
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Hidden copyright marks have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia objects. Many systems have been proposed, but it is still difficult to have even a rough idea of their performances and hence to compare them. So we first describe some general attacks on audio and image marking systems. Then we propose a benchmark to compare image making software on a fair basis. This benchmark is based on a set of attacks that any system ought to survive.
Performance analysis of a hybrid system under quality impact of returns
Authors: Hülya Behret, Aybek Korugan
Venue: Computers and Industrial Engineering (2009)

In this paper we analyze a hybrid system that meets the demand with remanufactured or new products. In the remanufacturing stage there are uncertainties in the quality of remanufactured products, return rates and return times of returned products. These uncertainties affect raw material order quantities, processing times and material recovery rates. In the study returned products are classified by considering quality uncertainties. According to this classification remanufacturing processing times, material recovery rates, remanufacturing costs and disposal costs are determined. In order to analyze the effect of uncertainties in return quality a simulation model is constructed by using the ARENA simulation program. Our analysis denotes that under different cost scenarios quality based classification of returned products brings significant cost savings. The numerical analysis indicates that a cost improvement of more than 8% is achieved when return rates are high.
A New Artificial Intelligent Information Retrieval Methods
Authors: Xin-Hua Jiang, Yong-Min Liu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Recently we proposed intelligent information retrieval prototype system based on assigning context of documents. Our idea is that this system has better retrieval effectiveness than the traditional key-word systems. In this intelligent agent paradigm system, each document is assigned context based on the type of information. This paper offers a new methodology for assigning context of documents in a collection. This novel intelligent information retrieval system showed promising results.
Mobile cell load detection and prediction
Authors: Hvorenkov Vladimir Viktorovich, Vít Novotny, Bogatyreva Nadezda Nikolaevna
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

The paper deals with techniques how to predict a progress of the service request number of mobile subscribers in a cell. Three models of load shift are considered: constant, linear and square-law. Parameters of these courses are estimated and decision criteria are proposed. Probabilities of false decision of hypotheses and the miss of a situation are evaluated.
Whither sockets?
Authors: George V. Neville-Neil
Venue: Communications of the ACM (2009)

High bandwidth, low latency, and multihoming challenge the sockets API.
Offline commissioning of a PLC-based control system using ARENA
Authors: Jeffery S. Smith, Younchol Cho
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, we address a generalized method of mapping a control system simulation model to the PLC emulator being tested using model variables and PLC tags under the offline commissioning environment. For this research we created an example system similar to a high speed packaging system described in a previous WSC paper. Implementation experience using Rockwell Software applications is provided.
Personalized Recommendation Algorithm Using User Demography Information
Authors: Yae Dai, HongWu Ye, SongJie Gong
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Personalized recommendation systems are web-based systems that aim at predicting a user’s interest on available products and services by relying on previously rated items and dealing with the problem of information and product overload. User demography information associated with a user’s personality is rarely considered in the personalization process, especially in the collaborative filtering (CF) which is the very important technology in the recommendation systems. In this paper, a new collaborative filtering personalized recommendation algorithm is proposed which applies the user demography information. This method combines the rating similarity and the user demography similarity in the recommendation process to improve the prediction accuracy by efficiently managing the problem of data sparsity. The experiments suggest that collaborative filtering based on combining similarity provide better recommendation quality than collaborative filtering based on only rating similarity dramatically.
The rise of middle and upper middle class in emerging markets: product and service opportunities
Authors: Daria Loi, Sasanka Prabhala
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

The middle and upper middle class population in the often termed emerging markets is typically a less investigated target as most consumer research and development efforts for such markets are primarily focused on rural communities as well as the lower to middle class population. We believe that, in a context where emerging markets are in constant transformation and the middle to upper middle classes are on a substantial growth path, it is important to explore appropriate ways to address these market segments as they represent an opportunity space for technological research and development. This paper discusses and shares results of a recent case study where a number of concepts and products were developed for such market segments in emerging markets and subsequently tested in China, Egypt, India and Brazil.
Fractal magnetic dynamics around a Koch fractal electric circuit
Authors: Constantin Udriste, Cristian Ghiu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This is the first paper who presents original functional equations regarding the prefractal or fractal magnetic dynamics around a prefractal respectively fractal electric circuit of Koch type. These equations reflects a tensorial invariance with respect four geometric transformations. The main results refer to: (1) recurrence formulas for the prefractal magnetic fields and prefractal magnetic vector potentials; (2) the fractal magnetic field and the fractal magnetic vector potential obtained as fractal limits. Maple simulations regarding the field lines and constant level sets of magnetic energy are now in our attention. Due to the novelties, we develope a systematic language with words and sentences and grammar.
Analysis and Approximation of Statistical Distribution of Eigenvalues in i.i.d. MIMO Channels under Rayleigh Fading
Authors: Tetsuki Taniguchi, Shen Sha, Yoshio Karasawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In multiple input multiple output (MIMO) communication systems, eigenvalues of channel correlation matrices play an essential role for the performance analysis, and particularly the investigation about their behavior under time-variant environment ruled by a certain statistics is an important problem. This paper first gives the theoretical expressions for the marginal distributions of all the ordered eigenvalues of MIMO correlation matrices under i.i.d. (independent and identically distributed) Rayleigh fading environment. Then, an approximation method of those marginal distributions is presented: We show that the theory of SIMO space diversity using maximal ratio combining (MRC) is applicable to the approximation of statistical distributions of all eigenvalues in MIMO systems with the same number of diversity branches. The derived approximation has a monomial form suitable for the calculation of various performance measures utilized in MIMO systems. Through computer simulations, the effectiveness of the proposed method is demonstrated.
Developing a model of robot behavior to identify and appropriately respond to implicit attention-shifting
Authors: Fumitaka Yamaoka, Takayuki Kanda, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

In this paper, we present our current research on developing a model of robot behavior that leads to feelings of being together using the robot's body position and orientation. Creating feelings of"being together"will be an essential skill for robots that live with humans and adapt to daily human activities such as walking together or establishing joint attention to information in the environment. We observe people's proxemic behavior in joint attention situations and develop a model of behavior for robots to detect a partner's attention shift and appropriately adjust its body position and orientation in establishing joint attention with the partner. We experimentally evaluate the effectiveness of our model, and our results demonstrate the model's effectiveness.
Colinear Coloring on Graphs
Authors: Kyriaki Ioannidou, Stavros D. Nikolopoulos
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology, and the framework through which it was studied, we introduce the colinear coloring on graphs. We provide an upper bound for the chromatic number &chi;(G), for any graph G, and show that G can be colinearly colored in polynomial time by proposing a simple algorithm. The colinear coloring of a graph G is a vertex coloring such that two vertices can be assigned the same color, if their corresponding clique sets are associated by the set inclusion relation (a clique set of a vertex u is the set of all maximal cliques containing u); the colinear chromatic number &lambda;(G) of G is the least integer k for which G admits a colinear coloring with k colors. Based on the colinear coloring, we define the &chi;-colinear and &alpha;-colinear properties and characterize known graph classes in terms of these properties.
Research on Green Effect of Eco-industrial Parks and its Formation Mechanism of Strategic Alliances' Stability
Authors: Li Yang, Malin Song
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Green effect is a phenomenon by which manufacturers apply themselves to environmental protection to obtain comparative advantages compared to their counterparts. Modern enterprises can form profitable green effect by greening of infrastructures, brands, marketing and culture, which contribute its development trend. Manufacturers of eco-industrial parks should be in line with the government to strengthen propaganda about environmental protection, to advocate green and civilized consumption and to enhance the proportion of environmentalists in consumers; to increase their own propaganda; national authorities should also set up and implement green label system to allow manufacturers of eco-industrial parks use these labels in their own products to facilitate the effective recognition of consumers. It is an effective way to access to their green effect and to achieve stability after the formation of green union by making green alliance parties gain the largest rents from the alliances which they are all likely to participate in.
Separating application and security concerns in use case models
Authors: Hassan Gomaa, Michael E. Shin
Venue: Proceedings of the 15th workshop on Early aspects (2009)

This paper describes an approach to model complex applications by modeling application requirements separately from security requirements in use case models. By careful separation of concerns, the security requirements are captured in security use cases separately from the application requirements, which are captured in application use cases. The approach reduces system complexity caused by mixing security requirements with business application requirements with the goal of making complex systems more maintainable. Furthermore, the security use cases can be reused by other software applications. This paper describes how the application and security concerns are modeled separately, and how they can be woven together into an application.
Drill wear prediction using different neural network architectures
Authors: Sudhanshu S. Panda, Debabrata Chakraborty, Surjya K. Pal
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

In the present work, an attempt has been made to use different artificial neural network (ANN) architectures to achieve more accurate prediction of drill wear. Large numbers of drilling operations, using mild steel as the work-piece and high speed steel (HSS) as the drill, have been performed and drill flank wear has been measured intermittently. Experimental results show a strong dependency of direct and indirect process parameters with drill wear. Experimentally obtained data have been used to train different ANN architectures using different combinations of important process parameters as input and measured flank wear as the output of the network. Relative performances of different ANN based drill wear prediction schemes in regard to prediction of drill wear have been compared. From the present work it has been observed that inclusions of more sensor signals as input to the network results a better-trained network, which can predict wear more accurately. It has also been observed from the present work that standard back propagation neural network (BPNN) predicts wear more accurately compared to fuzzy back propagation network (FBPN) and self-organizing method (SOM), through BPNN is slow in convergence.
Measurement of Underlying Cooperation in Multiagent Reinforcement Learning
Authors: Sachiyo Arai, Yoshihisa Ishigaki, Hironori Hirata
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Although a large number of algorithms have been proposed for generating cooperative behaviors, the question of how to evaluate mutual benefit among them is still open. This study provides a measure for cooperation degree among the reinforcement learning agents. By means of our proposed measure, that is based on information theory, the degree of interaction among agents can be evaluated from the viewpoint of information sharing. Here, we show the availability of this measure through some experiments on "pursuit game", and evaluate the degree of cooperation among hunters and prey.
Adding Expressiveness to Musical Messages
Authors: Sergio Canazza, Giovanni de Poli, Antonio Roda, Alvise Vidolin
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A system to add expressiveness to musical messages has been developed, starting from the results of acoustic and perceptual analyses. The system allows to obtain different performances, by modifying the acoustic parameters of a given neutral performance. The modification of the input performance is performed by a model that use the hierarchical segmentation of the musical organization. For every hierarchical level, opportune curves are applied to the principal acoustic parameters. Level's self-similarity is the main criteria to construct the curves. The modular structure of the system defines an open architecture, where the rendering steps can be realized both with synthesis and post-processing techniques. Different synthesis techniques, like FM, physical models or wavetable have been explored.
Approximation algorithms and hardness results for the clique packing problem
Authors: F. Chataigner, G. Manić, Y. Wakabayashi, R. Yuster
Venue: Discrete Applied Mathematics (2009)

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F={K"2}. In this paper we provide new approximation algorithms and hardness results for the K"r-packing problem where K"r={K"2,K"3,...,K"r}. We show that already for r=3 the K"r-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r=3,4,5 we obtain better approximations. For r=3 we obtain a simple3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r=4, we obtain a (3/2+@e)-approximation, and for r=5 we obtain a (25/14+@e)-approximation.
Can Geotags Help Image Recognition?
Authors: Keita Yaegashi, Keiji Yanai
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we propose to exploit geotags as additional information for visual recognition of consumer photos to improve its performance. Geotags, which represent places where the photos were taken, for photos can be obtained automatically by carrying a portable small GPS device with digital cameras. Geotags have potential to improve performance of visual image recognition, since recognition targets are unevenly distributed. For example, "beach" photos can be taken near the sea and "lion" photos can be taken only in a zoo except Africa.To integrate geotag information into visual image recognition, we adopt two types of geographical information, raw values of latitude and longitude, and visual feature of aerial photos around the location the geotag represents. As classifiers, we use both a discriminative method and a generative method in the experiments.The objective of this paper is to examine if geotags can help category-level image recognition. Note that we define an image recognition problem as deciding if an image is associated with a certain given concept such as "mountain" and "beach" in this paper. We propose a novel method to carry out geotagged image recognition in this paper. The experimental results demonstrate effectiveness of usage of geographical information for recognition of consumer photos.
Self-affine Fractals Generated by Nonlinear Systems
Authors: Ljubiša Kocić, Sonja Gegovska-Zajkova, Elena Babače
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A system of ODE's with nonlinear terms exhibits a nonlinear dynamic behavior. Under some conditions these terms can be locally approximated by linear factors, which can be, after discretization transformed in the sequence of (hyperbolic) Iterated Function Systems (IFS) that generates a unique fractal attractor. This attractor reflects the dynamics in the vicinity of the approximated point of the nonlinear system. Here, the IFS is replaced with an associate AIFS (Affine invariant IFS), a kind of IFS that has affine invariance property and permits further manipulating of this fractal attractor.
E-Means: An Evolutionary Clustering Algorithm
Authors: Wei Lu, Hengjian Tong, Issa Traore
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In this paper we propose a new evolutionary clustering algorithm named E-means. E-means is an Evolutionary extension of k-means algorithm that is composed by a revised k-means algorithm and an evolutionary approach to Gaussian mixture model, which estimates automatically the number of clusters and the optimal mean for each cluster. More specifically, the proposed E-means algorithm defines an entropy-based fitness function, and three genetic operators for merging, mutation, and deletion components. We conduct two sets of experiments using a synthetic dataset and an existing benchmark to validate the proposed E-means algorithm. The results obtained in the first experiment show that the algorithm can estimate exactly the optimal number of clusters for a set of data. In the second experiment, we compute nine major clustering validity indices and compare the corresponding results with those obtained using four established clustering techniques, and found that our E-means algorithm achieves better clustering structures.
Fast uncontrolled handover scheme for WiMAX infrastructure networks
Authors: Po-Wen Chi, Ching-Lun Lin, Wei-Chih Lin
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

WiMAX is a wireless WAN technology with high data transmission rate and is a candidate for the 4G network trying to provide users with mobile service. In order to alleviate frame loss during handover, WiMAX provides the Uncontrolled Handover for this potential problem. However, there are too many control messages in the Uncontrolled Handover, so a Customer Premise Equipment (CPE) may easily timeout and fails to finish the handover procedure. In this paper, we provide a fast Uncontrolled Handover scheme that can decrease handover messages and accelerate handover procedure.