ppxscal/embedding_network huggingface dataset:
Optimization With High-Cost Objective Function Evaluations in a Computing Grid and an Application To Simulation-Based Design
Authors: Jin Woo Park, Si Hyong Park, Seung Jo Kim
Venue: International Journal of High Performance Computing Applications (2009)

The emerging grid computing technologies are aimed at the creation of virtual supercomputers to conduct huge scale scientific computations by harvesting computing resources on the Internet. This paper introduces a grid-enabled implementation of an optimization program for large-scale optimization problems requiring high-cost, black-box objective function evaluations. Adopting grid computing can be particularly beneficial for building surrogates such as response surfaces and carrying out large-scale optimizations using stochastic optimization algorithms. However, several problems have to be resolved for effective utilization of grid resources because of heterogeneity in computer capacity among grid resources and limited network conditions inherent in grid systems. This paper identifies some of the problems and introduces algorithms to effectively carry out large-scale optimizations on a grid. Specifically, asynchronous genetic and particle swarm optimization algorithms are developed for grid computing environments. The performance and characteristics of the grid-enabled implementations are assessed via extensive numerical tests. Finally, structural design based on high-fidelity simulations is carried out using the proposed algorithm in a computing grid system.
Construction of Virtual Environment for Endoscopy
Authors: S. Loncaric, T. Markovinovic, T. Petrovic, D. Ramljak, E. Sorantin
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, a technique is presented for CT image analysis and visualization of the bronchial airways. The technique provides a non-invasive way to examine the interior of the bronchial tubes and to detect various properties of the tubes such as abnormal morphology caused by foreign objects stuck in the airways or some other disease. The input to the procedure are chest images obtained by spiral computed tomography (CT). 3-D neural network-based segmentation of CT images is performed to extractthe airways. The resulting 3-D binary volume representing the location of the airways is thinned to extract the medial axis of the bronchial tubes. The marching cube algorithm is used to perform a triangulation of the airway surface. The extracted axis and the triangulated surface is converted to Virtual Reality Modeling Language (VRML) format. The virtual environment in VRML format is then used for inspection and visualization of the bronchial tube interior.
Data Management Model for Ambient Intelligence: AmI-Data
Authors: Chen Rui, Hou Yibin, Huang Zhangqin, He Jian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In Ambient Intelligence (AmI) environment, data access, data storage, data processing, and data presentation are much different from what they are in the traditional computing environment. These issues bring some new obstacles and challenges to the system developing for AmI. According to these challenges, this paper proposed a data model, as well as a data management model "AmI-Data" for the AmI space. AmI-Data supports the automatic hoarding and harvesting of data from multiple, heterogeneous data sources. It also supports metadata to give the system the ability of service discovery between heterogeneous AmI systems. Furthermore, AmI-Data also supports a lot of advanced data mining methods, such as HMM, ANN, Fuzzy computing. The final data presentation of the AmI-Data is "service", which is the final goal of Ambient Intelligence applications.
Connection Matrices for MSOL-Definable Structural Invariants
Authors: Johann Makowsky
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Connection matrices of graph parameters were first introduced by M. Freedman, L. Lovász and A. Schrijver (2007) to study the question which graph parameters can be represented as counting functions of weighted homomorphisms. The rows and columns of a connection matrix $M(f,\Box)$ of a graph parameter f and a binary operation $\Box$ are indexed by all finite (labeled) graphs Gi and the entry at (Gi,Gj) is given by the value of $f(Gi \Box Gj )$. Connection matrices turned out to be a very powerful tool for studying graph parameters in general.B. Godlin, T. Kotek and J.A. Makowsky (2008) noticed that connection matrices can be defined for general relational structures and binary operations between them, and for general structural parameters. They proved that for structural parameters f definable in Monadic Second Order Logic, (MSOL) and binary operations compatible with MSOL, the connection matrix $M(f,\Box)$ has always finite rank. In this talk we discuss several applications of this Finite Rank Theorem, and outline ideas for further research.
Nonadaptive algorithms for threshold group testing
Authors: Hong-Bin Chen, Hung-Lin Fu
Venue: Discrete Applied Mathematics (2009)

