ppxscal/embedding_network huggingface dataset:
Testing Architectures for Large Scale Systems
Authors: Eduardo Cunha Almeida, Gerson Sunyé, Patrick Valduriez
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Typical distributed testing architectures decompose test cases in actions and dispatch them to different nodes. They use a central test controller to synchronize the action execution sequence. This architecture is not fully adapted to large scale distributed systems, since the central controller does not scale up. This paper presents two approaches to synchronize the action execution sequence in a distributed manner. The first approach organizes the testers in a B-tree manner synchronizing through messages exchanged among parents and children. The second approach synchronizes through gossiping messages exchanged among consecutive testers. We compare these two approaches and discuss their advantages and drawbacks.
Interactive computer program for optimal designs of longitudinal cohort studies
Authors: Fetene B. Tekle, Frans E. S. Tan, Martijn P. F. Berger
Venue: Computer Methods and Programs in Biomedicine (2009)

Many large scale longitudinal cohort studies have been carried out or are ongoing in different fields of science. Such studies need a careful planning to obtain the desired quality of results with the available resources. In the past, a number of researches have been performed on optimal designs for longitudinal studies. However, there was no computer program yet available to help researchers to plan their longitudinal cohort design in an optimal way. A new interactive computer program for the optimization of designs of longitudinal cohort studies is therefore presented. The computer program helps users to identify the optimal cohort design with an optimal number of repeated measurements per subject and an optimal allocations of time points within a given study period. Further, users can compute the loss in relative efficiencies of any other alternative design compared to the optimal one. The computer program is described and illustrated using a practical example.
Developing, Implementing and EvaluatingComputer-Based Instruction: At Indiana State University,Terre Haute, Indiana
Authors: Smitha Edulakanti Mohan Reddy
Venue:  (2008)

In todays mobile world, society needs mobileeducation. The conventional system of education wasdesigned in the industrial age, but needs arechanging. To meet the needs of this generation, thepresent system of education must be renovated. Thisstudy suggests computer-based instruction as asolution. The study aims to investigate if there areany significant differences in the final learningoutcomes between those students who participated in acomputer-based instruction model and those studentswho participated in a traditional instruction modelfor a course at the College of Education of IndianaState University in the fall of 2007.
The Digital Album: A Personal File-tainment System
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Kiyoshi Matsumoto Data Storage & Retrieval Systems Division, Hitachi, Ltd. We describe the Digital Album: a personal File-tainment system that allows users to enjoy multimedia data as well as file and retrieve them. This system incorporates an album metaphor which imitates a photo album and features pseudo-3D page-turning animation. Stories described in this album metaphor entertain users. We also adopt a multiview classification scheme in which each data item is registered to any nodes in multiple classification hierarchies. The system is suitable for filing and retrieving multimedia data visually and bibliographically. Moreover, users can enjoy creating their own albums based on the classification easily and dynamically. The album metaphor is used as a PhotoCD user interface in Hitachi's multimedia products. 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
A chance to learn: On matching probabilities to optimize utilities
Authors: Kevin J. Burns, Heath A. Demaree
Venue: Information Sciences: an International Journal (2009)

