ppxscal/embedding_network huggingface dataset:
Scenario based distributed manufacturing simulation using HLA technologies
Authors: Özer Uygun, Ercan Öztemel, Cemalettin Kubat
Venue: Information Sciences: an International Journal (2009)

Simulating complex and distributed manufacturing systems is not easy using traditional simulation techniques. Manufacturing environment contains several systems that must interoperate and exchange information. A general software architecture is necessary to make manufacturing systems interrelated. This paper presents an overview of distributed manufacturing simulation as well as of information representation in distributed manufacturing simulation using high level architecture (HLA) and its object model template (OMT). The concept is explained with a scenario which is provided to better address the object class structure, interaction class structure, attribute, parameter and data type tables.
Use of biased neighborhood structures in multiobjective memetic algorithms
Authors: Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, we examine the use of biased neighborhood structures for local search in multiobjective memetic algorithms. Under a biased neighborhood structure, each neighbor of the current solution has a different probability to be sampled in local search. In standard local search, all neighbors of the current solution usually have the same probability because they are randomly sampled. On the other hand, we assign larger probabilities to more promising neighbors in order to improve the search ability of multiobjective memetic algorithms. In this paper, we first explain our multiobjective memetic algorithm, which is a simple hybrid algorithm of NSGA-II and local search. Then we explain its variants with biased neighborhood structures for multiobjective 0/1 knapsack and flowshop scheduling problems. Finally we examine the performance of each variant through computational experiments. Experimental results show that the use of biased neighborhood structures clearly improves the performance of our multiobjective memetic algorithm.
A routing approach to reduce glitches in low power FPGAs
Authors: Quang Dinh, Deming Chen, Martin D.F. Wong
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Glitches (spurious transitions) are common in electronic circuits. In this paper we present a novel approach to reduce dynamic power in FPGAs by reducing glitches during the routing step. This approach involves finding alternative routes for early-arriving signals, so that signal arrival times at LUTs are aligned and no glitches are generated. This approach does not require additional circuitry to balance signals as done in previous work, but uses the available programmable routing resources instead. We develop an efficient algorithm to find routes with target delays. Based on this algorithm, we then build a glitch-aware router, named GlitchReroute, aiming at reducing dynamic power. To the best of our knowledge, this is the first glitch-aware routing algorithm for FPGAs. Experiments show that an average of 23% reduction in glitch power is achieved, which translates into a 9.8% reduction in dynamic power, compared to the glitch-unaware VPR router.
Towards a covered and connected body sensor network for healthcare applications
Authors: Nibedita Das, Sudheendra Murthy, Arunabha Sen
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Radio transmitters of an implanted sensor circuitry during their operation dissipate energy which results in rise in temperature of its surroundings. The human body can tolerate such increase in temperature only up to a certain threshold value beyond which serious injury may result. To prevent this sensors must be implanted in a way that ensures the surrounding area temperature to remain within the threshold. Using a thermal model for heat distribution from multiple heat sources (radio transmitters), we observed that if the implanted sensor nodes are placed sufficiently apart from each other, then the temperature of the surrounding area does not exceed the threshold. This minimum separation distance constraint gives rise to a new variation of the sensor network connected coverage problem that has not been studied earlier.
Implementation and analysis of network-based mobility management protocol in WLAN environments
Authors: Jianfeng Guan, HuaChun Zhou, Weisi Xiao, Zhiwei Yan, Yajuan Qin, Hongke Zhang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Mobile IPv6 (MIPv6) has been approved by the IETF as the standardized solution for mobility management in IPv6 network. MIPv6 is a host-based mobility support specification, and it can provide the global mobility support for mobile terminal. However, MIPv6 handover procedure results in a long handover delay. To improve the handover performance, some MIPv6 variants such as Fast Handover for MIPv6 (FMIPv6) and Hierarchical MIPv6 (HMIPv6) were proposed. However, they all require the mobile terminal to support the mobility management protocols. Recently, the Proxy Mobile IPv6 (PMIPv6) was proposed in IETF NETLMM workgroup, which is a network-based localized mobility management and it can provide the mobility support for mobile node without an involvement in the mobility signaling. The previous work about the performance evaluation of PMIPv6 is mainly based on the analysis and lacks of evaluation in a real system. So, in this paper, we study the PMIPv6 and implement it in the WLAN environments. We set up a test-bed to evaluate its performance and compare it with the other mobility specifications including the MIPv6, FMIPv6 and HMIPv6. The results show that the PMIPv6 can improve the handover performance under low-delay networks, as for the wide are networks, it needs to introduce some mechanism like fast handover needs to further improve its performance.
The Balanced Edge Cover Problem
Authors: Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

