ppxscal/embedding_network huggingface dataset:
Ant-Based Reliable Multi-Constrained Anycast Routing for Sensor Networks
Authors: Jianping Yu, Yaping Lin, Yong Wang
Venue: International Journal of Distributed Sensor Networks (2009)

Wireless sensor networks (WSNs) are task-specific where the tasks are specified by the users or applications. Energy and delay constraints have had a great impact on the design and operation of the WSNs. As routing plays an important role in data-centric WSNs, there are numerous energy aware routing protocols proposed for WSNs with single sink, generally using multi-hop paths to use the energy more efficiently. But most of them do not consider the communication delay carefully. As many applications of WSNs require real-time communication, the end-to-end delivery delay is another point to be considered, especially for urgent events. When considering the multiple QoS constraints such as the delivery delay and the minimal energy required, the multi-constrained routing is NP-hard. Moreover, WSNs also suffer from a scalability problem as the total number of nodes can reach hundreds or thousands. Thus, sensors located near the sink consume large amounts of energy. The sink is then isolated once they deplete their batteries, and the network fails to function. To cope with the scalability problem, multi-sink configuration is adopted for large-scale WSNs. How to select the optimum sink for packets with different delay and energy constraints in large-scale WSNs is the main problem to be resolved in this paper, which is called the multi-constrained anycast (MCA) problem. Obviously, it is NP-hard. We investigate the MCA problem in resource-constrained WSNs with multiple sinks and two-tier architecture, where the source cluster-heads send collected data to only one optimum sink. To reduce the energy consumption and shorten the delivery delay, a distributed anycast algorithm ARMCA inspired by swarm intelligence of ants is proposed, which can also achieve reliable data gathering during the deployment period. The scheme takes advantage of beneficial clustering and routing emerging in a self-organized way from the positive interaction of ants. The idea of the ACO-based routing is adopted to achieve the good performance of energy-efficiency and delivery delay. Meanwhile, the ant-based clustering is utilized to ensure the reliability. By the combination of the ant-based routing and clustering models, the ARMCA protocol can solve the MCA problem efficiently and flexibly. The simulation results demonstrated that the proposed algorithm can reliably deliver collected events to the optimum sinks efficiently, and has self-recovery capabilities to deal with failures of sensors including the sinks. Not only is the energy cost reduced, but also the delivery delay is shortened significantly when transmitting packets of the named events to the sinks.
Maintenance of fast updated frequent pattern trees for record deletion
Authors: Tzung-Pei Hong, Chun-Wei Lin, Yu-Lung Wu
Venue: Computational Statistics Data Analysis (2009)