Threshold group testing first proposed by Damaschke is a generalization of classic group testing. Specifically, a group test is positive (negative) if it contains at least u (at most l) positives, and if the number of positives is between l and u, the test outcome is arbitrary. Although sequential group testing algorithms have been proposed, it is unknown whether an efficient nonadaptive algorithm exists. In this paper, we give an affirmative answer to this problem by providing efficient nonadaptive algorithms for the threshold model. The key observation is that disjunct matrices, a standard tool for group testing designs, also work in this threshold model. This paper improves and extends previous results in three ways: 1. The algorithms we propose work in one stage, which saves time for testing. 2. The test complexity is lower than previous results, at least for the number of elements which need to be tested is sufficiently large. 3. A limited number of erroneous test outcomes are allowed.
Applications of exemplary programming
Authors: William S. Faught
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Is there an easy way for a computer user to create new software?
Identifying poorly documented object oriented software components
Authors: Parag C. Pendharkar
Venue: International Journal of Hybrid Intelligent Systems (2009)

Recent research suggests that software testing consumes substantial resources and documenting source code is one way to reduce software maintenance cost. The software engineering literature provides little information on how to establish whether a software component is adequately documented. It appears that benchmarking can be used to identify a software component with little or no documentation. In this paper, we propose and illustrate how a hybrid Data Envelopment Analysis (DEA), Kohonen self-organizing mapping, and Euclidean distance based algorithm can be used to identify poorly documented software components.
Using animation and interactive virtual technology to create interpretive materials for museum learning and promotion
Authors: James Quo-Ping Lin, Herminia Wei-Hsin Din
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

Museums around the world have incorporated computer graphic, virtual reality, 2D/3D animation, and interactive technology in gallery exhibits, learning games, films, and online presentations for years and they continue to do so. In order to break through the traditional ways of using technology to create interpretive materials for teaching and learning, and to communicate with its audiences, the National Palace Museum (NPM) in Taiwan embarked on two major digital projects to provide a new museum experience. It includes "3D Virtual Exhibition System: Experience the Imperial Artifacts," and a 13-minute 3D animation entitled "Adventures in the NPM."
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
Authors: Shuichi Miyazaki, Kazuya Okamoto
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive ratio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We also show that our analysis for the upper bound is tight by giving an input sequence for which the competitive ratio of our algorithm is 7 - &epsilon; for arbitrary &epsilon;> 0.
Discrete differential forms for computational modeling
Authors: Mathieu Desbrun, Eva Kanso, Yiying Tong
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

The emergence of computers as an essential tool in scientific research has shaken the very foundations of differential modeling. Indeed, the deeply-rooted abstraction of smoothness, or differentiability, seems to inherently clash with a computer's ability of storing only finite sets of numbers. While there has been a series of computational techniques that proposed discretizations of differential equations, the geometric structures they are simulating are often lost in the process.
Note: Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
Authors: Richard Denman, Stephen Foster
Venue: Discrete Applied Mathematics (2009)

The one-in-three SAT problem is known to be NP-complete even in the absence of negated variables [T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, ACM, New York, 1978, pp. 216-226], a variant known as positive (or monotone) one-in-three SAT. In this note, we use clausal graphs to investigate a further restriction: k-bounded positive one-in-three SAT (kBP one-in-three SAT), in which each variable occurs in no more than k clauses. We show that for k=2, k BP one-in-three SAT is in the polynomial complexity class P, while for all k>2, it is NP-complete, providing another way of exploring the boundary between classes P and NP.
Improving Accuracy of Discovered Knowledge through Direct Interaction and Cohesion-based Framework: A Study in Cell Cycle Data of Yeast
Authors: Ramkishore Bhattacharyya
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Association mining tasks, when put to microarray data, normal trend is to highlight amount of discovered knowledge while quality analysis goes to backseat. Ideally, two more information is equally important: a) accuracy of knowledge extracted in a rule with respect to known biological functions, and b) predictability of biological interactions from discovered rules. Most of the support and/or confidence-based techniques address only predictability or neither of them. It requires tedious post-processing to unearth the actually interesting ones from the bulky output set. In the present work, we exploit the notion of direct interaction (DI) and cohesion to develop a sound methodology for binding genes under common affinity groups and mine intra-group associations. To evaluate soundness, we apply the method in cell cycle data of yeast and analyze result with the help of known biological interactions in BIND. We found impressive values for both accuracy and predictability.
Channel Assignment in Multi-radio Multi-channel Wireless Mesh Network by Topology Approach
Authors: Li Zhang, Xinheng Wang, Caixing Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Wireless mesh nodes equipping multi-radio interfaces on each node and using multi-channel for transmission can greatly enhance the network performance. In this paper, a genetic algorithm, genetic tabu search, was presented to solve the channel assignment problem. The algorithm was evaluated by simulation on NS2 and compared with greedy and multi-radio unification protocol algorithms. Simulation results showed that the performance of developed tabu search algorithm greatly increased the throughput of the wireless mesh network and outperformed than the other two algorithms.
Biometrics for Identity Documents and Smart Cards: European Perspective
Authors: Andrzej Drygajlo
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

