ppxscal/embedding_network huggingface dataset:
A Technical Framework for Designing Wireless Sensor Networks for Agricultural Monitoring in Developing Regions
Authors: Amar H. Kabashi, J. M. H. Elmirghani
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper extracts the lessons learned in an on going project which aims at delivering agricultural intelligence to build a capable decision support system that improves agricultural practice and decision making in sub-Saharan Africa. By generalizing the research challenges experienced so far, this paper provides a framework for designing Wireless Sensor Networks for agricultural monitoring in developing regions, taking into account all the particularities of such environments. In this framework, new solutions and research ideas are proposed for sensor network design to address the special challenges of the developing world. These include a zone-based joint topology control and power scheduling mechanism, a multi-sink architecture with associated back-link/storage aware complementary routing and a parameter-energy-environment aware task scheduling approach.
Users Take a Close Look at Visual Analytics
Authors: George Lawton
Venue: Computer (2009)

The need to more easily and effectively analyze the mountains of data that organizations are gathering and also to see their findings in ways that are simple to understand and work with has created a growing interest in visual analytics.
Programs as data for their help systems
Authors: Elaine A. Rich
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The goal of this research is to develop ways of representing the knowledge available to a help system in such a way that the system can actually reason with the knowledge rather than being restricted to simply retrieving and presenting stored answers to a restricted and anticipated class of questions. One kind of information that is useful to such an intelligent help system is knowledge of how the underlying system operates. This knowledge is contained in the code for the system. By exploiting system code as part of the help database, many problems of inconsistency between programs and their documentation can be avoided. In our initial investigations of this problem, we are representing the system code as a set of productions that are easier to manipulate than is code in most standard languages. As we develop techniques for answering questions by reasoning with knowledge about the system, we become increasingly able to answer the growing variety of questions that will occur as the language interface to a help system becomes more flexible.
Web based multilayered distributed SCADA/HMI system in refinery application
Authors: Adnan Salihbegovic, Vlatko Marinković, Zoran Cico, Elvedin Karavdić, Nina Delic
Venue: Computer Standards Interfaces (2009)

The paper describes system synthesis and architecture of a multilayered distributed SCADA/HMI system. The system is used for monitoring and control of refinery terminals for truck loading and oil products pipeline shipping. Network-centered, distributed PLC system with SCADA functions and several levels of fieldbuses, interconnected with the HMI part of the system is described first. Following is a brief description of the software tools used in the system design. Configuration and PLC controllers programming, data server configuration, operator panels design and way of managing the control system using a standard Web browser, e.g. Internet Explorer, are addressed. After examining the way specific customization is done, the paper focuses on establishing the link with icons on graphic panels that integrates all three levels of process control from Operator's panels.
Detection of multi-scale clusters in network space
Authors: Shino Shiode, Narushige Shiode
Venue: International Journal of Geographical Information Science (2009)

This paper proposes a new type of point-pattern analytical method, Network-Based Variable-Distance Clumping Method (NT-VCM), to analyse the distribution pattern of point objects and phenomena observed on a network. It is an extension of Planar Variable-Distance Clumping Method (PL-VCM) that was previously defined for point pattern analysis in Euclidian space. The purpose for developing NT-VCM is to identify point agglomerations across different scales called multi-scale network-based clumps among distributed points along a network. The paper first defines a network-based clump as a set of points where all its elements are found within a certain shortest-path distance from at least one other element of the same set. It then proposes NT-VCM as a technique to extract statistically significant multi-scale clumps on a network. The paper also proposes an efficient algorithm for computing NT-VCM, which involves the use of the Voronoi diagram, the Delaunay diagram and the minimum spanning tree that are adapted and newly extended for the purpose of analysis on a network. A comparative study of NT-VCM and PL-VCM using commercial facility data reveals a notable difference in the location as well as the size of the significant multi-scale clumps detected in the both cases. Results from the empirical study confirm that NT-VCM accounts for the actual network distance between the points, thus providing a more accurate description of point agglomerations along the network than PL-VCM does.
Introduction to simulation
Authors: Ricki G. Ingalls
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulation is a powerful tool if understood and used properly. This introduction to simulation tutorial is designed to teach the basics of simulation, including structure, function, data generated, and its proper use. The introduction starts with a definition of simulation, goes through a talk about what makes up a simulation, how the simulation actually works, and how to handle data generated by the simulation. Throughout the paper, there is discussion on issues concerning the use of simulation in industry.
Proceeding of the 14th international conference on Architectural support for programming languages and operating systems
Venue: Architectural Support for Programming Languages and Operating Systems (2009)

