ppxscal/embedding_network huggingface dataset:
Exploring the application domain and middleware issues for a phone-centric information monitoring environment
Authors: Lu Yan, Jean Bacon
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The convergence of pervasive wired and wireless infrastructures, sophisticated sensor and location technologies and mobile devices has started to change the way in which computing technology is viewed. Though many other mobile devices, such as motes (WSN), handheld and wearable computers, PDAs, digital cameras, satellite navigators, have become more and more pervasive in public spaces and the personal fabric of everyday life, mobile phones are probably still the most common and widely-used mobile devices nowadays. It is our hypothesis that building a location-aware monitoring environment with mobile phones would be of wide interest. In addition to the academic, technical and engineering advances, social models and public awareness and acceptance of ubiquitous computing technologies could also be effectively studied within this environment. While placed in the specific context of the parallel running of three correlated research projects here on ubiquitous computing and information monitoring, we, in this paper, examine the current and potential application domain and middleware issues for a phone-centric monitoring environment.
Faceted Taxonomy-based Information Management
Authors: Yannis Tzitzikas, Anastasia Analyti
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Faceted indexing and searching are being increasingly studied in the literature and used for real-life applications, e.g., for publishing heterogeneous museum collections on the Web. In this paper, we discuss in brief several aspects of managing (faceted) taxonomy-based information sources. Specifically, we discuss (i) the semantic description of faceted taxonomies, based on the Compound Term Composition Algebra (CTCA), (ii) the revision of CTCA expressions, as faceted taxonomies evolve, (iii) the dynamic generation of navigational trees (and other applications of CTCA), and (iv) the integration and personalization of taxonomy-based sources.
The Chimera of Software Quality
Authors: Les Hatton
Venue: Computer (2007)

Most software failures and disasters could have been avoided using techniques we already know.
A comparison of selection schemes used in evolutionary algorithms
Authors: Tobias Blickle, Lothar Thiele
Venue: Evolutionary Computation (1996)

Evolutionary algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme, for which in this paper a new description model, based on fitness distributions, is introduced. With this, a mathematical analysis of tournament selection, truncation selection, ranking selection, and exponential ranking selection is carried out that allows an exact prediction of the fitness values after selection. The correspondence of binary tournament selection and ranking selection in the expected fitness distribution is proved. Furthermore, several properties of selection schemes are derived (selection intensity, selection variance, loss of diversity), and the three selection schemes are compared using these properties.
BSADF: Blind Signature Based Anonymous Digital Fingerprint
Authors: Xuanwu Zhou, Xiaoyuan Yang, Ping Wei, Yupu Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The security threats and system weakness of present digital fingerprint schemes were analyzed. Combining blind signature and digital fingerprint, an asymmetric digital fingerprint scheme with conditional anonymity based on elliptic curves cryptosystem was presented. The probabilistic encryption algorithm and identity blinding process enable the buyer to be conditionally anonymous in fingerprint embedding and commodity purchasing, and the anonymity can also be conveniently revoked if necessary. By utilizing probabilistic encryption algorithm in fingerprint generating, the scheme avoids the relevance between different digital fingerprints generated by the same party, and effectively prevents coalition attack and generalized fingerprint forgery. Further analyses and comparison with other digital fingerprint schemes also justify the scheme's brevity, security, high efficiency, and thus considerable improvement on system overheads regarding software and hardware application environment.
An immersive voice over IP service to wireless gaming: user study and impact of virtual world mobility
Authors: Ying Peng Que, Farzad Safaei, Paul Boustead
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

