ppxscal/embedding_network huggingface dataset:
A Path Selection Algorithm with Energy Efficiency for Wireless Sensor Networks
Authors: Inwhee Joe
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A wireless sensor network consists of a large number of sensor nodes that are spread densely to observe the phenomenon. The whole network lifetime relies on the lifetime of each sensor node. If one node dies, it could lead to a separation of the sensor network. Thus each and every sensor node should live long to extend the lifetime of the wireless sensor network. In this paper, we propose a path selection algorithm with energy efficiency for wireless sensor networks. The key idea in the algorithm is that all the paths are utilized evenly and the paths with enough available energy are selected, so that the network lifetime can be maximized. To evaluate its performance, some simulations are carried out. In conclusion, we find out that our protocol is more efficient than the other routing protocols in terms of energy.
Evaluating a distributed physical leisure game for three players
Authors: Florian 'Floyd' Mueller, Martin R. Gibbs
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Physical leisure activities such as table tennis provide healthy exercise and can offer a means to connect with others socially; however, players have to be in the same physical location to play. We have developed a networked table tennis-like game that is played with a real paddle and ball, augmented with a large-scale videoconference. Unlike existing commercial console games that encourage physical activity, our system supports social interaction through an audio and video communication channel, offers a familiar gaming interface comparable to a traditional leisure game, provides non-virtual force feedback and can be enjoyed by players in three geographically separate locations simultaneously. We are presenting results from an empirical evaluation of "Table Tennis for Three" with 41 participants. The players reported that they had fun, used the game to build social rapport and experienced a sense of playing "together". Some participants did not enjoy the game, and we present informed opinions to explain their reactions. With our work, we provide other HCI researchers with a further example of an evaluation of a novel type of experience that lies in the realms of physical activity, fun and social interactions. We hope we can inspire designers to consider our results in their future game designs by looking at the characteristics of traditional physical leisure games to promote similar benefits such as exercise, enjoyment and bringing people together to socialize.
Reasoning about the behavior of Semantic Web services with concurrent transaction logic
Authors: Dumitru Roman, Michael Kifer
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The recent upsurge in the interest in Semantic Web services and the high-profile projects such as the WSMO, OWLS, and SWSL, have drawn attention to the importance of logic-based modeling of the behavior of Web services. In the context of Semantic Web services, the logic-based approach has many applications, including service discovery, service choreography, enactment, and contracting for services. In this paper we propose logic-based methods for reasoning about service behavior, including the aforementioned choreography, contracting, and enactment. The formalism underlying our framework is Concurrent Transaction Logic---a logic for declarative specification, analysis, and execution of database transactions. The new results include reasoning about service behavior under more general sets of constraints and extension of the framework towards conditional control and data flow---two crucial aspect that were missing in previous logical formalizations.
An overview of evolutionary algorithms for parameter optimization
Authors: Thomas Bäck, Hans-Paul Schwefel
Venue: Evolutionary Computation (1993)

Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs), evolutionary programming (EP), and genetic algorithms (GAs). The comparison is performed with respect to certain characteristic components of EAs: the representation scheme of object variables, mutation, recombination, and the selection operator. Furthermore, each algorithm is formulated in a high-level notation as an instance of the general, unifying basic algorithm, and the fundamental theoretical results on the algorithms are presented. Finally, after presenting experimental results for three test functions representing a unimodal and a multimodal case as well as a step function with discontinuities, similarities and differences of the algorithms are elaborated, and some hints to open research questions are sketched.
Determination the Number of Hidden Nodes of Recurrent Neural Networks for River Flow and Stock Price Forecasting
Authors: Suwarin Pattamavorakun, Suwat Pattamavorakun
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The classic approach to time series forecasting is to undertake an analysis of the time series data. Recurrent neural networks (RNNs) are designed to learn sequential or time-varying patterns. Due to their dynamic nature, so RNNs are suitable for time series forecasting. As the number of nodes in the input and output layers are application -- dependent, the problem reduces to how to optimally choose the number of hidden nodes. This is achieved by using the Bayesian Information Criterion via the number of hidden nodes of recurrent neural network. It is also proved that there is a close link between the Bayesian Information Criterion and Efficiency Index, which indicates how good the model when it is used for the river flow and stock price data set.
A Hardware/Software Co-reconfigurable Multimedia Architecture
Authors: Yong-Kyu Jung
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