It is our pleasure to welcome you to the Fourteenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XIV). This year's symposium continues its tradition of being the premier forum for presentation of research results on leading edge issues that cross the boundaries of computer architecture, programming languages and compilers, and operating systems. The call for papers attracted abstracts from around the world and resulted in 113 full papers being submitted to the Program Committee (PC). This year we used Borbala Online Conference Services's CyberChairPRO submission and review software. Papers were submitted for double-blind review without authors' names or identifying information. PC members were limited to no more than two paper submissions; a total of 13 papers were submitted which had a PC members as a (co)author. The Program Chair assigned each paper to three reviewers from the PC and two external reviewers. 524 of the 543 assigned reviews were submitted, giving an impressive return rate of 96%. On papers where the Program Chair had a conflict-of-interest, Prof. Margaret Martonosi from Princeton chose the reviewer assignments and also ran the discussions at the PC meeting. Prior to the PC meeting, there was an author rebuttal period during which authors could see and respond to their reviews. The Program Committee met on Saturday, November 1, 2008 at the Chicago O'Hare Hilton. The PC discussed the most highly ranked 51 papers (including 10 PC papers) during the meeting. Each paper discussed had a PC member assigned as lead discussant. PC (co)authored papers were discussed as a group roughly midway through the meeting; these papers were held to a higher standard. The PC selected 29 papers (including 7 PC papers) for an acceptance rate of 25.7%. Seven of these papers were conditionally accepted with shepherding provided by a PC member to ensure that the final papers adequately addressed concerns expressed in the reviews. This year, for the first time, we decided to give a Best Paper Award selected by a sub-committee of the PC from papers nominated by the entire PC.
Fuzzy computational models for trust and reputation systems
Authors: Kamal K. Bharadwaj, Mohammad Yahya H. Al-Shamri
Venue: Electronic Commerce Research and Applications (2009)

In the recent past, a considerable research has been devoted to trust and reputation mechanisms to simplify complex transactions for open environments in social networking, e-commerce, and recommender systems (RS). In real life, we come to know about others through our social circle according to their reputation which is a public view. However, it is not always adequate to depend solely on the public view and therefore a trust measure is required to give a personalized view of the future encounters with a specific partner. In this paper, we propose fuzzy computational models for both trust and reputation concepts. Reciprocity and experience are used for trust modeling while the proposed reputation model is a fuzzy extension of beta reputation model. A two-level filtering methodology is proposed to benefit to a large extent from both the concepts separately. In order to justify the proposed models, we compared them with the existing reputation models for movie RS. The experimental results show that the incorporation of trust and reputation concepts into RS indeed improves the recommendation accuracy and establish that our models are better than beta and the popular eBay reputation models.
Traffic classification using en-semble learning and co-training
Authors: Haitao He, Chunhui Che, Feiteng Ma, Jun Zhang, Xiaonan Luo
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Classification of network traffic is the essential step for many network researches. However, with the rapid evolution of Internet applications the effectiveness of the port-based or payload-based identification approaches has been greatly diminished in recent years. And many researchers begin to turn their attentions to an alternative machine learning based method. This paper presents a novel machine learning-based classification model, which combines ensemble learning paradigm with co-training techniques. Compared to previous approaches, most of which only employed single classifier, multiple classifiers and semi-supervised learning are applied in our method and it mainly helps to overcome three shortcomings: limited flow accuracy rate, weak adaptability and huge demand of labeled training set. In this paper, statistical characteristics of IP flows are extracted from the packet level traces to establish the feature set, then the classification model is created and tested and the empirical results prove its feasibility and effectiveness.
Virtual Social Clubs: Meeting Places for the Internet Community
Authors: David Boyer, Mauricio Cortes, Michael Vernick, Sylvia Wilbur, Anjum Khan, Graeme Balfour
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper describes a system designed to support a range of virtual clubs, video-enabled meeting places on the Internet emulating a real-world club where friends, acquaintances and business colleagues meet in a social context. The distinguishing feature of virtual clubs is support for multiple, simultaneous group interaction, where users can move dynamically from one group to another, and participate in a range of activities. An architecture supporting application development has been implemented, incorporating session management software and a multipoint layered video. Features of the system include dynamic session management, flexible policy support, and novel user interfaces. Several virtual club applications are currently under development.
The simplex dispersion ordering and its application to the evaluation of human corneal endothelia
Authors: Guillermo Ayala, Miguel López-Díaz
Venue: Journal of Multivariate Analysis (2009)

