ppxscal/embedding_network huggingface dataset:
On Energy Efficient Communications over Rayleigh Fading Channel with Delivery Rate and Delay Constraints in Wireless Sensor Networks
Authors: Xiao-Hui Lin, Yu-Kwong Kwok
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

There is a plethora of recent research on high performance wireless communications using a cross-layer approach in that adaptive modulation and coding (AMC) schemes at wireless physical layer are used for combating time varying channel fading and enhance link throughput. However, in a wireless sensor network, transmitting packets over deep fading channel can incur excessive energy consumption due to the usage of stronger forwarding error code (FEC) or more robust modulation mode. To avoid such energy inefficient transmission, a straightforward approach is to temporarily buffer packets when the channel is in deep fading, until the channel quality recovers. Unfortunately, packet buffering may lead to communication latency and buffer overflow, which, in turn, can result in severe degradation in communication performance. Specifically, to improve the buffering approach, we need to address two challenging issues: (1) how long should we buffer the packets?, and (2) how to choose the optimum channel transmission threshold above which to transmit the buffered packets? In this paper, by using discrete-time queuing model, we analyze the effects of Rayleigh fading over AMCbased communications in a wireless sensor network. We then analytically derive the packet delivery rate and average delay. Guided by these numerical results, we can determine the most energy-efficient operation modes under different transmission environments. Extensive simulation results on NS-2 have validated the analytical results, and indicates that under these modes, we can achieve as much as 40% reduction in energy dissipation.
A Method of Ranking in Group Decision Making Based on Ordinal Preference Information
Authors: Xia Chen, Zhi-Ping Fan, Li-Hong Ma
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper proposes an approach to solve the group decision-making (GDM) problem, in which the information given by decision makers about alternative is uncertainty ordinal interval preference information. In order to compute collective ranking values of alternatives based on preference information of uncertainty ordinal interval forms, a new formula of possibility of uncertain ordinal interval numbers and the possibility matrix of each expert are defined Thus, individual uncertain ordinal interval number preferences can be transferred into the possibility matrix of each expert. Meanwhile, ranking of the alternatives or selection of the best alternative(s) is also obtained based on the optimization method in this paper. A numerical example is used to illustrate the applicability of the proposed approach. Key words: group decision-making (GDM); ordinal interval number; possibility; ranking method.
Automated Extraction of Conceptual Knowledge from a Chinese Machine-Readable Dictionary
Authors: Yi Hu, Ruzhan Lu, Yuquan Chen, Jinglei Zhao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we exploit a Chinese machine-readable dictionary to extract the conceptual knowledge, i.e. the pairs involving in hypernym, (artificiality) material, (artificiality) function and (medicine) usage from the corresponding definitions of nominal entries. Our method focuses on (1) constructing the extraction patterns and (2) the statistical decision for applying these patterns. Therefore our work is designed to be a new three-step procedure. Firstly, annotate the definitions of a number of nominal entries that are used as training samples of these four attributes and contextual linguistic features; secondly, design different patterns for extracting such conceptual knowledge, and learn the applicability of the patterns by a Maximum Entropy (ME) classifier to decide whether a pattern can be used in current context or not; at last, apply these patterns to the remaining nominal entries of the dictionary, and we achieve relatively satisfying results.
RDF data exploration and visualization
Authors: Leonidas Deligiannidis, Krys J. Kochut, Amit P. Sheth
Venue: Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience (2007)

We present Paged Graph Visualization (PGV), a new semi-autonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the "PGV explorer" and b) the "RDF pager" module utilizing BRAHMS, our high per-formance main-memory RDF storage system. Unlike existing graph visualization techniques which attempt to display the entire graph and then filter out irrelevant data, PGV begins with a small graph and provides the tools to incrementally explore and visualize relevant data of very large RDF ontologies. We implemented several techniques to visualize and explore hot spots in the graph, i.e. nodes with large numbers of immediate neighbors. In response to the user-controlled, semantics-driven direction of the exploration, the PGV explorer obtains the necessary sub-graphs from the RDF pager and enables their incremental visualization leaving the previously laid out sub-graphs intact. We outline the problem of visualizing large RDF data sets, discuss our interface and its implementation, and through a controlled experiment we show the benefits of PGV.
The Evolution of the NOMS-IM Symposia Series: From a Gleam in the Eye to Multiple Technical Activities
Authors: Joseph Betser
Venue: Journal of Network and Systems Management (2007)