The hardware/software co-reconfiguration technique is introduced to design a reconfigurable multimedia architecture that does not employ field-programmable devices. This co-reconfiguration technique does not require modifying existing compilers to retarget their new multimedia processors. This technique allows software developers to rapidly retarget their multimedia processors. In order to present the reconfiguration procedures and performance evaluations of the technique, a smart instruction decoder for Texas Instruments OMAP2420 was implemented and optimized
A Right Coprime Factorization of Neural State Space Models
Authors: Jan Bendtsen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In recent years, various methods for identification of nonlinear systems in closed loop using open-loop ap- proaches have received considerable attention. However, these methods rely on differentially coprime factorizations of the nonlinear plants, which can be difficult to compute in practice. To address this issue, this paper presents various technical results leading up to explicit formulae for right coprime factorizations of neural state space models, i.e., nonlinear system models represented in state space using neural networks, which satisfy a Bezout identity.
On a Class of Recursive Algorithms for Continuous Estimation of the Mean
Authors: C. G. Aminoff
Venue: IEEE Transactions on Computers (1974)

In this correspondence a class of algorithms for recursive estimation of the mean of a random yariable is described and its properties are studied. New algorithms are presented that are shown to be statisticaily more efficient than the previous algorithms, and only slightly less efficient than the optimal algorithm of the same type. The computation time remains the same as in the best previous algorithm, whereas the optimal algorithm implies a considerably longer computation time.
Note on a Class of Statistical Recognition Functions
Authors: T. Ito
Venue: IEEE Transactions on Computers (1969)

Statistical recognition procedures can be derived from the functional form of underlying probability distributions. Successive approximation to the probability function leads to a class of recognition procedures. In this note we give a hierarchical method of designing recognition functions which satisfy both the least-square error property and a minimum decision error rate property, although our discussions are restricted to a binary measurement space and its dichotomous classification.
Geographic information technologies, structuration theory, and the world trade center crisis
Authors: Teresa M. Harrison, Theresa Pardo, J. Ramon Gil–Garcia, Fiona Thompson, Dubravka Juraga
Venue: Journal of the American Society for Information Science and Technology (2007)

Advocates of geographic information technologies (GIT) have long claimed significant advantages to bringing a spatially oriented perspective to bear on organizational and policy decision making, however, for a variety of reasons, these advantages have been more difficult to realize in practice than might be supposed. In this article, we argue that awareness and appreciation of the potential value of GIT changed dramatically as a result of the World Trade Center (WTC) attacks on September 11, 2001. We use a structurationist theoretical perspective to show that GITs were &ldquo;enacted&rdquo; in a variety of novel ways by social actors thrust together by the demands of the crisis to form interorganizational systems, and we illustrate this process through three extended examples of GIT adaptation and innovation during the crisis. One lasting consequence of this episode is that GITs have moved from serving as a relatively static reference tool to a dynamic decision-making tool for emergency situations. We conclude by suggesting that the crisis was a catalyst for change in the use of GIT and, reciprocally, in the social structures in which GIT will be deployed in the future. &copy; 2007 Wiley Periodicals, Inc.
Teaching Wireless Sensor Networks at the University of Melbourne
Authors: Egemen Tanin
Venue: IEEE Distributed Systems Online (2007)

Wireless sensor networks attracted significant interest from both computer science academia and industry. The University of Melbourne's Master of Engineering in Distributed Computing program offers a related course, Sensor Networks and Applications. This course introduces students to WSNs, including network setup, data collection and processing, and software engineering.
Formal Grammar and Human Factors Design of an Interactive Graphics System
Authors: P. Reisner
Venue: IEEE Transactions on Software Engineering (1981)

Formal grammatical description has not generally been applied in the human factors area, which traditionally draws on behavioral science for its methodology. This paper illustrates, by means of a detailed example, how formal grammatical description can be used as a predictive tool to compare alternative designs for ease of use and to identify design choices which could cause users to make mistakes.
TCP with gateway adaptive pacing for multihop wireless networks with Internet connectivity
Authors: Sherif M. ElRakabawy, Alexander Klemm, Christoph Lindemann
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