A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Different analyses are included using an image database of human corneal endothelia.
Abstraction and extensibility in digital logic simulation software
Authors: Richard M. Salter, John L. Donaldson
Venue: ACM SIGCSE Bulletin (2009)

Students of Computer Organization should be able to "learn by doing" at all levels of computer design. Digital logic circuitry is frequently taught using simulation software, however such platforms are often limited to exposing only a narrow range of design levels. This paper describes how, in the new multilevel simulation system DLSim 3, we are able to incorporate abstraction and extensibility to present the many levels of complex circuit designs in a single environment: from low level combinational and sequential circuits, through models of complete CPUs. Among other features, DLSim 3 is able to accomplish this by providing three different types of circuit abstraction: cards, chips, and plug-ins. Using DLSim 3, students recognize the uniformity of system structure, as well as the principles of abstraction that link the various levels of design.
Timed trajectory generation using dynamical systems: Application to a Puma arm
Authors: Cristina Santos, Manuel Ferreira
Venue: Robotics and Autonomous Systems (2009)

We present an attractor based dynamics that autonomously generates trajectories with stable timing (limit cycle solutions), stably adapted to changing online sensory information. Autonomous differential equations are used to formulate a dynamical layer with either stable fixed points or a stable limit cycle. A neural competitive dynamics switches between these two regimes according to sensorial context and logical conditions. The corresponding movement states are then converted by simple coordinate transformations and an inverse kinematics controller into spatial positions of a robot arm. Movement initiation and termination is entirely sensor driven. In this article, the dynamic architecture was changed in order to cope with unreliable sensor information by including this information in the vector field. We apply this architecture to generate timed trajectories for a Puma arm which must catch a moving ball before it falls over a table, and return to a reference position thereafter. Sensory information is provided by a camera mounted on the ceiling over the robot. A flexible behavior is achieved. Flexibility means that if the sensorial context changes such that the previously generated sequence is no longer adequate, a new sequence of behaviors, depending on the point at which the changed occurred and adequate to the current situation emerges. The evaluation results illustrate the stability and flexibility properties of the dynamical architecture as well as the robustness of the decision-making mechanism implemented.
Min-Min Chromosome Genetic Algorithm for Load Balancing in Grid Computing
Authors: Wanneng Shu, Jiangqing Wang
Venue: International Journal of Distributed Sensor Networks (2009)

Load balancing is a very important and complex problem in grid computing. This paper studies Min-min chromosome genetic algorithm (MCGA) to gauge their suitability for solving grid load balancing problems. The effectiveness of the MCGA algorithm is shown for a number of test problems. Performance comparisons with Min-min, and genetic algorithm are also discussed.
The many views of a process: Toward a process architecture framework for product development processes
Authors: Tyson R. Browning
Venue: Systems Engineering (2009)

A product or system development process is a kind of complex system, arguably even more complex than the system it produces. Yet, the models and tools used by systems engineers and program managers to plan and manage technical work&mdash;such as process flowcharts, Gantt charts, work breakdown structures, and text-rendered procedures&mdash;are less sophisticated and capable than the ones used to design the product system. When used, the various process models are often challenged to incorporate and maintain synchronized program information&mdash;e.g., they may be created by different subgroups in a program and based on different assumptions, and they may diverge as a program proceeds. Recently, architecture frameworks (AFs) have been used to help manage the complexity in engineered systems. An AF provides a portfolio of views of a complex system, each of which describes it partially and in a format meaningful to its users and their particular needs. This paper proposes the application of AF concepts to the management of the work done to develop a complex system product. The pieces of work and their relationships constitute a complex process. A portfolio of integrated and synchronized views of a single process model would seem to be preferable to the current state&mdash;a number of disparate and uncoordinated management models. This paper introduces a new application of AFs to development processes and suggests this area as one for further research and development in the systems engineering community. &copy; 2008 Wiley Periodicals, Inc. Syst Eng
Robust detection of perceptually salient features on 3D meshes
Authors: Mao Zhihong, Cao Guo, Zhao Mingxi
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

