ppxscal/embedding_network huggingface dataset:
Farm price prediction using case-based reasoning approach-A case of broiler industry in Taiwan
Authors: M. L. Shih, B. W. Huang, Nan-Hsing Chiu, C. Chiu, W. Y. Hu
Venue: Computers and Electronics in Agriculture (2009)

Since Taiwan joined the World Trade Organization (WTO) in 2002, pricing decision has become more essential to the development of the broiler industry. The effective prediction of broiler prices is essential from the viewpoint of the agriculture authority and the Poultry Association, thus a more realistic broiler price structure can assist the government to manage the national production resources more effectively. This research proposes a weighted case-based reasoning (CBR) approach to construct a price prediction model. The genetic algorithm model was adopted to find out the most suitable feature weights for CBR. Previous local production data and economic indices, along with information about imported chicken, were collected to build the prediction model. The experimental results indicated that the proposed CBR approach could exhibit a better prediction performance than the ones exhibited by linear regression, regression tree, and neural nets approaches. The findings also revealed that broiler prices were mostly influenced by the prices of colorful broilers and chicks.
Is music downloading the new prohibition? What students reveal through an ethical dilemma
Authors: Shoshana Altschuller, Raquel Benbunan-Fich
Venue: Ethics and Information Technology (2009)

Although downloading music through unapproved channels is illegal, statistics indicate that it is widespread. The following study examines the attitudes and perceptions of college students that are potentially engaged in music downloading. The methodology includes a content analysis of the recommendations written to answer an ethical vignette. The vignette presented the case of a subject who faces the dilemma of whether or not to download music illegally. Analyses of the final reports indicate that there is a vast and inconsistent array of actions and underlying feelings toward digital music downloading. The findings reveal inconsistencies between participants' recommendations (what the subject should do) and their attitudes and opinions on the matter (what they would do in a similar situation). These inconsistencies support the notion that as technology evolves, it creates discrepancies between the way things are and the way the law expects them to be, leaving society in a muddle, trying to reconcile the two. What remains to be seen is whether the discrepancy in the case of music downloading becomes extreme enough that the law changes to accommodate an increasingly prevalent behavior, or whether new business models will emerge to bridge the gap between legality and reality.
Design of ARQ protocols for two-user cooperative diversity systems in wireless networks
Authors: Chao Zhang, Weidong Wang, Guo Wei
Venue: Computer Communications (2009)