The current generation of VoIP services offer only single channel (mono) party-mix of voices. Thus when added to a network game engine, mono VoIP service can not really contribute to the gamers' sense of virtual world immersion. As a future development, the Immersive VoIP service delivers to each gamer an Auditory Scene, mixing the live voices of surrounding gamers which are all directionally placed and distance attenuated according to the appropriate virtual world positions. In previous work, we have proposed the Wireless Immersive Communication Environment (WICE) which is special type of Immersive VoIP service tailored to the scarce resources of wireless gaming clients. Also in previous work, we have already addressed the processing scalability of WICE with the conjecture of distance-governed relaxation of acceptable angular errors which allows multiple gamers to share the voice localised along the same direction. In this work, we verify the conjecture of acceptable angular errors in a series of subjective listening tests. An important test finding is the apparent user sensitivity to angular shifts in voice localisation when such auditory movements correspond to little or no visual movements. This finding suggests that the re-establishment of Auditory Scenes across time can not be memoryless in the face of gamer mobility in the virtual world. A mechanism has thus been developed to address this issue and analytic results are obtained on the impact of virtual world mobility on the required execution frequency of such mechanism.
Four Matching Operators of Fuzzy Decision Tree Induction
Authors: Lin-yan Xue, Xiao-hua Zuo, Dong-dong Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Fuzzy decision tree induction is one of the most popular choices for learning and reasoning from feature-based examples. A fuzzy decision tree can be constructed from a training set of cases and converted into a set of fuzzy rules. In this paper, the reasoning ability of four matching operators ( , ) , ( , ) × , ( , ) + and ( , ) + × , which are used for applying fuzzy rules to classification, are analyzed and compared. The purpose of this study is to show some useful guidelines on how to choose an appropriate operator for classified problem.
Take a WAC at writing in your course
Authors: Stephen J. Zilora, Lisa M. Hermsen
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

We can all agree that writing is an important skill for our students, but who among us wants to be the one to correct and grade those written assignments? And if we do not apply high standards to our students' writing and require frequent exercise, how can we expect them to take writing seriously? One simple answer for those of us in information technology is to turn the problem over to the English department-we can make it their job to teach our students how to write. While this relieves us of the need to correct dangling participial phrases, it burdens our English professors grading a database paper with understanding that some tables are more normal than others while some tables are simply unnormalized. The authors, an IT professor and an English professor, have taken a different approach and embraced the concept of Writing Across the Curriculum (WAC). This concept calls for the frequent practice of low stakes writing in the disciplines. It is predicated on the belief that just like programming or any other technical skill, writing requires practice. While this approach is not entirely new (WAC first became popular in the 1980s), the authors have devised a support structure to better enable WAC. Specifically, with an English professor serving as a "personal trainer", a technical professor can learn how to provide formative feedback to his students without needing to be an expert grammarian. Our experience is that this process is both easy to implement for the professors and well-received by students. Students reported that they actually enjoyed the additional writing assignments and the associated feedback.
On the smallest enclosing information disk
Authors: Frank Nielsen, Richard Nock
Venue: Information Processing Letters (2008)

We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Computer Science, in: Lecture Notes in Computer Science, vol. 555, Springer, 1991, pp. 359-370] for point sets lying in information-geometric spaces. Given a set of points equipped with a Bregman divergence as a (dis)similarity measure, we investigate the problem of finding its unique (circum)center defined as the point minimizing the maximum divergence to the point set. As an application, we show how to solve a statistical model estimation problem by computing the center of a finite set of univariate normal distributions.
Advances in Storage Technology for Micros and Minis
Venue: Computer (1976)

The term architecture as originally applied to computer systems referred to that part of the computer system which is visible to the programmer-i.e., the instruction set, interrupt characteristics, etc. As such, the computer architecture field has seen few advances in the past several years. Among computer architectures as different as the Burroughs B6700 and the IBM System/370 there is no clear advantage of one relative to another. Performance is determined much more by the circuit technology and the memory size and technology than by the peculiarities of the instruction set. The same situation appears to exist in minicomputers (e.g., the PDP-11 and HP-3000). Although no microprocessor using a stack architecture is known to this writer, it seems unlikely that such a CPU would have unique characteristics. Therefore in setting up the Lake Arrowhead Workshop session on Latency Cost and Architecture it seemed unprofitable to spend time investigating computer architecture in the classical sense. Computers will very likely "look" the same in the foreseeable future as they do now. 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
Exact asymptotics of distributions of integral functionals of the geometric Brownian motion and other related formulas
Authors: V. R. Fatalov
Venue: Problems of Information Transmission (2007)