For an undirected graph G = (V, E), an edge cover is defined as a set of edges that covers all vertices of V. It is known that a minimum edge cover can be found in polynomial time and forms a collection of star graphs. In this paper, we consider the problem of finding a balanced edge cover where the degrees of star center vertices are balanced, which can be applied to optimize sensor network structures, for example. To this end, we formulate the problem as a minimization of the summation of strictly monotone increasing convex costs associated with degrees for covered vertices, and show that the optimality can be characterized as the non-existence of certain alternating paths. By using this characterization, we show that the optimal covers are also minimum edge covers, have the lexicographically smallest degree sequence of the covered vertices, and minimize the maximum degree of covered vertices. Based on the characterization we also present an O(|V||E|) time algorithm.
Affine and unimodular transformations for non-uniform nested loops
Authors: Fawzy A. Torkey, Afaf A. Salah, Nahed M. El Desouky, Sahar A. Gomaa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Performance improvement in the modern parallel machines needs not only to find sufficient parallelism in a program, but it is also important that we minimize the synchronization and communication overheads in the parallelized program. Parallelizing and partitioning of nested loops requires efficient iteration dependence analysis. Although many loop transformations exist for nested loop partitioning, most of these transformation techniques perform poorly when parallelizing nested loops with non-uniform (irregular) dependences. In this paper the affine and unimodular transformations are applied to solve the problem of parallelism in nested loops with non-uniform dependence vectors. To solve these problem few researchers converted the non-uniform nested loops to uniform nested loops and then find the parallelism. We propose applying directly the two approaches affine and unimodular transformations to extract and improve the parallelism in nested loops with non-uniform dependences. The study shows that unimodular transformation is better than affine transformation when the dependences in nested loops exist only in one statement. While affine transformation is more effective when the nested loops have a sequence of statements and the dependence exists between these different statements.
Semi-supervised document retrieval
Authors: Ming Li, Hang Li, Zhi-Hua Zhou
Venue: Information Processing and Management: an International Journal (2009)

This paper proposes a new machine learning method for constructing ranking models in document retrieval. The method, which is referred to as SSRank, aims to use the advantages of both the traditional Information Retrieval (IR) methods and the supervised learning methods for IR proposed recently. The advantages include the use of limited amount of labeled data and rich model representation. To do so, the method adopts a semi-supervised learning framework in ranking model construction. Specifically, given a small number of labeled documents with respect to some queries, the method effectively labels the unlabeled documents for the queries. It then uses all the labeled data to train a machine learning model (in our case, Neural Network). In the data labeling, the method also makes use of a traditional IR model (in our case, BM25). A stopping criterion based on machine learning theory is given for the data labeling process. Experimental results on three benchmark datasets and one web search dataset indicate that SSRank consistently and almost always significantly outperforms the baseline methods (unsupervised and supervised learning methods), given the same amount of labeled data. This is because SSRank can effectively leverage the use of unlabeled data in learning.
Throughput Performance of an IP Differentiated-Services Network for Video Communication
Authors: Dharm Singh Jat, Chih-Heng Ke, M. K. Jain, Chen Ruey Shin
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

The QoS solutions for video transmission over IP network presently include integrated services (IntServ) [4], DiffServ [5], multiprotocol label switching (MPLS) [6]. Among them, the DiffServ is regarded as a dominant protocol for its flexibility, scalability, and capability of QoS guarantee. Traditionally, policing or limiting function was implemented in DiffServ by using srTCM (single-rate three color marker) [2] and trTCM (two-rate three-color marker) [3]. Proposed scheme improve the throughput of MPEG4 video transmissions over IP network. In this scheme, I-frames, P-frames and B-frames are marked as different service priorities according to transmission condition and their contribution to the perceived picture quality. Investigators used authentic MPEG4 video traffic traces to compare the performance of the proposed scheme with other exesting RFCs for MPEG video transmission, such as srTCM and trTCM, in a DiffServ network. Results show that proposed scheme improves the throughput of video transmission over IP network.
The Planar k-Means Problem is NP-Hard
Authors: Meena Mahajan, Prajakta Nimbhorkar, Kasturi Varadarajan
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

In the k-means problem, we are given a finite set S of points in $\Re^m$, and integer k&thinsp;&ge;&thinsp;1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance of each point in S to its nearest center. We show that this well-known problem is NP-hard even for instances in the plane, answering an open question posed by Dasgupta [6].
Thirty years of Polynomial System Solving, and now?
Authors: Daniel Lazard
Venue: Journal of Symbolic Computation (2009)