With an increase in identity fraud and the emphasis on security, there is a growing and urgent need to efficiently identify humans both locally and remotely on a routine basis. The appearance of biometric identity documents such as passports, visas, national identity cards, drivers' licences and health insurance cards, has triggered a real need for reliable, user-friendly and widely acceptable automated reference mechanisms for checking the identity of an individual. This paper presents European perspective in advancing biometrics development as identified in the COST 2101 Action "Biometrics for Identity Documents and Smart Cards". The main objective of the Action is to investigate novel technologies for unsupervised multi-modal biometric authentication systems using a new generation of biometrics-enabled identity documents and smart cards, while exploring the added-value of these technologies for large-scale applications with respect to the European requirements in relation to storage, transmission and protection of personal data.
YouTube and intergenerational communication: the case of Geriatric1927
Authors: Dave Harley, Geraldine Fitzpatrick
Venue: Universal Access in the Information Society (2009)

This paper presents a case study of a 79&#x00a0;year old video blogger called &#x2018;Geriatric1927&#x2019;, and his use of the video sharing website, YouTube. Analysis of his first eight video blogs, and the subsequent text responses, reveals opportunities of this medium for intergenerational contact, reminiscence, reciprocal learning and co-creation of content, suggesting that older people can be highly motivated to use computers for social contact. The paper concludes by noting the importance of technologies that are socially engaging and meaningful for older people, and pointing to ways in which the social life of YouTube might be better promoted on its interface.
Permuting streaming data using RAMs
Authors: Markus Püschel, Peter A. Milder, James C. Hoe
Venue: Journal of the ACM (JACM) (2009)

This article presents a method for constructing hardware structures that perform a fixed permutation on streaming data. The method applies to permutations that can be represented as linear mappings on the bit-level representation of the data locations. This subclass includes many important permutations such as stride permutations (corner turn, perfect shuffle, etc.), the bit reversal, the Hadamard reordering, and the Gray code reordering. The datapath for performing the streaming permutation consists of several independent banks of memory and two interconnection networks. These structures are built for a given streaming width (i.e., number of inputs and outputs per cycle) and operate at full throughput for this streaming width. We provide an algorithm that completely specifies the datapath and control logic given the desired permutation and streaming width. Further, we provide lower bounds on the achievable cost of a solution and show that for an important subclass of permutations our solution is optimal. We apply our algorithm to derive datapaths for several important permutations, including a detailed example that carefully illustrates each aspect of the design process. Lastly, we compare our permutation structures to those of J&auml;rvinen et al. [2004], which are specialized for stride permutations.
Implementing new ways of working: interventions and their effect on the use of an electronic medication record
Authors: Maren Sander Granlien, Morten Hertzum
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Successful deployment of information technology (IT) involves implementation of new ways of working. Under-recognition of this organizational element of implementation entails considerable risk of not attaining the benefits that motivated deployment, yet knowledge of how to work systematically with organizational implementation is sparse. This study investigates a set of interventions undertaken to implement one mandated procedure associated with an electronic medication record, namely that all information about medication is recorded in the system. Medical record audits show that the interventions, which were devised and performed as part of the study, significantly lowered the number of records that violated the procedure. This positive effect was, however, not achieved until multiple interventions had been employed, and there is some indication that the effect may be wearing off after the interventions have ended. We discuss the implications of these results for efforts to work systematically with the organizational implementation of IT systems.
Portable data acquisition unit for process control and monitoring applications
Authors: Petr Dostálek, Vladimír Vašek, Jan Dolinay
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The contribution deals with portable data acquisition unit which was developed at our department. The device is designed with respect to possible battery operation which in conjunction with laptop computer enables process measurement in areas where power source is not available. Its hardware design is adopted to fulfill high reliability and immunity against industrial environment, high precision and compact dimensions. Communication using standard RS232 serial interface makes it fully platform independent and thus suitable for connecting with any system, not only personal computer. Device has implemented ASCII - based communication protocol provides very effective way to communicate with number of software environments which are used in process control and monitoring tasks. In order to improve development of new software applications with this device a support program libraries for Visual C++, Control Web and Matlab/Simulink was created. Developed program libraries and data acquisition device were verified by control of educational time-delay heating plant model which is used in Automatic Control theory lessons.
Web Analytics 100 Success Secrets: Make it easy to improve your results online. Strengthen your marketing initiatives, and create Higher Converting Websites
Authors: James Vaughn
Venue:  (2008)