The Frequent-Pattern-tree (FP tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It was used to represent a database into a tree structure which stored only frequent items. It, however, needed to process all transactions in a batch way. In the past, Hong et al. thus proposed an efficient incremental mining algorithm for handling newly inserted transactions. In addition to record insertion, record deletion from databases is also commonly seen in real-applications. In this paper, we thus attempt to modify the FP-tree construction algorithm for efficiently handling deletion of records. A fast updated FP-tree (FUFP-tree) structure is used, which makes the tree update process become easier. An FUFP-tree maintenance algorithm for the deletion of records is also proposed for reducing the execution time in reconstructing the tree when records are deleted. Experimental results also show that the proposed FUFP-tree maintenance algorithm for deletion of records runs faster than the batch FP-tree construction algorithm for handling deleted records and generates nearly the same tree structure as the FP-tree algorithm. The proposed approach can thus achieve a good trade-off between execution time and tree complexity.
Homophily in MySpace
Authors: Mike Thelwall
Venue: Journal of the American Society for Information Science and Technology (2009)

Social network sites like MySpace are increasingly important environments for expressing and maintaining interpersonal connections, but does online communication exacerbate or ameliorate the known tendency for offline friendships to form between similar people (homophily)&quest; This article reports an exploratory study of the similarity between the reported attributes of pairs of active MySpace Friends based upon a systematic sample of 2,567 members joining on June 18, 2007 and Friends who commented on their profile. The results showed no evidence of gender homophily but significant evidence of homophily for ethnicity, religion, age, country, marital status, attitude towards children, sexual orientation, and reason for joining MySpace. There were also some imbalances: women and the young were disproportionately commenters, and commenters tended to have more Friends than commentees. Overall, it seems that although traditional sources of homophily are thriving in MySpace networks of active public connections, gender homophily has completely disappeared. Finally, the method used has wide potential for investigating and partially tracking homophily in society, providing early warning of socially divisive trends. &copy; 2009 Wiley Periodicals, Inc.
Analysis of location tracking based on friendly points
Authors: Deooki Kim, Seungyoul Kim, Younggap You
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper presented and analyzed a location tracking scheme based on friendly points. A set of friendly points provides with a convenient and accurate location information for mobile tracking. The scheme partitions the target area to reduce the error. The friendly points are selected such that inter distance among the three intersection points is the minimum. The simulation based on the proposed scheme shows some promising output. It reduces the maximal and average errors by 43.25% and 44.59%, respectively. This scheme can be used for wireless sensor network applications where multiple observation facilities are available.
Three dimensional modeling and finite element simulation of a generic end mill
Authors: Puneet Tandon, Md. Rajik Khan
Venue: Computer-Aided Design (2009)

The geometry of cutting flutes and the surfaces of end mills is one of the crucial parameters affecting the quality of the machining in the case of end milling. These are usually represented by two-dimensional models. This paper describes in detail the methodology to model the geometry of a flat end mill in terms of three-dimensional parameters. The geometric definition of the end mill is developed in terms of surface patches; flutes as helicoidal surfaces, the shank as a surface of revolution and the blending surfaces as bicubic Bezier and biparametric sweep surfaces. The proposed model defines the end mill in terms of three-dimensional rotational angles rather than the conventional two dimensional angles. To validate the methodology, the flat end milling cutter is directly rendered in OpenGL environment in terms of three-dimensional parameters. Further, an interface is developed that directly pulls the proposed three-dimensional model defined with the help of parametric equations into a commercial CAD modeling environment. This facilitates a wide range of downstream technological applications. The modeled tool is used for finite element simulations to study the cutting flutes under static and transient dynamic load conditions. The results of stress distribution (von mises stress), translational displacement and deformation are presented for static and transient dynamic analysis for the end mill cutter flute and its body. The method described in this paper offers a simple and intuitive way of generating high-quality end mill models for use in machining process simulations. It can be easily extended to generate other tools without relying on analytical or numerical formulations.
Labeling bipartite permutation graphs with a condition at distance two
Authors: Toru Araki
Venue: Discrete Applied Mathematics (2009)

An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,...,@l} such that |f(u)-f(v)|>=p if u and v are adjacent, and |f(u)-f(v)|>=q if u and v are at distance 2 apart. The minimum value of @l for which G has L(p,q)-labeling is denoted by @l"p","q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks. In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p-1)+q(bc(G)-2), where bc(G) is the biclique number of G. Since @l"p","q(G)>=p+q(bc(G)-2) for any bipartite graph G, the upper bound is at most p-1 far from optimal.
An expert system for predicting longitudinal dispersion coefficient in natural streams by using ANFIS
Authors: Hossien Riahi-Madvar, Seyed Ali Ayyoubzadeh, Ehsan Khadangi, Mohammad Mehdi Ebadzadeh
Venue: Expert Systems with Applications: An International Journal (2009)

Longitudinal dispersion coefficient in rivers and natural streams usually is estimated by simple inaccurate empirical relations, because of the complexity of the phenomena. So, in this study using adaptive neuro-fuzzy inference system (ANFIS), which have the ability of perception and realization of phenomenon without need for mathematical governing equations, a new flexible tool is developed to predict the longitudinal dispersion coefficient. The process of training and testing of this new model is done using a set of available published filed data. Several statistical and graphical criterions are used to check the accuracy of the model. The dispersion coefficient values predicted by the ANFIS model satisfactorily compared with the measured data. The predicted values were also compared with those predicted using available empirical equations that have been suggested in the literature and it was found that the ANFIS model with R^2=0.99 and RMSE=15.18 in training stage and R^2=0.91 and RMSE=187.8 in testing stage is superior in predicting the dispersion coefficient than the best accurate empirical equation with R^2=0.48 and RMSE=295.7. The presented methodology in this paper is a new approach in estimating dispersion coefficient in streams and can be combined with mathematical models of pollutant transfer or real-time updating of these models.
Information Security Risk Assessment and Pointed Reporting: Scalable Approach
Authors: D. S. Bhilare, A. K. Ramani, Sanjay Tanwani
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Network Managers of Higher Educational Institutes, are well aware of general Information Security issues, related to Campus Networks. There are well developed security metrics, giving exhaustive list of security controls, required to mitigate different risks. Accordingly, various security measures and technologies are being deployed. However, at present, not enough attention is being paid on measuring the effectiveness of these controls and overall state of security in the institution. In this study, attempt is made to build a metric based assessment and reporting plan, specific to the needs of an academic environment. Proposed assessment metric facilitates iterative implementation, by prioritizing each metric. Secondly, to reduce response time, a novel approach of pointed reporting is suggested, where responsibilities are distributed across the institution, based on relevant roles. In this approach, security exceptions are reported directly to the predefined roles, responsible for that particular security control. This pointed reporting, delivers message to the right person in minimum time, resulting in improved response time. The proposed assessment metric and pointed reporting structure, will improve overall security governance. As security measures and practices can be assessed systematically and remedial actions can be taken in less time, which is so crucial for effective security governance.
Non-existence of imprimitive Q-polynomial schemes of exceptional type with d=4
Authors: Diana R. Cerzo, Hiroshi Suzuki
Venue: European Journal of Combinatorics (2009)