All choices under uncertainty can be modeled as attempts to maximize expected utility. Yet many studies show that human choices do not maximize expected economic utility. Here we investigate one such behavior, known as ''probability matching'', and demonstrate that it maximizes an ecologic utility that goes beyond economic utility. To start we present data from a psychological experiment on a game of chance discovery called ''Iowa Gambling''. We then derive a mathematical model of game-playing behavior that optimizes ecologic utility, which includes informatic utility in learning and ergonomic utility in effort - as well as economic utility in earning. The model offers a good fit to the data, which supports our claim that human choices are made to optimize a combination of utilities that go beyond just economic utility. To close, we explore applications of probability matching to real-world situations of chance discovery such as web surfing and war fighting.
Tight results for clustering and summarizing data streams
Authors: Sudipto Guha
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center clustering. We provide a simple framework that improves upon all previous algorithms on these problems in either the space bound, the approximation factor or the running time. The framework uses a notion of "streamstrapping" where summaries created for the initial prefixes of the data are used to develop better approximation algorithms. We also prove the first non-trivial lower bounds for these problems. We show that the stricter requirement that if an algorithm accurately approximates the error of every bucket or every cluster produced by it, then these upper bounds are almost the best possible. This property of accurate estimation is true of all known upper bounds on these problems.
Selection of Robots for Task Assignment
Authors: B. B. Choudhury, B. B. Biswal
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Robot selection is one of the critical issues in the design of robotic work cells. Robot selection for an application is generally done based on experience, intuition and at most using the kinematic considerations like workspace, manipulability, etc. This problem has become more difficult in recent years due to increasing complexity, available features, and facilities offered by different robotic products. A systematic procedure is developed for selection of robot manipulators based on their different pertinent attributes. The robot selection procedure allows rapid convergence from a very large number of candidate robots to a manageable shortlist of potentially suitable robots. Subsequently, the selection procedure proceeds to rank the alternatives in the shortlist by employing different attributes based specification methods. This is an attempt to create exhaustive procedure by identifying maximum possible number of attributes for robot manipulators. The coding scheme and the selection procedures are illustrated with example.
Practical CMOS microprocessor systems
Authors: Bill Huston
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Many have felt that complementary metal-oxide silicon (CMOS) has not yet become a practical semiconductor technology for microprocessor-based systems. Recent progress has made that impression obsolete. A selection of CMOS microprocessors is available at speeds matching N-channel metal-oxide silicon microprocessor units (NMOS MPUs). CMOS memories have also become broadly available in the last few years. The needed peripheral circuits are now appearing. A CMOS parallel interface peripheral provides 24 interface pins and is bus-compatible with practically all the new-generation CMOS microprocessors. The last element needed to assemble practical all-CMOS microprocessor systems are the small-scale integration/medium-scale integration (SSI/MSI) logic functions. Gates, decoders, latches, and flip-flops are typically needed to operate a bus structure of a multichip system. This report concentrates on the newest methods of achieving a full-performance all-CMOS microprocessor system. The focus is on the parallel interface peripheral and on using CMOS logic functions in practical bus connections. 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
GEO based mobile communication of the near future - BFN and packet switch on the ETS-VIII satellite
Authors: Shin’ichi Hama, Yasushi Matsumoto, Shin’ichi Taira
Venue: Space Communications (1998)

R&D on a mobile communication system with S-band using a geostationary earth orbit satellite is being carried out in Japan. Its communication and broadcasting mission will be loaded on the Engineering Test Satellite VIII (ETS-VIII), which will be launched in 2002, and related experiments are planned for the following three years. In order to achieve seamless data communication with IMT-2000 (International Mobile Telecommunications-2000)-based users, we set a target whereby voice communication and low speed data communication would be possible using a hand-held terminal, and high-speed data communication and packet communication would be possible using a terminal on a car. To achieve the mission, developments such as a large on-board deployable reflector are necessary. Here we focus the discussion on the antenna feed system and the packet switching system which are being developed in Japan in the Communications Research Laboratory.
Towards Goal-Driven Self Optimisation of Service Based Applications
Authors: Andreas Gehlert, André Heuer
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

Service based applications are constructed to be easily adaptable to changing environments. This adaptation was primarily investigated with respect to monitoring events, e. g., a service based application is adapted when the execution of a service fails. In this paper we focus on the adaptation of service based applications due to newly available service. In this respect we discuss whether a service of the service based application should be replaced by a service, which becomes available. From the requirements engineering perspective we argue that a service based application may be adapted when the new services contribute better to the goals of the service based application. In addition, we show that it may also be valuable to adapt a service based application when newly available services provide more functionality than the ones previously used. Both analyses are based on model comparison techniques with Tropos goal models and Tropos' reasoning techniques.
Multitasking across generations: Multitasking choices and difficulty ratings in three generations of Americans
Authors: L. Mark Carrier, Nancy A. Cheever, Larry D. Rosen, Sandra Benitez, Jennifer Chang
Venue: Computers in Human Behavior (2009)