This paper introduces an effective congestion control pacing scheme for TCP over multihop wireless networks with Internet connectivity. The pacing scheme is implemented at the wireless TCP sender as well as at the Internet gateway, and reacts according to the direction of TCP flows running across the wireless network and the Internet. Moreover, we analyze the causes for the unfairness of oncoming TCP flows and propose a scheme to throttle aggressive wired-to-wireless TCP flows at the Internet gateway to achieve nearly optimal fairness. The proposed scheme, which we denote as TCP with Gateway Adaptive Pacing (TCP-GAP), does not impose any control traffic overhead for achieving fairness among active TCP flows and can be incrementally deployed since it does not require any modifications of TCP in the wired part of the network. In an extensive set of experiments using ns-2 we show that TCP-GAP is highly responsive to varying traffic conditions, provides nearly optimal fairness in all scenarios and achieves up to 42% more goodput for FTP-like traffic as well as up to 70% more goodput for HTTP-like traffic than TCP NewReno. We also investigate the sensitivity of the considered TCP variants to different bandwidths of the wired and wireless links with respect to both aggregate goodput and fairness.
Using NARX Neural Network Based Load Prediction to Improve Scheduling Decision in Grid Environments
Authors: Jin Huang, Hai Jin, Xia Xie, Qin Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In grid environment, applications are in active competition with unknown background workloads introduced by other users. To achieve good performance, performance models are used to predict the possible status of the resources, and to make decisions of the selection of a performance-efficient application execution strategy. In this paper, we present a scheduling decision method that utilizes the NARX neural network based load prediction to define data mappings appropriate for dynamic resources. This method uses the information of the predicted CPU load interval and variance of future resource capabilities to obtain the CPU load decision, which can be used to guide the scheduling decision. As to the predictor used here, the NARX neural network based predictor learns the model of the system from the external input information and the system itself. It inherits the mapping capability of feed forward networks and, at the same time, captures the dynamic features of load information. In this work, our predictor shows good performance for time series prediction.
A High-Performance Workstation Using a Closely Coupled Architecture
Authors: Bruce Hamilton, Michael Fischer
Venue: IEEE Computer Graphics and Applications (1984)

The Syte workstation architecture closely couples the graphics system and the processor to improve interactive performance and reduce hardware and software overhead without added support mechanisms.
Rough Set Approach for Processing Information Table
Authors: E. Xu, Tong Shaocheng, Shao Liangshan, Ye Baiqing
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To deal with the problem of completing the information table, a new method was studied and proposed. First, define discernible vector and its addition rule by the indiscernible relation in rough set. Second, scan discernible vectors just only one time by the discernible vector addition rule in order to obtain the core attribute set and the important attributes. Then obtain a reduced attribute set by deleting redundant attributes. Finally, according to the dependence relation of condition and decision attributes, select the important breaking points,and complete the information table with the constraints of classification quality. The illustration and experiment results indicate that the method is effective and efficient.
Efficient LCA based keyword search in xml data
Authors: Yu Xu, Yannis Papakonstantinou
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Keyword search in XML documents based on the notion of lowest common ancestors (LCAs) and modifications of it has recently gained research interest [2, 3, 4]. In this paper we propose an efficient algorithm called Indexed Stack to find answers to keyword queries based on XRank's semantics to LCA [2]. The complexity of the Indexed Stack algorithm is O(kd|S1|\log|S|) where k is the number of keywords in the query, d is the depth of the tree and |S1 | (|S|) is the occurrence of the least (most) frequent keyword in the query. In comparison, the best worst case complexity of the core algorithms in [2] is O(kd|S|). We analytically and experimentally evaluate the Indexed Stack algorithm and the two core algorithms in [2]. The results show that the Indexed Stack algorithm outperforms in terms of both CPU and I/O costs other algorithms by orders of magnitude when the query contains at least one low frequency keyword along with high frequency keywords.
Electronic Disks in the 1980's
Authors: R. R. Martin
Venue: Computer (1975)

In forecasting future types and uses of electronic disks one must consider processing unit architecture and software systems, as well as trends in computer memory technologies. This paper will concentrate on projections of memory technology, including computer architecture and software trends where relevant to these projections. Technologies which have the potential to result in standard commercial products are addressed rather than those which will result only in laboratory prototypes or militarized equipments designed for unique application environments. For example, a technology which may be uniquely suited for space applications may be much too expensive to compete as a commercial product. Bit densities, costs, access times, and other characteristics have been projected as representative of products which are in production, are available in quantity from several vendors, and are therefore competitively priced.
Level of Internet use by Chinese businesses: A preliminary study
Authors: Xibao Zhang, Cynthia Moussi
Venue: Electronic Commerce Research and Applications (2007)