In this introductory paper to the special issue, I describe first my personal view of the history of Polynomial System Solving during my career. Then I describe the main challenges which are now opened by the availability of efficient zero-dimensional solvers.
The portal monitor: a privacy-enhanced event-driven system for elder care
Authors: John Duncan, L. Jean Camp, William R. Hazelwood
Venue: Proceedings of the 4th International Conference on Persuasive Technology (2009)

We describe an innovative monitoring system designed for elder care. This system is an example of privacy-aware design that addresses specific risks based on gerontology literature and confirmed by focus groups with representations of the target group. The design emphasizes data transparency, minimizes data collection and storage, and balances elder control with elder risks. By being event-driven, this monitor enables a caregiver to react more efficiently than with passive monitoring technologies such as traditional security cameras. By reducing cognitive load, the system empowers caregivers, and allows them to provide a higher quality of care -- thus allowing the elder to remain in their home as long as possible. We make innovative use of arguably the most pervasive communications infrastructure -- the cellular network -- to enhance elder autonomy without sacrificing their privacy.
An analysis and experimental approach to teaching data prefetching on CMP
Authors: Zhimin Gu, Ninghan Zheng, Jie Tang Yan Huang
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

At our university, since the Spring of 2005, we have been teaching a first course about data cache on CMP from computer architecture. We have accomplished several goals. The most important of which is the analysis and experimental approach for pull-based data prefetching and push-based data prefetching on CMP. The pedagogical style embodied in this course fosters a good understanding of the relationship between memory wall and data prefetching for the students early in their experience.
Creating a Game Development Course with Limited Resources: An Evaluation Study
Authors: Albert D. Ritzhaupt
Venue: ACM Transactions on Computing Education (TOCE) (2009)

This article provides an overview of the challenges in implementing a game development course with limited resources in computing curricula. An approach to a holistic game development course is outlined in terms of its organization, software, and instructional methods. The course had 23 students enrolled in its first offering and was systematically evaluated in light of the approach using multiple sources of data. Descriptive statistics and measures of internal consistency reliability are provided. Three important findings resulted from this research: 1) a game development course can be implemented with limited institutional monetary support for a reasonable cost per student, 2) cooperation and competition can be effectively integrated into a game development course as instructional strategies, and 3) integrated lecture and computer lab sessions with cooperative learning is an effective instructional method for a game development course. Finally, insights and lessons learned are provided to assist educators in creating their own game development courses.
Differential evolution trained wavelet neural networks: Application to bankruptcy prediction in banks
Authors: Nikunj Chauhan, V. Ravi, D. Karthik Chandra
Venue: Expert Systems with Applications: An International Journal (2009)

In this study, differential evolution algorithm (DE) is proposed to train a wavelet neural network (WNN). The resulting network is named as differential evolution trained wavelet neural network (DEWNN). The efficacy of DEWNN is tested on bankruptcy prediction datasets viz. US banks, Turkish banks and Spanish banks. Further, its efficacy is also tested on benchmark datasets such as Iris, Wine and Wisconsin Breast Cancer. Moreover, Garson's algorithm for feature selection in multi layer perceptron is adapted in the case of DEWNN. The performance of DEWNN is compared with that of threshold accepting trained wavelet neural network (TAWNN) [Vinay Kumar, K., Ravi, V., Mahil Carr, & Raj Kiran, N. (2008). Software cost estimation using wavelet neural networks. Journal of Systems and Software] and the original wavelet neural network (WNN) in the case of all data sets without feature selection and also in the case of four data sets where feature selection was performed. The whole experimentation is conducted using 10-fold cross validation method. Results show that soft computing hybrids viz., DEWNN and TAWNN outperformed the original WNN in terms of accuracy and sensitivity across all problems. Furthermore, DEWNN outscored TAWNN in terms of accuracy and sensitivity across all problems except Turkish banks dataset.
Distributed Latency-Energy Minimization and interference avoidance in TDMA Wireless Sensor Networks
Authors: Mário Macedo, António Grilo, Mário Nunes
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This paper presents Latency-Energy Minimization Medium Access (LEMMA), a new TDMA-based MAC protocol for Wireless Sensor Networks (WSNs), specially suited to extend the lifetime of networks supporting alarm-driven, delay-sensitive applications characterized by convergecast traffic patterns and sporadic traffic generation. Its cascading time-slot assignment scheme conciliates low end-to-end latency with a low duty-cycle, while supporting multi-sink WSN topologies. Unlike most of the current solutions, LEMMA's time-slot allocation protocol makes decisions based on the interference actually experienced by the nodes, instead of following the simple but potentially ineffective n-hop approach. Simulation results are presented to demonstrate the ineffectiveness of the n-hop time-slot allocation in comparison with LEMMA, as well as to evaluate the performance of LEMMA against L-MAC, T-MAC and Low Power Listening. The results show that under the target scenario conditions, LEMMA presents lower interference between assigned time-slots and lower end-to-end latency, while matching its best contender in terms of energy-efficiency.
A Study on Scheduling Multiple Priority Requests in Multimedia Servers
Authors: Ibrahim Kamel, T. Niranjan
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Multimedia servers store large amount of media data of different format. Different data objects have different real time requirements. In this paper, we present an empirical study on the performance of disk scheduling in the presence of different media type with different real-time requirements. We also argue that using multiple queues to handle different data types is not the best way to handle objects with different priorities. Moreover we argue that using one queue per disk to organize objects with different real time requirements would be more suitable for multimedia server applications. We built a simulation model based on a real video server, PanaViss, produced by Panasonic. The experiments show that using multiple queues respects the priority hierarchy. However, this schema sometime penalizes utilization of the disk.
How do we program the home? Gender, attention investment, and the psychology of programming at home
Authors: Alan F. Blackwell, Jennifer A. Rode, Eleanor F. Toye
Venue: International Journal of Human-Computer Studies (2009)