This study investigated whether changes in the technological/social environment in the United States over time have resulted in concomitant changes in the multitasking skills of younger generations. One thousand, three hundred and nineteen Americans from three generations were queried to determine their at-home multitasking behaviors. An anonymous online questionnaire asked respondents to indicate which everyday and technology-based tasks they choose to combine for multitasking and to indicate how difficult it is to multitask when combining the tasks. Combining tasks occurred frequently, especially while listening to music or eating. Members of the ''Net Generation'' reported more multitasking than members of ''Generation X,'' who reported more multitasking than members of the ''Baby Boomer'' generation. The choices of which tasks to combine for multitasking were highly correlated across generations, as were difficulty ratings of specific multitasking combinations. The results are consistent with a greater amount of general multitasking resources in younger generations, but similar mental limitations in the types of tasks that can be multitasked.
Price information analysis of Taiwan broiler industry under different chicken import deregulation policies
Authors: M. L. Shih, S. H. Lin, B. W. Huang, W. Y. Hu, Chi-I Hsu
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

According to the changes of chicken import policy, it could be divided into three periods: control import, quota import and free import. This study adopts GARCH models and weekly data to analyze the broiler farm prices during these different periods. Based on the empirical test results, it indicates that there is larger long-run persistence effect of shocks in the free import period. The reactions of broiler farm prices to the lag broiler farm prices, survey number of chick after six weeks, pig prices, colorful broiler farm prices, chick prices and feedstuff prices are different during these three periods.
Urban Environmental Information Perception and Multimodal Communication: The Air Quality Example
Authors: Li Zhu, Kostas Karatzas, John Lee
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

We address environmental information multimodal communication by making use of the air quality (AQ) paradigm. AQ information dissemination methods and tools can make use of various telecommunication channels for pull and push service provision. In addition, location based services are also emerging in the field of personalised, quality of life services. Moreover, communication per se is not based solely on written or oral language forms, but makes use of graphical, symbolical and in more general terms multimedia language communication schemes, via properly designed multimedia environmental information content, streamed via multimodal communication channels. Human perception and communication of such information is based on design schemes that may convey the message in an understandable and effective way. The present paper suggests a design approach to multimodal communication of AQ information.
A Nonlinear Goal Programming Model for Slot Chartering & Allocation under Containerized Liner Shipping Alliance
Authors: Ji-hong Chen, Hong Zhen
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Shipping Alliance developed particularly rapidly these years. Alliance members can cooperate with each others in the form of slot chartering, to take the advantages of economies of scale and provide good services to enhance their competitiveness and obtain greater benefits. This paper will establish a nonlinear goal programming model applied to decision-making for slot chartering and allocation under containerized liner shipping alliance. The results showed that, slot chartering under shipping alliance has outstanding advantages for shipping companies to lower their system costs, offset route capacity, ensure the completion of freight tasks, and so on.
A Pi-calculus formalism for discrete event simulation
Authors: Jianrui Wang, Richard A. Wysk
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents PiDES, a formalism for discrete event simulation based on Pi-calculus. PiDES provides a rigorous semantics of behavior modeling and coordination for simulation federates. The capability of PiDES is demonstrated by translating a generalized semi-Markov process formalism into PiDES specification. The usage of PiDES is illustrated through a case study of a flexible manufacturing system consisting of two machines, two parts, and a robot. The major advantages of PiDES are discussed, which include: a) a complete set of semantics for both modeling and execution; b) supporting parallel and distributed simulation; c) adaptive modeling; d) rich coordination semantics for developing large simulation systems; and finally e) a formalism that can be used for agent-based simulation. An implementation of PiDES using Java programming language is also provided.
An Independent Damped Algorithm Based on SINS for Ship
Authors: Xu Bo, Sun Feng;
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