We prove results on exact asymptotics of the probabilities $$P\left\{ {\int\limits_0^1 {e^{\varepsilon \xi (t)} dt > b} } \right\},P\left\{ {\int\limits_0^1 {e^{\varepsilon |\xi (t)|} dt > b} } \right\},\varepsilon \to 0,$$ where b > 1, for two Gaussian processes ¿(t), namely, a Wiener process and a Brownian bridge. We use the Laplace method for Gaussian measures in Banach spaces. Evaluation of constants is reduced to solving an extreme value problem for the rate function and studying the spectrum of a second-order differential operator of the Sturm-Liouville type with the use of Legendre functions.
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
Authors: Sang Cheol Kim, Sunggu Lee, Jaegyoon Hahm
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Consider DAG scheduling for a large heterogeneous system, which consists of processors with varying processing capabilities and network links with varying bandwidths. The search space of possible task schedules for this problem is immense. One possible approach for this optimization problem, which is NP-hard, is to start with the best task schedule found by a fast deterministic task scheduling algorithm, and then iteratively attempt to improve the task schedule by employing a general random guided search method. However, such an approach can lead to extremely long search times, and the solutions found are sometimes not significantly better than those found by the original deterministic task scheduling algorithm. In this paper, we propose an alternative strategy, termed Push-Pull, which starts with the best task schedule found by a fast deterministic task scheduling algorithm, and then iteratively attempts to improve the current best solution using a deterministic guided search method. Our simulation results show that, given similar running times, the Push-Pull algorithm performs well, achieving similar or better results than all of the other algorithms being compared.
Brute force as input for networked gaming
Authors: Florian 'Floyd' Mueller, Stefan Agamanolis, Frank Vetere, Martin Gibbs
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Bodily activities such as sports have many physical and mental health benefits. The associated physical interactions are often of an exertion character and facilitate the use of brute force and intense physical actions. On the other hand, computer interfaces so far have mainly focused on interactions that use limited force and often ignored the existence of extreme brutal interactions that can be encountered in everyday life, in particular in contact sports. We present our initial investigations on the concept of "Brute Force" interfaces in HCI and describe work-in-progress on a prototype that aims to facilitate brute force interactions. We hope with our work we can aid designers who want to leverage the physical and mental health benefits of such physically intense behaviors that people do exhibit in their lives.
Possibility and necessity measures for relevance assessment
Authors: F. Z. Bessai Mechmache, M. Boughanem, Z. Alimazighi
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

The major question raised in information retrieval on semi-structured documents relates to the manner of effectively handling the structure and the contents of the document for better answering the user's needs. These needs can be formulated by queries composed of only key words or key words and structural constraints. In this paper, we are interested in Information Retrieval in semi-structured document like XML. For these purposes, we present a model for the semi-structured information retrieval, based on the possibilistic networks. The document - elements and elements - terms relations are modelled by measures of possibility and necessity. In this model, the user's query starts a process of propagation to recover documents or portions of documents necessarily or at least possibly relevant. An example of such a research is proposed in order to illustrate the presented approach.
Interview with Michelle Hinn
Venue: Computers in Entertainment (CIE) (2008)

Michelle Hinn is an instructor in the Department of Library and Information Sciences at the University of Illinois where she teaches the game design course, and is the academic advisor for the Women in Math, Science, and Engineering Living/Learning Community. She was recently named one of Next Generation Magazine's 100 Most Influential Women in Gaming based on her work as chair of the IDGA Game Accessibility Special Interest Group. In the video interview, you will hear her answers the following questions: 1. You are writing a new book entitled "Accessibility and Usability in Game Design," can you tell us more about it? 2. You coauthored a book chapter "Literacy in the information age: inquiries into meaning-making with new technologies," what do you mean by "meaning-making" in that interesting title? 3. You are the chair of the Game Accessibility Special Interest Group of the International Game Developers Association, what are your goals and activities at IGDA? 4. How do you see the future of computer games? 5. Do you see a big difference between games designed for girls versus games designed for boys?
An ontology-based approach for semantic conflict resolution in database integration
Authors: Qiang Liu, Tao Huang, Shao-Hua Liu, Hua Zhong
Venue: Journal of Computer Science and Technology (2007)