A preliminary study of the level of Internet use by Chinese firms was carried out. Data were collected by a questionnaire survey of a convenience sample of Chinese managers. The major finding is that firm size plays a role only in influencing a firm's decision regarding whether or not to have Internet access. Within the Internet-using sub-sample, firm size is not significantly related to the overall level of Internet use, or to the use of individual Internet features. In addition, the data reveal that there are a high proportion of Chinese businesses that have Internet access. Chinese Internet using firms use an average of three features, with e-mail and buying and selling online being the two most widely used features. The results are also compared to similar studies in other countries. The limitations of this study and future research are discussed.
Apply Heuristic Search to Discover a New Winning Solution in Hex Game
Authors: Jing Yang, Simon Liao, Mirek Pawlak
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In certain games such as Hex, human experts are still much stronger than the best existing computer programs. By combining human Hex experts' excellent "sense" of good and bad opening moves and our newly developed search algorithms, knowledge representations, and detailed rules, this paper describes a new Hex solver. As the result, a new winning solution on 8×8 Hex board has discovered with the first move at F3.
Visualize and open up
Authors: Michela Pedroni, Till G. Bay
Venue: Informatics in education (2007)

Motivating students of the Nintendo generation for Computer Science can only be achieved by providing them with an exiting and fresh CS1 course. The article describes the experience of redesigning the introductory programming course at ETH Zurich and shows how the combination of state-of-the-art visualizations with open project assignments enlivens students' enthusiasm for programming. It shows the setup and the involved libraries, provides example applications that were built in the course, and presents the data gathered in the evaluation of the open assignment.
Robust H Infinity Control for Fuzzy Descriptor Systems with Time-Varying Delay and Parameter Uncertainties
Authors: Weihua Tian, Huaguang Zhang, Xiumin Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper investigates the problems of robust quadratic stability and robust H_\infty control for a class of fuzzy descriptor systems with time-varying delay and parameter uncertainties. A new Takagi-Sugeno fuzzy descriptor system model with disturbance is proposed. The regularity, impulse free and quadratic stability for the system are defined. A state feedback H \infty controller is determined, which ensures that the closed system is quadratically stable and guarantees the H_\infty performance. A sufficient condition for the solvability of this problem is presented in terms of linear matrix inequalities (LMIs). Finally, a numerical example is provided to demonstrate the application of the proposed method.
Automated statistics collection in DB2 UDB
Authors: A. Aboulnaga, P. Haas, M. Kandil, S. Lightstone, G. Lohman, V. Markl, I. Popivanov, V. Raman
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably long query processing times. Configuration and maintenance of these statistics has traditionally been a time-consuming manual operation, requiring that the database administrator (DBA) continually monitor query performance and data changes in order to determine when to refresh the statistics values and when and how to adjust the set of statistics that the DBMS maintains. In this paper we describe the new Automated Statistics Collection (ASC) component of IBM® DB2® Universal DatabaseTM (DB2 UDB). This autonomic technology frees the DBA from the tedious task of manually supervising the collection and maintenance of database statistics. ASC monitors both the update-delete-insert (UDI) activities on the data as well as query feedback (QF), i.e., the results of the queries that are executed on the data. ASC uses these two sources of information to automatically decide which statistics to collect and when to collect them. This combination of UDI-driven and QF-driven autonomic processes ensures that the system can handle unforeseen queries while also ensuring good performance for frequent and important queries. We present the basic concepts, architecture, and key implementation details of ASC in DB2 UDB, and present a case study showing how the use of ASC can speed up a query workload by orders of magnitude without requiring any DBA intervention.
Groups of Adjacent Contour Segments for Object Detection
Authors: V. Ferrari, L. Fevrier, F. Jurie, C. Schmid
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

We present a family of scale-invariant local shape features formed by chains of k connected, roughly straight contour segments (kAS), and their use for object class detection. kAS are able to cleanly encode pure fragments of an object boundary, without including nearby clutter. Moreover, they offer an attractive compromise between information content and repeatability, and encompass a wide variety of local shape structures. We also define a translation and scale invariant descriptor encoding the geometric configuration of the segments within a kAS, making kAS easy to reuse in other frameworks, for example as a replacement or addition to interest points. Software for detecting and describing kAS is released on lear.inrialpes.fr/software. We demonstrate the high performance of kAS within a simple but powerful sliding-window object detection scheme. Through extensive evaluations, involving eight diverse object classes and more than 1400 images, we 1) study the evolution of performance as the degree of feature complexity k varies and determine the best degree; 2) show that kAS substantially outperform interest points for detecting shape-based classes; 3) compare our object detector to the recent, state-of-the-art system by Dalal and Triggs [4].