Automatic repeat-request (ARQ) protocols for two-user cooperative diversity system employing Alamouti space-time coding are investigated in this paper. A whole cooperative transmit frame of an original cooperative system consists of three sub-frames. According to different feedback schedules in a transmit frame at the destination, two basic ARQ protocols, namely post-cooperating and pre-cooperating, are proposed and analyzed. We show that both proposed ARQ protocols can improve the throughput in two-user cooperative system. Pre-cooperating protocol yields 50% gains in users' throughput than post-cooperating protocol if both users have high user-destination average received signal-to-noise ratio (SNR) at the destination. Nevertheless, if both of user-destination average received SNRs are low, post-cooperating protocol is more effective than pre-cooperating protocol. Proposed protocols provide useful basic tools for designing more complicated ARQ protocols. Finally, simulation results verify our analysis.
Searching for a Visible, Lazy Fugitive
Authors: David Richerby, Dimitrios M. Thilikos
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Graph searching problems are described as games played on graphs, between a set of cops and a fugitive. Variants of the game restrict the abilities of the cops and the fugitive and the corresponding search numbers (the least number of cops that have a winning strategy) are related to several well-known parameters in graph theory. We study the case where the fugitive is visible (the cops' strategy can take into account his current position) and lazy (he moves only when the cops move to his position). Our results are stated and proven in a general setting where the fugitive's speed (i.e., the lengths of paths he can move along) can be unbounded or bounded by some constant. We give a min-max characterization of the corresponding parameters, which we show to be computable in polynomial time for fugitivess with unbounded speed and speed at most 3 and to be NP-complete for all other finite speeds. This is in contrast to the other standard versions of the game, where the parameters corresponding to fugitives with unbounded speed are NP-complete. Several consequences of our results are also discussed.
SIGCSE: from the beginnings to a bright future
Authors: Lillian N. Cassel, Richard H. Austing, Elliott Koffman
Venue: ACM SIGCSE Bulletin (2009)

This session proposal is part of the recognition of 40 years of SIGCSE. We will look at the organization itself, how it came to be and where it might be going. It will be an interactive session with the participation of the audience informing the SIGCSE leadership of appropriate directions for the future of this group that has been so important to computing education.
The optimum route problem by genetic algorithm for loading/unloading of yard crane
Authors: Youfang Huang, Chengji Liang, Yang Yang
Venue: Computers and Industrial Engineering (2009)

In recent years, the scale of container transportation and the size of vessels are becoming larger and larger; development of automatic container cranes becomes a necessity. As a key function of automatic control of unmanned cranes, the optimum route can minimize the cycle time by calculating the most efficient combination of horizontal and vertical motions of container loading/unloading. In this study, we have comprehensively studied various issues in the route planning in different fields. Later, the mathematical model based on the problem analysis of loading/unloading process was presented. Particularly, to solve the problem, an optimum route method based on genetic algorithm, which satisfies the criteria such as length, smooth degree and safety distance, was developed. Finally, the computational experiments testified the effectiveness of the algorithm and explored a new way to increase the efficiency of container loading/unloading process.
The DSS development system
Authors: Robert H. Bonczek, Nasir Ghiaseddin, Clyde W. Holsapple, Andrew B. Whinston
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

As decision support systems become more commonplace, the demand for automatic and semiautomatic DSS development systems increases proportionately. Such systems provide a set of tools that guide the construction of models in response to a user's query. This paper describes a set of such tools that provide capabilities for analysis, design, module management, and report and graphics generation.
Simulating order fulfillment and supply planning for a vertically aligned industry solution business
Authors: Feng Cheng, Young M. Lee, Hong Wei Ding, Wei Wang, Stuart Stephens
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We model supply chain of an industry solution equipment manufacturer, where the merchandise is sold worldwide, but suppliers are mostly located in Asia. The preferred shipment of supply is the ocean shipment, and it takes about 5 weeks. Premium air shipment can be used to expedite delivery, but it costs substantially higher. To hedge against variability of demand and to satisfy customer service level, a certain level of safety stock is needed but inventory carrying cost can be high. Therefore, a careful fulfillment strategy is very important to balance serviceability and cost. A supply chain simulation model is developed to analyze the order fulfillment and supply planning process for the business to identify efficient supply chain strategy. The model simulates and evaluates three key performance metrics; serviceability, inventory costs and premium transportation costs, and their interactions.
An Authenticated Paradigm for Mobile Agent System in Online Examination
Authors: Swe Zin Hlaing
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Mobile agents are active objects that can autonomously migrate in a heterogeneous network to perform tasks on behalf of their owners. Mobile agents also raise several security issues related to the protection of host resources and the data carried by an agent itself. In this paper, we present a framework which is concerned with creating Web-based services for Virtual Learning Environment (VLE) related to Student Assessment using mobile agent technology. In our system, agents protect their secured data by carrying their own protection mechanisms and communicate with multiple agents using a single server. This system improves traditional solutions, where protection was managed by the agent. The authentication of mobile agents is controlled by using digital signature and a Public Key Infrastructure. We have implemented this scheme in Mobile Aglet platform.
Using correlation engine and mobile agents for intrusion detection
Authors: Réginald Lips, Nabil El-Kadhi
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

IMAIDS project (Intelligent Mobile Agent for Intrusion Detection System) is carried out by five 5th year students, Réginald Lips, Nicolas Carlier, Damien Molot, Jean-Marie Peschoux and Alexandre Luciani, from Epitech (European Institute of Technology; http://www.epitech.net/), within the framework of their end of studies project. The purpose of this document is to present a part of our research project which is using an expert system as correlation engine and mobile agents for intrusion detection. This paper has been co-written by Réginald Lips, project leader of IMAIDS, Nabil El-Kadhi, director of the LERIA, and Davide Del Vecchio, senior security consultant for Telecom Italia. First, we will remind the goal and the general context of IMAIDS project, its objectives and the research topics aborded. Moreover, we will describe more in details the implementation and the theoretical basics of the expert system used to make a functionnal correlation engine applied to a mobile agent platform for intrusion detection.
Systematic applications of multivariate analysis to monitoring of equipment health in semiconductor manufacturing
Authors: A. G. Chao, S. T. Tseng, D. S. H. Wong, S. S. Jang, S. P. Lee
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this work, a systematic procedure of building a model for monitoring batch processes in semiconductor manufacturing and visualization of monitoring results will be presented. Semiconductor manufacturing batch-processing stages usually consist of many steps. Aging trends likely to be detected only in the steady state period of each step. Large fluctuations can be found in on-off period of each step. Hence "step-trend" variables, i.e. mean shifts from reference profiles of each steps, are defined to track aging trends. Residuals from this shifted profile are then used to provide a combined health index of each batch through Hotelling T2 analysis.
On the Unification of Process Semantics: Observational Semantics
Authors: David Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

The complexity of parallel systems has produced a large collection of semantics for processes. Van Glabbeek's linear time-branching time spectrum provides a classification of most of these semantics; however, no suitable unified definitions were available. We have discovered how to unify them, both in an observational framework and in an equational framework. In this first part of our study we present the observational semantics, that stresses the differences between the simulation (branching) semantics and the extentional (linear) semantics. As a result we rediscover the classification in van Glabbeek's spectrum and shed light on it, obtaining a framework where we can consider all the semantics in the spectrum at the same time. Also, we have discovered some "lost links" that correspond to semantics, possibly not too interesting (at the moment), that provide a clearer picture of the spectrum.
Note: A construction of the sporadic Suzuki graph from U3(4)
Authors: Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora
Venue: Journal of Combinatorial Theory Series A (2009)

In this paper, we consider the maximum coclique design of the sporadic Suzuki graph. Then we obtain the 3-(66,16,21) design with the automorphism group U"3(4):4. We construct this design as an extension of a 2-design which is described by the 2-transitive action of U"3(4) on the 65 isotropic points of the 3-dimensional unitary space over F"1"6. Further, by using this design, we give a new construction of the sporadic Suzuki graph.
Performance analysis of evolving wireless IEEE 802.11 security architectures
Authors: Andrew Gin, Ray Hunt
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Degradation in performance has been a common reason for the limited use of security in Wireless LAN equipment such as wireless PCs and embedded devices such as PDAs. However, such performance has depended in part upon the technical options chosen for encryption, authentication and re-keying. Thus this paper describes the performance analysis and empirical measurement of a range of security levels based upon variations of WEP, WPA and WPA2 in a variety of Wireless LAN architectures. The paper provides an analysis of performance measured over a range of experiments run on a testbed and builds upon previous work on performance analysis of earlier wireless network security protocols.
Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs
Authors: Nan Guan, Zonghua Gu, Wang Yi, Ge Yu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Synchronous Dataflow (SDF) is a well-known model of computation for dataflow-oriented applications such as embedded systems for signal processing and multimedia. It is important to minimize the buffer size requirements of applications generated from SDF graphs, since memory space is often a scarce resource in these systems due to cost or power consumption constraints. Some authors have proposed to use model-checking for finding the minimum buffer size requirements, but the scalability of model-checking is limited by state space explosion. In this paper, we present several techniques for reducing state space size and improving scalability of model-checking by exploiting problem-specific properties of SDF graphs.
Seven-segment input 7SI: evaluation exp&eacute;rimentale dans des situations d&eacute;grad&eacute;es de mobilit&eacute;
Authors: Khaldoun Al Faraj, Nadine Vigouroux, Mustapha Mojahid
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This article briefly presents our new gestural system for mobile text entry, called Seven-Segment Input 7SI. It is based on crossing character glyphs, and giving an intuitive representation of letters and numbers through a basic configuration of seven segments. We describe an experimental evaluation of 7SI system, conducted in two different contexts: desktop and mobility. The first results show that user achieved an input rate of 20.09 WPM. Moreover, 7SI system is natural and easy to learn, subject accomplished all of the testing sessions without needing the character chart.
Practicability Study on the Improvement of the Indoor Location Tracking Accuracy with Active RFID
Authors: Pang-Wei Hsu, T. H. Lin, Herbert H. Chang, Y. T. Chen, C. Y. Yen, Y. J. Tseng, C. T. Chang, H. W. Chiu, C. H. Hsiao, P. C. Chen, L. C. Lin, Hanna S. Yuan, Woei C. Chu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The proliferation of communication and mobile computing devices and local-area wireless networks has cultivated a growing interest in location-aware systems and services. An essential problem in location-aware computing is the determination of physical locations. RFID technologies are gaining much attention as they are attractive solutions to indoor localization applications. In this paper, we propose a new indoor locating system based on the received signal strength intensity. The proposed algorithm introduced a signal strength preprocessing step to improve the accuracy of existing techniques. We investigate optimal parameters in terms of reader and reference tag properties through computer simulations. A new configuration in placing reference tags on the perimeter of a sensing area is also introduced. Comparing with other methods, our experimental results indicate that proposed system achieved more accurate localization with fewer reference tags needed.
Application of neural networks and genetic algorithms to the screening for high quality chips
Authors: Chenn-Jung Huang, You-Jia Chen, Chi-Feng Wu, Yi-An Huang
Venue: Applied Soft Computing (2009)

During electrical testing, each die on a wafer must be tested to determine whether it functions as originally designed. For a clustered defect on a wafer, for example scratches, stains, or localized failure patterns, defective dies in the flawed area may not all be detected during the electrical testing stage. To prevent the defective dies from proceeding to the final assembly, the testing factory must assign some workers to identify patterns in the layout of defective dies for labeling other potential defects. Although a previously developed defect detection program enables full automation of the testing process in a testing factory, numerous defective dies in recognized clusters are not picked out, or in some clusters are even not captured in certain circumstances. This work thus proposes two automatic wafer-scale defect cluster identifiers, which utilize neural networks and genetic algorithms for detecting the defect clusters, and compares them with that presented in our earlier work. The experimental results confirm that both of the proposed algorithms are more effective in identifying defect clusters than the defect detection program presently used by the testing factory.
Another look at the behaviors of novice programmers
Authors: James B. Fenwick,  Jr., Cindy Norris, Frank E. Barry, Josh Rountree, Cole J. Spicer, Scott D. Cheek
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper reports on the progress of an NSF funded research project investigating the development practices of students in introductory programming courses. In previous work, we describe our extension of the BlueJ IDE to capture events associated with program development. Here we report on data collected during the Fall 2007 and Spring 2008 semesters on CS 1 students. In particular, we show that our data analysis independently confirms the results obtained in separate studies by Jadud [3, 2]. In addition we use our empirical evidence to discern some higher level "patterns" of beginning student programming behaviors including potential cheating and the impact on success of students starting projects late.
Graph Layout Problems Parameterized by Vertex Cover
Authors: Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out to be fixed parameter tractable when parameterized by treewidth. However, Graph Layout problems are a notable exception. In particular, no fixed parameter tractable algorithms are known for the Cutwidth, Bandwidth, Imbalance and Distortion problems parameterized by treewidth. In fact, Bandwidth remains NP-complete even restricted to trees. A possible way to attack graph layout problems is to consider structural parameterizations that are stronger than treewidth. In this paper we study graph layout problems parameterized by the size of the minimum vertex cover of the input graph. We show that all the mentioned problems are fixed parameter tractable. Our basic ingredient is a classical algorithm for Integer Linear Programming when parameterized by dimension, designed by Lenstra and later improved by Kannan. We hope that our results will serve to re-emphasize the importance and utility of this algorithm.
The Coding Complexity of L&#x00e9;vy Processes
Authors: Frank Aurzada, Steffen Dereich
Venue: Foundations of Computational Mathematics (2009)

We introduce a new coding scheme for general real-valued L&#x00e9;vy processes and control its performance with respect to L p [0,1]-norm distortion under different complexity constraints. We also establish lower bounds that prove the optimality of our coding scheme in many cases.
Factor structure of web site creativity
Authors: Liang Zeng, Gavriel Salvendy, Min Zhang
Venue: Computers in Human Behavior (2009)

The objective of this study is to develop an instrument measuring user-assessment of web site creativity and then to investigate the impacts of web site creativity on user behavior. A conceptual model for user perception and response to web site creativity was constructed and the initial Web Site Creativity Measurement Instrument was developed, whose construct validity was based on the literature. This instrument was then administered via a survey (N=289) with satisfactory internal consistency. The results of factor analysis indicated a refined instrument with seven factors (28 items): Aesthetic Appeal, Interactivity, Novelty and Flexibility, Affect, Importance, Commonality and Simplicity, and Personalization, which explained 63% of the total variance. Stepwise regressions further identified important factors in predicting the user's attitude and behavior towards web site creativity. 62% of the total variance regarding the prediction of the user's overall preference towards creative web sites was explained by significant factors. Guidelines and checklist for creative web site design were also developed based on the refined instrument.
Designing pen-and-paper user interfaces for interaction with documents
Authors: Jürgen Steimle
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Despite numerous predictions of the paperless office, knowledge work is still characterized by the combined use of paper and digital documents. Digital pen-and-paper user interfaces bridge the gap between both worlds by electronically capturing the interactions of a user with a pen on real paper. The contribution of this paper is two-fold: First, we introduce an interaction framework for pen-and-paper user interfaces consisting of six core interactions. This helps both in analyzing existing work practices and interfaces and in guiding the design of interfaces which offer complex functionality and nevertheless remain simple to use. Second, we apply this framework and contribute three novel pen-and-paper interaction strategies for creating hyperlinks between printed and digital documents and for tagging both types of documents.