Crest lines, curves on a surface along which the surface bends sharply, are powerful shape descriptors. Crest lines and their subsets have numerous applications in image analysis, face recognition, analysis and registration of anatomical structures, surface segmentation and non-photorealistic rendering. In this paper, a method is proposed for robust detection of crest lines. The proposed method is based on contextual information, the attributes of neighboring points. So it provides a basis of robustly detecting salient crest lines corresponding to potentially important features. Consequently, the algorithm is immune to noisy mesh and textured mesh with repeated bumps. Comparative results indicate that our algorithm yields favorable detection results and is effective.
An Expectation-Based Model of Web Search Behaviour
Authors: Anthony Cox, Maryanne Fisher
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

An important issue when evaluating a search tool is the satisfaction that is expressed by its users. While there are many factors that affect satisfaction, we believe that users' expectations affect their evaluation of a query's response, and in turn, their satisfaction. We validate this perspective by measuring individuals' expectation, judgement of response quality, and overall satisfaction for a set of queries. Our experiment indicates that, when responses are grouped according to whether they confirm or disconfirm users' expectations, expectation significantly correlates with both query response quality and user satisfaction. However, response quality better correlates with satisfaction than does expectation, suggesting that expectation is not the only factor that influences the determination of response quality.
Multi-objective optimization of TSK fuzzy models
Authors: O. Guenounou, A. Belmehdi, B. Dahhou
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper we propose a hybrid algorithm to optimize the structure of TSK type fuzzy model using backpropagation (BP) learning algorithm and non-dominated sorting genetic algorithm (NSGA-II). In a first step, BP algorithm is used to optimize the parameters of the model (parameters of membership functions and fuzzy rules). NSGA-II is used in a second phase, to optimize the number of fuzzy rules and to fine tune the parameters. A well known benchmark is used to evaluate performances of the proposed modelling approach, and compare it with other modelling approaches.
Embedded system design based on aspect-oriented executable UML
Authors: Akira Teruya, Eiichiro Iwata, Masahito Sugai, Masahiro Kimura, Nurul Azma Zakaria, Noriko Matsumoto, Norihiko Yoshida
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

System-level design methodology is one of the design paradigm for embedded systems. As embedded systems are getting much larger and more complex recently, the research to improve design productivity of system-level design is being required. In order to solve this issue, we have proposed a methodology of language independent system-level design using Executable UML (xUML) and a scheme for the procedure of stepwise refinement by the refactoring technique. However, the refactoring rules are informal and sometimes ambiguous because they are defined in a natural language. Consequently, we are aiming at formalizing the stepwise refinement procedure based on refactoring to automatize it. In this paper, we propose a formalization scheme based on the aspect-oriented technique to the system-level design in xUML.
A M-dimensional Sphere Multicast Rekeying Scheme
Authors: Hai-Tao Xie, Zong-Kai Yang, Yu-Ming Wang, Wen-Qing Cheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Based on analyzing three representative multicast rekeying scheme, such as LKH, OFT and OKD, in this paper, a M-dimensional sphere rekeying scheme for dynamics multicast is put forward. In this new scheme, GC (Group Key Controller) can utilize the cooperation of sibling nodes by one common father as rekeying, when new member joins in or old member leaves, all of sibling nodes will generate a new KEK (key encrypt key) of their father node. By this way, our scheme can improve communication cost special for member leaving, at the same time forward and backward security is ensured. Based on M-dimensional geometry sphere rekeying scheme, we put forward a batch rekeying scheme, by simulation, it is proved that the communication cost of rekeying is reduced, so this scheme can be used in the scene of large-scale dynamics multicast.
Commutativity and self-duality: Two tales of one equation
Authors: Koen C. Maes, Bernard De Baets
Venue: International Journal of Approximate Reasoning (2009)

The mathematical expressions for the commutativity or self-duality of an increasing [0,1]^2->[0,1] function F involve the transposition of its arguments. We unite both properties in a single functional equation. The solutions of this functional equation are discussed. Special attention goes to the geometrical construction of these solutions and their characterization in terms of contour lines. Furthermore, it is shown how 'rotating' the arguments of F allows to convert the results into properties for [0,1]^2->[0,1] functions having monotone partial functions.
CS1 laboratory: a software application
Authors: John Camden
Venue: Journal of Computing Sciences in Colleges (2009)

Traditional laboratory classes that accompany CS1 lecture courses provide a collection of short disjoint programming exercises designed to gain competence on a specific topic. This paper describes a CS1 lab curriculum that uses the labs to incrementally develop a functional software application while maintaining the development of the concepts and skills of traditional CS1 labs. The labs incorporate industry standards in software development. The results show that students develop better planning skills and development skills using this approach.