Turn online data into wisdom - This book describes in an absorbing and insightful way the most important topics for a Web Analyst or any professional related to the management of a website. Topics covered include: basic terminology, tool selection/implementation, online segmentation, conversion rates improvement, competitive analysis, and many others.The book is indispensable to those who want to understand and practice the art and science of web analytics. It is organized in a very friendly way, turning the reading into a pleasant break amid the rush of day-to-day duties; like a challenging conversation. It is rich in examples, facilitating the understanding of the `what', `how', and `why' of online measurement strategies.This book is Accessible and Marketing Driven, it goes beyond how to better read analytics dashboards. What you will find is a sophisticated and marketing-oriented book that teaches how to use the available data to create a clear picture of return on investment in the online world. Reading the information and applying it in small pieces is the best way to learn. The bulk of the content is arranged by subject and segmented into daily readings allowing you to focus and build upon the knowledge one brick at a time.The book is easy to read, full of practical application, and one that will be tattered, bookmarked, and referenced often.
Research on Access Points Management of Multi-Mode Mobile Terminal Based-on SIP
Authors: Zhengxin Lu, Jun Shi, Yasha Liu, Furong Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Multi-mode mobile terminal is the main form of the mobile terminal in next generation heterogeneous wireless networks, and is also the important equipment to support the implement of seamless mobility among the wireless networks for mobile users. However, the traffic handoff between the different access points of multi-mode mobile terminal brings a new challenge to the mobility management technology. This paper tries to make some research on the multi access points management based on SIP, and proposes an access points parley scheme based on a status information library of the wireless networks in the mobile agent which is set up through the interaction of SIP protocol messages between the multi-mode mobile terminal and the mobile agent.
The effects of misspecified marginals and copulas on computing the value at risk: A Monte Carlo study
Authors: Dean Fantazzini
Venue: Computational Statistics Data Analysis (2009)

The effect on the estimation of the Value at Risk when dealing with multivariate portfolios when there is a misspecification both in the marginals and in the copulas is investigated. It is first shown that, when there is skewness in the data and symmetric marginals are used, the estimated elliptical (normal or t) copula correlations are negatively biased, reaching values as high as 70% of the true values. Besides, the bias almost doubles if negative correlations are considered, compared to positive correlations. As for the t copula degrees of freedom parameter, the use of wrong marginals delivers large positive biases, instead. If the dependence structure is represented by a copula which is not elliptical, e.g. the Clayton copula, the effects of marginal misspecifications on the copula parameter estimation can be rather different, depending on the sign of marginal skewness. Extensive Monte Carlo studies then show that the misspecifications in the marginal volatility equation more than offset the biases in copula parameters when VaR forecasting is of concern, small samples are considered and the data are leptokurtic. The biases in the volatility parameters are much smaller, whereas those ones in the copula parameters remain almost unchanged or even increase when the sample dimension increases. In this case, copula misspecifications do play a role for VaR estimation. However, these effects depend heavily on the sign of the dependence.
Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
Authors: Jan Štola
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We study the existence of unimaximal subsequences in sequences of pairs of integers, e.g., the subsequences that have exactly one local maximum in each component of the subsequence. We show that every sequence of $\frac{1}{12}n^2(n^2-1)+1$ pairs has a unimaximal subsequence of length n. We prove that this bound is tight. We apply this result to the problem of the largest complete graph with a 3D rectangle visibility representation and improve the upper bound from 55 to 50. 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