In [H. Suzuki, Imprimitive Q-polynomial association schemes, J. Algebraic Combin. 7 (2) (1998) 165-180], it was shown that an imprimitive Q-polynomial scheme X=(X,{R"i}"0"@?"i"@?"d) is either dual bipartite, dual antipodal or of class 4 or 6. In this paper, it will be shown that the scheme of class 4 does not occur using the integrality conditions of the entries of the first eigenmatrix of X. These integrality conditions arise from the fact that X has exactly one Q-polynomial ordering [H. Suzuki, Association schemes with multiple Q-polynomial structures, J. Algebraic Combin. 7 (2) (1998) 181-196].
Ordering and Elimination Based Component Learning Method
Authors: Sheetal Reddy Pamudurthy, C. Chandra Sekhar
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, we propose a component learning method to learn a set of Gaussian components that fit the given data distribution. An ordering and visualization technique called OPTICS and tests of multinormality are used in this method. We consider the applications of the proposed method to the tasks of classification and clustering. Here, the components are used to define a feature space to which the data points are transformed. In that feature space, classification is performed using linear support vector machines and clustering is performed using support vector clustering. The performance of the component learning method and its application to classification and clustering is demonstrated on synthetic datasets.
Implementing Services by Partial State Machines
Authors: Walter Dosch, Annette Stümpel
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

In the service-oriented approach to software engineering, interactive components offer contracted services through public interfaces. Over time a component receives a stream of service requests and generates a stream of responses. In general, a component is only prepared to serve a subset of possible requests in each situation -- services are partial behaviours. On the specification level, we model services by stream functions defined on a restricted service domain. For the state-based implementation of services we introduce partial state machines. We present a transformation how to systematically implement a service by a partial state machine. The transformation exploits history abstractions to relate service histories with machine states. We illustrate the formal method with three characteristic applications, viz. an interactive stack, a bounded buffer and a server with registration.
Computation of blowing-up solutions for second-order differential equations using re-scaling techniques
Authors: Nabil R. Nassif, Noha Makhoul-Karam, Yeran Soukiassian
Venue: Journal of Computational and Applied Mathematics (2009)

This paper presents a new technique to solve efficiently initial value ordinary differential equations of the second-order which solutions tend to have a very unstable behavior. This phenomenon has been proved by Souplet et al. in [P. Souplet, Critical exponents, special large-time behavior and oscillatory blow-up in nonlinear ode's, Differential and Integral Equations 11 (1998) 147-167; P. Souplet, Etude des solutions globales de certaines equations differentielles ordinaires du second ordre non-lineaires, Comptes Rendus de I'Academie des Sciences Paris Serie I 313 (1991) 365-370; P. Souplet, Existence of exceptional growing-up solutions for a class of nonlinear second order ordinary differential equations, Asymptotic Analysis 11 (1995) 185-207; P. Souplet, M. Jazar, M. Balabane, Oscillatory blow-up in nonlinear second order ode's: The critical case, Discrete And Continuous dynamical systems 9 (3) (2003)] for the ordinary differential equation y^''-b|y^'|^q^-^1y^'+|y|^p^-^1y=0,t>0,p>0,q>0, whereby the time interval of existence of the solution is finite [0,T"b] with lim"t"->"T"""b"^"-|y(t)|=lim"t"->"T"""b"^"-|y^'(t)|=~. The blow-up of the solution and its derivatives is handled numerically using a re-scaling technique and a time-slices approach that controls the growth of the re-scaled variable through a cut-off value S. The re-scaled models on each time slice obey a criterion of mathematical and computational similarity. We conduct numerical experiments that confirm the accuracy of our re-scaled algorithms.
Influence of program inputs on the selection of garbage collectors
Authors: Feng Mao, Eddy Z. Zhang, Xipeng Shen
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

Many studies have shown that the best performer among a set of garbage collectors tends to be different for different applications. Researchers have proposed application-specific selection of garbage collectors. In this work, we concentrate on a second dimension of the problem: the influence of program inputs on the selection of garbage collectors. We collect tens to hundreds of inputs for a set of Java benchmarks, and measure their performance on Jikes RVM with different heap sizes and garbage collectors. A rigorous statistical analysis produces four-fold insights. First, inputs influence the relative performance of garbage collectors significantly, causing large variations to the top set of garbage collectors across inputs. Profiling one or few runs is thus inadequate for selecting the garbage collector that works well for most inputs. Second, when the heap size ratio is fixed, one or two types of garbage collectors are enough to stimulate the top performance of the program on all inputs. Third, for some programs, the heap size ratio significantly affects the relative performance of different types of garbage collectors. For the selection of garbage collectors on those programs, it is necessary to have a cross-input predictive model that predicts the minimum possible heap size of the execution on an arbitrary input. Finally, based on regression techniques, we demonstrate the predictability of the minimum possible heap size, indicating the potential feasibility of the input-specific selection of garbage collectors.
Broadband MPEG-2 Client with Network Configuration Capability
Authors: Anssi Huttunen, Irek Defee
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper we describe operation and performance of a broadband video client, an MPEG-2 transport stream decoder with network interfaces implemented on Sun UltraSparc processor using VIS multimedia instruction set. The decoder performs demultiplexing, synchronized video and audio decompression, and display in realtime. It is implemented as a Netscape plugin and it has a network interface allowing to configure it for dafferent broadband networks whach might be available: ATM PVC, SVC, IP over ATM and Fast Ethernet. Implementation of the decoder in multithreaded and multiprocessing environment is described. Experimental data regarding the performance of the decoder in different conditions are presented and basing on them conclusions for the processing power requirements are formulated.
Optimization of the file access method in content-addressable database access machine (CADAM)
Authors: Sadayuki Hikita, Haruaki Yamazaki, Kiyoshi Hasegawa, Yutaka Matsushita
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The design of the database machine CAD AM with an efficient file access mechanism is presented. CAD AM can be used widely for various applications cost-effectively. For this purpose, the functions of database systems are distributed over three basic components, and a conventional magnetic disk device instead of a disk attached with microprocessors and logic circuits is used. One of the most important points in designing CAD AM with high throughput is to minimize the time for transferring data from the disk to the cache memory. We analyze the optimal size of physical access unit between them for various applications in order to show that the size should be adjustable.
Deriving User Interfaces from UML Models and Object -Z
Authors: Zhong-jie Qiu, Chang-jiang Wei
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, we discuss a method for generating a set of user interfaces from business model and use case model. A set of rules that derives "CRUD" UI forms from business model is given. The method uses Object-Z formal language to add preciseness and semantic richness both to the business and use case UML models in order to enhance UI usability. The derived UI prototype allows the early validation of requirements, and can be used as a basis for subsequent developments.
JTRS executable architecture
Authors: Joseph Stuart Hurvitz
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Assessing the benefit of improved battlefield communication is a constant discussion within the DoD. Related to this discussion are questions of "what" and "how much" to procure in an environment of fiscal constraint. This paper describes a methodology that quantifies the benefit of battlefield communication technologies and utilizes the results in a warfighter cost/benefits study. To quantify the value of communication technologies, discrete event simulation is used to expand upon the static DoD Architecture Framework products developed for the Joint Staff Capabilities Integration & Development System process. The ARENA simulation package is employed to produce executable architecture of various military missions. Results quantify communication effectiveness into five warfighter metrics: Speed of Command, Situational Awareness, Footprint, Transformational Impact, and Interoperability. The metrics constitute the benefit portion of a portfolio analysis study to help decision makers determine which communication technologies should be developed and integrated onto military platforms. 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
Remote, condition-based maintenance for web-enabled robotic system
Authors: Yongjin (James) Kwon, Richard Chiou, Leonard Stepanskíy
Venue: Robotics and Computer-Integrated Manufacturing (2009)

The current trends in industry include an integration of information and knowledge-base network with a manufacturing system, which coined a new term, e-manufacturing. From the perspective of e-manufacturing any production equipment and its control functions do not exist alone, instead becoming a part of the holistic operation system with distant monitoring, remote quality control, and fault diagnostic capabilities. The key to this new paradigm is the accessibility to a remotely located system and having the means of responding to a changing environment, which is better suited for today's rapidly changing environment. Within the framework of the web-enabled robotic system, this paper focuses on the remote maintenance schemes with an emphasis on condition-based maintenance strategies. Real-time monitoring of robot harmonic drive systems and operational status have been attained over the Web. A mathematical modeling of system availability has been derived in order to account for other failures that might occur in the subsystems of the robot. Compared to the schedule-based maintenance strategies, the proposed approach shows great potential for improving overall production efficiency, while reducing the cost of maintenance.