An important task in database integration is to resolve data conflicts, on both schema-level and semantic-level. Especially difficult the latter is. Some existing ontology-based approaches have been criticized for their lack of domain generality and semantic richness. With the aim to overcome these limitations, this paper introduces a systematic approach for detecting and resolving various semantic conflicts in heterogeneous databases, which includes two important parts: a semantic conflict representation model based on our classification framework of semantic conflicts, and a methodology for detecting and resolving semantic conflicts based on this model. The system has been developed, experimental evaluations on which indicate that this approach can resolve much of the semantic conflicts effectively, and keep independent of domains and integration patterns.
A predictably low-leakage ASIC design style
Authors: Nikhil Jayakumar, Sunil P. Khatri
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, we describe a new low-leakage standard cell based application-specific integrated circuit (ASIC) design methodology. This design is based on the use of modified standard cells, designed to reduce leakage currents (by almost two orders of magnitude) in standby mode and also allow precise estimation of leakage current. For each cell in a standard cell library, two low-leakage variants of the cell are designed. If the inputs of a cell during the standby mode of operation are such that the output has a high value, we minimize the leakage in the pull-down network, and similarly we minimize leakage in the pull-up network if the output has a low value. In this manner, two low-leakage variants of each standard cell are obtained. While technology mapping a circuit, we determine the particular variant to utilize in each instance, so as to minimize leakage of the final mapped design, We have performed experiments to compare placed-and-routed area, leakage and delays of this new methodology against Multithreshold CMOS (MTCMOS) and a regular standard cell based design style. The results show that our new methodology (which we call the "HL" methodology) has better speed and area characteristics than MTCMOS implementations. The leakage current for HL designs can be dramatically lower than the worst-case leakage of MTCMOS based designs, and two orders of magnitude lower than the leakage of traditional standard cells. An ASIC design implemented in MTCMOS would require the use of separate power and ground supplies for latches and combinational logic, while our methodology does away with such a requirement. Another advantage of our methodology is that the leakage is precisely estimable, in contrast with MTCMOS. Our primary contribution in this paper is a new low leakage design style for static CMOS designs. In addition, we also discuss techniques to reduce leakage in dynamic (domino logic) designs.
An Approach of Fast Mosaic for Serial Remote Sensing Images from UAV
Authors: Xiaowei Han, Hongying Zhao, Lei Yan, Shaowen Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Based on the values of external orientation elements of the camera installed on the unmanned aerial vehicle (UAV), the Nearest-neighbor interpolation is adopted to rectify original images geometrically. The range of the overlapping region between two consecutive images is determined by the flying status parameters of UAV. Both of the overlapping regions of the two images are processed to binary image at first. In the appointed binary image region of the former image, feature template is searched and extracted. By the XOR operation, some possible matching positions of the latter image are got. Furthermore, Normalized Correlation method (NC) is adopted to validate the optimal matching position, by which two consecutive images are mosaicked to an image. An intensity transformation function between the two consecutive images is built to smooth the mosaicked image. Simulation experimental results show that the approach presented is effective.
Linear analysis of the influence of FIR feedback filters on the response of the pulsed digital oscillator
Authors: M. Domínguez, J. Pons, J. Ricart, J. Juillard, Eric Colinet
Venue: Analog Integrated Circuits and Signal Processing (2007)

The objective of this work is to extend the linear analysis of Pulsed Digital Oscillators to those topologies having a Finite Impulse Response (FIR) in the feedback loop of the circuit. It will be shown with two specific examples how the overall response of the oscillator can be adjusted to some point by changing the feedback filter, when the resonator presents heavy damping losses. Extensive discrete-time simulations and experimental results obtained with a MEMS cantilever with thermoelectric actuation and piezoresistive position sensing are presented. It will be experimentally shown that the performance of the oscillator is good even below the Nyquist limit.
The role of Web-based information in the scholarly communication of chemists: Citation and content analyses of American Chemical Society Journals
Authors: Cecelia Brown
Venue: Journal of the American Society for Information Science and Technology (2007)

Citation and content analyses of eight American Chemical Society (ACS) journals in a range of fields of chemistry were used to describe the use of Web-based information resources by the authors and readers of the scholarly literature of chemistry. The analyses indicate that even though the number of Web-based information resources has grown steadily over the past decade, chemists are not taking full advantage of freely available Web-based resources. They are, however, making use of the ACS Electronic Supporting Information archive. The content of the Web-based resources that are used is primarily text based, and the URLs are provided in the articles' reference lists and experimental sections. The presence of a reference to a Web-based resource in a chemistry article does not influence its rate of citation, even though the viability of the URLs was found to erode with time. Comparison of citation and online access data reveals that at the highest levels of citation, articles also garner high levels of online access. This was especially true for articles describing a technique or methodology. Even though chemists do not incorporate large numbers of freely available Web-based resources into their publications, an increasingly important component of a chemist's information behavior for the direct support of his or her research is unfettered bench-top access via the Web. &copy; 2007 Wiley Periodicals, Inc.
On the Direct Decomposability of QL-Implication Operators on Product Lattices
Authors: Zhudeng Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, we further study the direct decomposition of implication operators on product lattices, discuss the decomposability of QL-implications on product lattices and show that QL-implications is a direct product of two implication operator when it satisfies the law of right (or left) contraposition with respect to a strong negation. Key words: Fuzzy logic; t-norm; t-conorm; strong negation; implication operator; direct decomposition