A novel damped compensation algorithm was presented in the paper. According to the control theory, the system add three different damp feed-back in three loops, which is made use of its own velocity information to do compensation of errors. As the velocity compensation will make the system more sensitive, so the design of the parameters is very important. This paper gives the parameters according to the characteristics of the movement of the ships. Simulations and experimental results show that the inner automation algorithm can damp most of the Schuler and Foucault oscillations, and so efficiently improves the precision of the SINS on ships.
Data discretization unification
Authors: Ruoming Jin, Yuri Breitbart, Chibuike Muoh
Venue: Knowledge and Information Systems (2009)

Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove that discretization methods based on informational theoretical complexity and the methods based on statistical measures of data dependency are asymptotically equivalent. Furthermore, we define a notion of generalized entropy and prove that discretization methods based on Minimal description length principle, Gini index, AIC, BIC, and Pearson&#x2019;s X 2 and G 2 statistics are all derivable from the generalized entropy function. We design a dynamic programming algorithm that guarantees the best discretization based on the generalized entropy notion. Furthermore, we conducted an extensive performance evaluation of our method for several publicly available data sets. Our results show that our method delivers on the average 31% less classification errors than many previously known discretization methods.
An Approach to Archive Remote Sensing Images Based on ActiveX and Grid Service
Authors: Binge Cui
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

In order to promote the research of ocean science, it is important to integrate and share the remote sensing images over the Internet. Currently, remote sensing images are stored in the local FTP Server of each department, which is difficult for users to manage, discover and share them. In this paper, we proposed a novel approach to archive remote sensing images online. The remote sensing image files are transmitted from client end to the FTP server based on an ActiveX control installed on the Web browser. Meanwhile, the metadata for remote sensing images will be extracted and stored into the metadata repository using Grid Service. Based on these metadata, we developed an integration platform to publish and share the remote sensing images on the Web. The experiments show that ActiveX control increases the archiving speed and decreases the burden of the Web server remarkably.
Contactless electroreflectance study of band bending for undoped, Si- and Mg-doped GaN layers and AlGaN/GaN transistor heterostructures
Authors: R. Kudrawiec, M. Motyka, J. Misiewicz, B. Paszkiewicz, R. Paszkiewicz, M. Tłaczała
Venue: Microelectronics Journal (2009)

The surface band bending in undoped, Si-doped and Mg-doped GaN layers with Ga-face polarity as well as AlGaN/GaN heterostructures with Ga(Al)-face polarity has been investigated by room temperature contactless electroreflectance (CER) spectroscopy. The opposite phase of CER resonance (i.e., opposite band bendings) has been observed for n-type (undoped and Si-doped) and p-type (Mg-doped) GaN layers. It means that for thick GaN layers the surface band bending results not from crystal polarity but from the Fermi-level pinning at the surface and carrier type/concentration inside the layer. The crystal polarity can influence the surface band bending for thin (Al)GaN layers for which the screening phenomena can be neglected or are very weak. Such a situation is typical of AlGaN/GaN transistor structures where the thickness of AlGaN layer is below 40nm. In this case, the strong internal electric field in AlGaN layer is manifested in CER spectra by a resonance with a long period Franz-Keldysh oscillation.
Probability Density Estimation Using Isocontours and Isosurfaces: Applications to Information-Theoretic Image Registration
Authors: Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We present a new, geometric approach for determining the probability density of the intensity values in an image. We drop the notion of an image as a set of discrete pixels, and assume a piecewise-continuous representation. The probability density can then be regarded as being proportional to the area between two nearby isocontours of the image surface. Our paper extends this idea to joint densities of image pairs. We demonstrate the application of our method to affine registration between two or more images using information theoretic measures such as mutual information. We show cases where our method outperforms existing methods such as simple histograms, histograms with partial volume interpolation, Parzen windows, etc. under fine intensity quantization for affine image registration under significant image noise. Furthermore, we demonstrate results on simultaneous registration of multiple images, as well as for pairs of volume datasets, and show some theoretical properties of our density estimator. Our approach requires the selection of only an image interpolant. The method neither requires any kind of kernel functions (as in Parzen windows) which are unrelated to the structure of the image in itself, nor does it rely on any form of sampling for density estimation.
Preprocessing Imprecise Points and Splitting Triangulations
Authors: Marc Kreveld, Maarten Löffler, Joseph S. Mitchell
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Given a triangulation of a set of n points in the plane, each colored red or blue, we show how to compute a triangulation of just the blue points in time O(n). We apply this result to show that one can preprocess a set of disjoint regions (representing "imprecise points") in the plane having total complexity n in O(n logn) time so that if one point per region is specified with precise coordinates, a triangulation of the n points can be computed in O(n) time.