This report documents the evolution of a number of symposia, along with the evolution of the associated communities. These communities launched the initial conferences, as well as benefited from the growth and evolution of these technical activities. Over the span of a couple decades, the communities grew in breadth and depth. The communities are truly global in both constituency and reach. Both symposia convene in multiple countries within multiple continents, and continue to attract new audiences. In addition, new multiple symposia series were spawned by the communities, and the richness of the technical activities and venues affords the communities enhanced value and interactions.
Cubature formulas for function spaces with moderate smoothness
Authors: Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav
Venue: Journal of Complexity (2007)

We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over the d-dimensional unit cube whose coefficients with respect to certain multiwavelet expansions decay rapidly. Such a class contains discontinuous functions on the one hand and, for the right choice of parameters, the quite natural d-fold tensor product of a Sobolev space H^s[0,1] on the other hand. The algorithms are based on one-dimensional quadrature rules appropriate for the integration of the particular wavelets under consideration and on Smolyak's construction. We provide upper bounds for the worst-case error of our cubature rule in terms of the number of function calls. We additionally prove lower bounds showing that our method is optimal in dimension d=1 and almost optimal (up to logarithmic factors) in higher dimensions. We perform numerical tests which allow the comparison with other cubature methods.
Dynamic Group-based Scheduling for Two Dimensional Seek Space in MEMS-based Storage
Authors: Junseok Park, Hansung Chun, Hyokyung Bahn, Kern Koh
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

MEMS-based storage is expected to be adopted as a secondary storage of mobile computing devices such as portable media players and digital cameras. Due to its desirable features such as small size, lightweight, low power consumption, and low cost, MEMS-based storage will be widely used for mobile applications that require large volume of multimedia data. However, physical structures of MEMS-based storage are different from other storage devices such as hard disk especially in the way of data placement and head positioning. Hence, it is important to revise OS-level software management schemes for MEMS-based storage. In this paper, we present a new I/O scheduling algorithm for MEMS-based storage called G-MST that exploits two-dimensional structure of MEMS-based storage. The new algorithm aims at reducing total seek distance in the two dimensional MEMS structure and at the same time providing fast and uniform response times. Through simulation experiments, we show that the new I/O scheduling algorithm performs better than existing algorithms in terms of average response time and the variation of response times.
Verification of Giotto based embedded control systems
Authors: Rajiv Kumar Poddar, Purandar Bhaduri
Venue: Nordic Journal of Computing (2006)

An implementation of a control system design may not preserve the functional and timing requirements of the application. Our goal is to verify that an implementation meets the high-level timing and functional specifications of a control application. We take Giotto as the implementation model, and verify Giotto models using UPPAAL, a tool box for modelling, simulation and verification of timed automata. We present a translation scheme for building timed automata in UPPAAL for real-time systems written in Giotto. When translating Giotto to timed automata, we consider timing constraints imposed by the control application, as well as the characteristics of the implementation platform. These timing constraints take into account execution times of atomic tasks, worst case execution times, worst case communication times and jitters. The timed models obtained in this manner are analysed and the corresponding system's functional and timing properties are verified using UPPAAL. We develop the translation scheme in two phases. The first is applicable to basic Giotto models; the latter considers Giotto models with annotations providing information on scheduling and resource allocation. We demonstrate both phases of the scheme by applying it to two Giotto models - an elevator control and a hovercraft control system. The two systems vary in their complexity, their functional and non-functional requirements. We report on the results of our verification of the Giotto models.
The Pool Project
Authors: Sherre DeLys, John Jacobs, Brogan Bunt, Marius Foley
Venue: IEEE MultiMedia (2007)

This article reviews the early days of an Australian public broadcaster's open studio Web project. It raises important issues for software developers and Web media makers about the need for software and collaborative structures that can facilitate community building in an open and responsive way. This project could be of interest to software developers working in Drupal.
Dynamic Equivalents of Power System Based on Extended Two Particle Swarm Optimization
Authors: Jingping Yang, Jing Zhang, Wulue Pan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Measurement Units (PMUs) for power system dynamic equivalents is presented. In this methodology the external system is reduced dynamically using the important quantities obtained by PMUs. An extended two Particle Swarm Optimization (PSO) algorithm with the mutation operator is proposed to identify the parameters of the equivalent system. The proposed method is demonstrated and compared with the original system using the 10 machines 39 buses New England test system. The comparison shows that the proposed method can preserve the dynamic properties of the original system and has great value in engineering application.
A Note on Computer Graphics In Network Evacuation Studies
Authors: Y. Sheffi
Venue: IEEE Computer Graphics and Applications (1982)