We report a series of studies investigating the choices that users make between direct manipulation and abstract programming strategies when operating domestic appliances. We characterise these strategic choices in terms of the Attention Investment model of abstraction use. We then describe an experiment that investigates the estimation biases influencing the individual parameters of that model. These biases are linked to gender in a way that explains some gender differences in discretionary appliance use. Finally, we suggest design strategies that might compensate for those gender-linked estimation biases, and therefore make programmable features of future homes more accessible to a wider range of users.
Adding Expressiveness in Musical Performance in Real Time
Authors: A. Roda, S. Canazza
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Musical performance introduces some deviations from nominal values specified in the score. Music reproduced without such variations is usually perceived as mechanical. Most investigations explore how the musical structure influences the performance. There are a few studies on how the musician's expressive intentions are reflected in the performance. The purpose of this work is to develop a model for the expressive modification in real time of musical performance. Perceptual analyses were conducted on some performances played with different intentions (correlated with a set of sensorial adjectives). From these analyses, two distinct expressive directions were observed: the first one correlated with "energy" and the second one with the "kinetics" of the pieces. The two-dimensional space (Perceptual Parametric Space, PPS) obtained represents how the subjects arranged the pieces in their own minds. Acoustical analysis allowed us to correlate the expressive directions of the PPS with the main acoustic parameters. Each point of PPS is therefore associated with a set of acoustic parameters. Analysis-by-synthesis method was used to validate the model. In order to carry out computer generated performances, we developed a real time software.
BaseX & DeepFS joint storage for filesystem and database
Authors: Alexander Holupirek, Christian Grün, Marc H. Scholl
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Mere storage of personal data in state-of-the-art filesystems is a markedly well done job in current operating systems. Convenient access to and information retrieval from such data, however, is crucial to leverage the stored information. Thereby database style query languages can be of great use. We demonstrate a user level filesystem implementation that is built on recent semi-structured database storage techniques. As such, it serves as a storage layer for the BaseX XQuery processor and, while it appears to the operating system as a conventional filesystem, a large part of its content can be queried using XPath/XQuery.
A new iterated fast local search heuristic for solving QAP formulation in facility layout design
Authors: A. S. Ramkumar, S. G. Ponnambalam, N. Jawahar
Venue: Robotics and Computer-Integrated Manufacturing (2009)

In facility layout design, the problem of locating facilities with material flow between them was formulated as a quadratic assignment problem (QAP), so that the total cost to move the required material between the facilities is minimized, where the cost is defined by a quadratic function. In this paper, we propose a modification to iterated fast local search algorithm (IFLS) with a new recombination crossover operator and the modified IFLS is addressed as NIFLS. The ideas we incorporate in the NIFLS are iterated self-improvement with evolutionary based perturbation tool, which includes (i) recombination crossover as perturbation tool and (ii) self-improvement in mutation operation followed by a local search. Three schemes of NIFLS are proposed and the obtained solution qualities by the three schemes are compared. We test our algorithm on all the benchmark instances of QAPLIB, a well-known library of QAP instances. The performance of proposed recombination crossover with sliding mutation (RCSM) scheme of NIFLS is well superior to the other two schemes of NIFLS.