What Would the Traffic Patterns Look Like as People Fled a Nuclear Plant Accident? This Computer Model and Its Graphics Output Provide Some Answers.
Joint estimation of mutual coupling, element factor, and phase center in antenna arrays
Authors: Marc Mowlér, Björn Lindmark, Erik G. Larsson, Björn Ottersten
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

A novel method is proposed for estimation of the mutual coupling matrix of an antenna array. The method extends previous work by incorporating an unknown phase center and the element factor (antenna radiation pattern) in the model, and treating them as nuisance parameters during the estimation of coupling. To facilitate this, a parametrization of the element factor based on a truncated Fourier series is proposed. The performance of the proposed estimator is illustrated and compared to other methods using data from simulations and measurements, respectively. The Cramér-Rao bound (CRB) for the estimation problem is derived and used to analyze how the required amount of measurement data increases when introducing additional degrees of freedom in the element factor model. We find that the penalty in SNR is 2.5 dB when introducing a model with two degrees of freedom relative to having zero degrees of freedom. Finally, the tradeoff between the number of degrees of freedom and the accuracy of the estimate is studied. A linear array is treated in more detail and the analysis provides a specific design tradeoff.
New Products
Venue: Computer (1972)

A major redirection of IBM System/370 technology, designed to make it easier and more economical for computer users to develop new applications, has been announced by International Business Machines Corporation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Neural Network Computing Time Analysis on Finite Element of Elastic Mechanics
Authors: Haibin Li, Wei Qie, Wei Duan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Neural network computation of the structure finite element analysis is a new parallel calculating method. Because the dynamics equation of the network corresponds to the integrated circuit, so we can obtain the solution of the finite element system equations in the circuit time constant. Many investigators have presented qualitative explanation to the method. But so far it is not completely proofed in theory. In view of the above question, on the basis of the dynamic circuit of the neural network of the finite element system equations, we derive the stabilization time of the neural network dynamic circuit and other influencing factors from matrix theory in this paper. Theoretical analysis and computer emulation show that the stabilization time of the circuit is influenced by the bias capacitance in the dynamic circuit, the minimum eigenvalue of the finite element stiffness matrix and the predefined threshold value of system steady state error.
The Electronic Voting System for the United States House of Representatives
Authors: F. B. Ryan
Venue: Computer (1972)

The most important voting procedure traditionally utilized in the United States House of Representatives to resolve legislative issues involves a time-consuming roll call of Representatives' names. It has been recognized for a number of years that this cumbersome feature of the legislative process could be automated so that a more efficient use of Members' time would be possible. The year 1970 saw the fruition of several years' effort to achieve a broad range of Congressional reforms. Not since 1946, when important structural changes in Committees and their staffs were made, had there been a generalized reform of Congressional, procedures. The Legislative Reorganization Act of 1970 (PL 91-510) in section 121 specifically provides that electronic equipment may be used to record votes in the. House of Representatives. The Senate, a body of only 100, has not chosen to employ automated voting procedures. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Achieving Reliability through Replication in a Wide-Area Network DHT Storage System
Authors: Jing Zhao, Hongliang Yu, Kun Zhang, Weimin Zheng, Jie Wu, Jinfeng Hu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

It is a challenge to design and implement a wide-area distributed hash table (DHT) which provides a storage service with high reliability. Many existing systems use replication to reach the goal of reliability. However, maintaining availability and consistency of the replicas becomes a major hurdle. A reliable storage system needs to recover lost and inconsistent replicas, but any recovery strategy will lead to extra workloads which affect the throughput of the system. This paper explores these problems and provides a possible solution. We argue that our approach not only keeps eventual consistency of replicas but also quickens the spread of updates. We use an adaptive recovery strategy to guarantee the reliability of replicas as well as bandwidth saving. With a simulation result better than epidemic algorithms, we have also implemented and deployed a DHT system using strategies mentioned in this paper, and integrated it into Granary - a storage system distributed in 20 servers in 5 cities. Granary and the DHT system have run over half a year and provide a reliable storage service to several hundred users.
Infrared Point Target Detection and Tracking Based on DSP
Authors: Zhao Hong-wei, Zhang Xiao-lin, Qi Yi-ming
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In the embedded real-time image processing system, moving mini point target was detected and tracked. The self-adaptive threshold division and corresponding matching method were employed to detect the moving target and restrain the background noise. And with the memory extrapolate image processing method, the sheltered target was tracked. According to the requirement of image data and algorithm complexity, the simulation was realized on TMS320DM642 board based on TI Company. The results show CPU utilization rate is 83.3%, which could satisfy the real-time requirement, and the image output is smooth with high reliability.
Applying Fuzzy Multiple-Criteria Decision-Making Method to Select the Distribution Center
Authors: Yu-Jei Wang, Chao-Shun Kao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The location selection of distribution center is one of the most important decision issues for logistic companies. To reserve uncertainty and vagueness messages in decision, we propose a fuzzy multiple-criteria decision- making(FMCDM) method to solve the location selection problem of distribution center under fuzzy environment. In our method, the ratings of alternatives and the weights of criteria are given in terms of linguistic values, and then transformed into triangular fuzzy numbers.
Comparison of Adaptive Receivers for DS-CDMA Systems
Authors: Sun Xu-bao, Li Xu-jian
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In order to ensure real time running of adaptive receivers on multi-path fading channels in DS-CDMA systems, a new scheme is considered using the non-blind algorithm by jointing parallel interference cancellation( PIC) and adaptive minimum mean-squared error ( MMSE) receivers , the proposed scheme has a relatively lower computational complexity compare to conventional methods. Simulations show that the symbol number of training sequences is relatively reduced and the performance of Bit Error Rate (BER) is improved too.
Post-pruning in regression tree induction: An integrated approach
Authors: Kweku-Muata Osei-Bryson
Venue: Expert Systems with Applications: An International Journal (2008)

The regression tree (RT) induction process has two major phases: the growth phase and the pruning phase. The pruning phase aims to generalize the RT that was generated in the growth phase by generating a subtree that avoids over-fitting to the training data. Most post-pruning methods essentially address post-pruning as if it were a single objective problem (i.e., maximize validation accuracy), and address the issue of simplicity (in terms of the number of leaves) only in the case of a tie. However, it is well known that apart from accuracy there are other performance measures (e.g., stability, simplicity) that are important for evaluating DT quality. In this paper we present an integrated approach to post-pruning phase that simultaneously accommodates multiple performance measures that are important for evaluating RT quality, and obtains the optimal subtree based on user provided preference and value function information.
Verification condition generation for conditional information flow
Authors: Torben Amtoft, Anindya Banerjee
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

We formulate an intraprocedural information flow analysis algorithm for sequential, heap manipulating programs. We prove correctness of the algorithm, and argue that it can be used to verify some naturally occurring examples in which information flow is conditional on some Hoare-like state predicates being satisfied. Because the correctness of information flow analysis is typically formulated in terms of noninterference of pairs of computations, the algorithm takes as input a program together with two-state assertions as postcondition, and generates two-state preconditions together with verification conditions. To process heap manipulations and while loops, the algorithm must additionally be supplied "object flow invariants" as well as "loop flow invariants" which are themselves two-state, and possibly conditional.
Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding Obstacles
Authors: Ali Asadi, Mohammad Reza Razzazi
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The Steiner problem leads to solutions in several scientific and business applications; computer networks' routing and electronic integrated circuits are few examples. The computational features of this problem make it an important research subject in computational geometry. Assuming some points in the Euclidean plane, we can construct a minimum spanning tree connecting these (terminal) nodes. It is possible to add some extra points (Steiner Points) in order to decrease the length of this tree which would in turn lead to Euclidean Steiner Minimal Tree (ESMT). This problem is considered as a NP-hard problem, as it may contain some nodes that are not in the set of given nodes. Assuming a simple polygon P with m vertices and n terminals in it, we try to find a Euclidean Steiner minimal tree connecting all these n terminals in P. In this paper we propose solutions for any number of terminals in a simple polygon. Proposed algorithms can also solve the problem in a simple polygon with some obstacles inside. These algorithms are simple to implement and lead to good results.