ppxscal/embedding_network huggingface dataset:
Adaptive Non-uniform Distribution of Quantum Particles in mQSO
Authors: Krzysztof Trojanowski
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper studies properties of quantum particles rules of movement in particle swarm optimization (PSO) for non-stationary optimization tasks. A multi-swarm approach based on two types of particles: neutral and quantum ones is a framework of the experimental research. A new method of generation of new location candidates for quantum particles is proposed. Then a set of experiments is performed where this method is verified. The test-cases represent different situations which can occur in the search process concerning different numbers of moving peaks respectively to the number of sub-swarms. To obtain the requested circumstances in the testing environment the number of sub-swarms is fixed. The results show high efficiency and robustness of the proposed method in all of the tested variants.
Design and evaluation of a virtual mobile time machine in education
Authors: Hiroyuki Tarumi, Keitaro Yamada, Takafumi Daikoku, Fusako Kusunoki, Shigenori Inagaki, Makiko Takenaka
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

We have developed a "virtual time machine" for edutainment, which needs only commercially available mobile phones. In reality, the system just shows graphical images of a past scene within a given area, viewing from the location given by GPS and with arbitrary viewing angles. Users can virtually explore the past world with it. We applied it to junior high school students. They virtually visited a world of 1938, when a landslide disaster occurred. They were able to directly compare now and the past. In this paper, the design approach and evaluation of our edutainment practice are given. Our system raised students' motivations.
Tree-structured model diagnostics for linear regression
Authors: Xiaogang Su, Chih-Ling Tsai, Morgan C. Wang
Venue: Machine Learning (2009)

This paper studies model diagnostics for linear regression models. We propose two tree-based procedures to check the adequacy of linear functional form and the appropriateness of homoscedasticity, respectively. The proposed tree methods not only facilitate a natural assessment of the linear model, but also automatically provide clues for amending deficiencies. We explore and illustrate their uses via both Monte Carlo studies and real data examples.
Neural network ensemble with probabilistic fusion and its application to gait recognition
Authors: Heesung Lee, Sungjun Hong, Euntai Kim
Venue: Neurocomputing (2009)

The recognition of a person from his (or her) gait is a relatively new and promising research direction in biometrics since it is noninvasive and human friendly. Gait recognition, however, has the weakness that it is not reliable compared with other biometrics. To increase reliability, we applied a neural network ensemble with probabilistic fusion to the gait recognition problem. To improve recognition accuracy, we define belief as the posterior probability of the pattern and combine the component neural networks of the ensemble based on the belief. Experiments are performed with the NLPR and SOTON databases, and the effectiveness of the proposed method for gait recognition is demonstrated.
Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time
Authors: Xia Zhu, Xiaoping Li, Qian Wang
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

No-wait flowshops circumscribe an important class of sequencing problems in the field of production planning. For no-wait flowshops with total completion time minimization, a permutation of jobs should be find to be processed sequentially on a number of machines under the restriction that each job is processed continuously. This is a typical NP-hard combinatorial optimization problem. In this paper, a new hybrid heuristic algorithm is proposed which is based on PH1p algorithm. PH1p is modified by replacing Nawaz-Enscore-Ham (NEH) insertion operator with FL method. A composite algorithm is adopted to generate an advantageous initial seed. Based on well-known benchmarks and comparisons with some existing algorithms, simulation results demonstrate the effectiveness of the proposed hybrid algorithm.
Quantitative Analysis for Requirements Evolution's Ripple-Effect
Authors: Yu-Qing Yan, Shi-Xian Li, Xian-Ming Liu
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

One certainty in software development is that requirements always evolve. To effectively handle requirements evolution, determining the impact of requirements evolution from quantitative perspectives is a breakthrough. This paper first defines labelled requirements and requirements models by array, which is simple and effective to express requirements or models. Then respectively creates requirements model adjacency matrix and reachability matrix . Depending on matrix shift and calculation, a series of Requirements Evolution ripple-effects are formularized. At the same time, ripple-effect analysis for requirements evolution operations is discussed. An example supports the quantitative models underlying the proposed metrics.This work provides a new method for effectively managing and controlling and evaluating requirements evolution, and building an effect requirements analysis and management tool.
Anonymizing moving objects: how to hide a MOB in a crowd?
Authors: Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshmanan, Wendy Hui Wang
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful information (e.g., traffic patterns and congestion trends) that can be used in applications for the common benefit. In order to mine and/or analyze the data, MOD must be published, which can pose a threat to the location privacy of a user. Indeed, based on prior knowledge of a user's location at several time points, an attacker can potentially associate that user to a specific moving object (MOB) in the published database and learn her position information at other time points. In this paper, we study the problem of privacy-preserving publishing of moving object database. Unlike in microdata, we argue that in MOD, there does not exist a fixed set of quasi-identifier (QID) attributes for all the MOBs. Consequently the anonymization groups of MOBs (i.e., the sets of other MOBs within which to hide) may not be disjoint. Thus, there may exist MOBs that can be identified explicitly by combining different anonymization groups. We illustrate the pitfalls of simple adaptations of classical k-anonymity and develop a notion which we prove is robust against privacy attacks. We propose two approaches, namely extreme-union and symmetric anonymization, to build anonymization groups that provably satisfy our proposed k-anonymity requirement, as well as yield low information loss. We ran an extensive set of experiments on large real-world and synthetic datasets of vehicular traffic. Our results demonstrate the effectiveness of our approach.
Analytical High-Level Power Model for LUT-Based Components
Authors: Ruzica Jevtic, Carlos Carreras
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper presents an extended high-level model for logic power estimation of multipliers and adders implemented in FPGAs in the presence of glitching and correlation. The model is based on an analytical computation of the switching activity produced in the component and the FPGA implementation details of the component structure. It is extended to consider operands of different word-lengths, both zero-mean and non-zero mean signals, and the glitching produced inside the component, taking into account the sign nature of the autocorrelation coefficients of the components' inputs. The number of simulations needed for the model characterization is extremely small and can be reduced to only two. As the final power model is analytical, it is capable of providing power estimates in miliseconds. The results show that the mean relative error is within 10% of low-level power estimates given by the XPower tool.
HAAIS-DSL: DSL to develop home automation and ambient intelligence systems
Authors: Pedro J. Clemente, José M. Conejero, Juan Hernández, Lara Sánchez
Venue: Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems (2009)

Domain Specific Language (DSL) is an emergent software engineering discipline that allows software architects to model systems based on the elements of a specific domain. Home Automation (HA) and Ambient Intelligence (AmI) are examples of specific domains and they are considered the key elements in the future of home development. However, software for these domains is usually hand coded based on embedded devices and specific implementation technologies and frameworks. In this paper we present a Model Driven Development (MDD) approach to develop software systems for HA and AmI. A Domain Specific Language has been designed to model the architecture of these kinds of systems. Then, taking as input the architecture models, a set of model transformations allows code and configuration generation for a specific device platform like KNX/EIB (European Installation Bus).
Multiclass Boosting Algorithms for Shrinkage Estimators of Class Probability
Authors: Takafumi Kanamori
Venue: IEICE - Transactions on Information and Systems (2007)

Our purpose is to estimate conditional probabilities of output labels in multiclass classification problems. Adaboost provides highly accurate classifiers and has potential to estimate conditional probabilities. However, the conditional probability estimated by Adaboost tends to overfit to training samples. We propose loss functions for boosting that provide shrinkage estimator. The effect of regularization is realized by shrinkage of probabilities toward the uniform distribution. Numerical experiments indicate that boosting algorithms based on proposed loss functions show significantly better results than existing boosting algorithms for estimation of conditional probabilities.
A framework for real-time simulation of heavy construction operations
Authors: Lingguang Song, Fernando Ramos, Katie Arnold
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper describes a framework of real-time simulation for modeling heavy construction operations. Compared with the traditional offline simulation that uses stationary inputs, the capability of real-time simulation to dynamically incorporate new project data and adapt to changes in the operating environment offers the promise of improving the accuracy of project forecasting. In the proposed realtime simulation framework, dynamic data from construction operations are constantly captured and fed into a process-simulation model for short-term scheduling purposes. A prototype system was developed to demonstrate the structure of the proposed framework and its feasibility. The benefits of this simulation approach and future research requirements for achieving a higher-level modeling automation are also discussed in this paper.
A Closed Form Solution to L2-Sensitivity Minimization of Second-Order State-Space Digital Filters
Authors: Shunsuke Yamaki, Masahide Abe, Masayuki Kawamata
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes a closed form solution to L2-sensitivity minimization of second-order state-space digital filters. Restricting ourselves to the second-order case of state-space digital filters, we can express the L2-sensitivity by a simple linear combination of exponential functions and formulate the L2-sensitivity minimization problem by a simple polynomial equation. As a result, the L2-sensitivity minimization problem can be converted into a problem to find the solution to a fourth-degree polynomial equation of constant coefficients, which can be algebraically solved in closed form without iterative calculations.
Reform the Setting of Computer Hardware Teaching
Authors: Shi-ying Shi
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper discusses the reform of the computer hardware teaching in the new circumstances and the establishment of a new-style system structure of computer hardware and tries to give a useful discussion about the problems such as the reform of experimental procedures, teaching methods and teaching instruments.
Social network analysis on data diffusion in delay tolerant networks
Authors: Yang Zhang, Jing Zhao
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Different from existing mobility-assisted data access techniques, we propose to use data diffusion to reduce the query delay in DTNs. We use social network analysis to classify and study four diffusion schemes based on the "homophily" phenomenon in social network. Theoretical models are further developed to analyze the data diffusion process and compare the performance of the four proposed diffusion schemes in terms of diffusion speed and query delay.
Optimizing Energy Consumption of Mobile Nodes in Heterogeneous Kademlia-Based Distributed Hash Tables
Authors: Imre Kelényi, Jukka K. Nurminen
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper presents a novel mechanism that enables mobile devices to efficiently participate in Distributed Hash Tables (DHTs). By selectively dropping messages, we can significantly reduce traffic and thus the energy consumption of mobile nodes with only minor performance degradation. The protocol extension preserves compatibility with existing widely used DHT systems. We evaluate the solution by measuring the energy-consumption of mobile phones participating in the Kademlia-based Mainline BitTorrent DHT, which consists of over one million nodes. We further analyze the impact of our mechanism on the performance of the DHT by means of an analytical model.
UI Fin: a process-oriented interface design tool
Authors: Angel Puerta, Martin Hu
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Even though over the years a multitude of user interface design tools have been created, designers in practice find themselves limited to a small set of realistic options. These options include interface builders that are attached to development environments, or general-purpose tools such as Microsoft Visio. We claim that the inability of many user interface tools to find their way into a designer's toolbox is due in great part to their failure to support the process of designing a user interface. In this paper, we introduce UI Fin, a user interface design tool that: (a) fits within and supports a common process for user interface design, (b) enables user-centered, as opposed to widget-centered, screen design, (c) provides decision-support for designers, and (d) bridges the transitions between the multiple actors in the design and engineering of a user interface. UI Fin has been used in real-world interface design projects and it appears to improve the efficiency of the design process, to enable multiple types of users to create design artifacts, and to present a relatively low barrier for novice users to become productive with the tool.
Exploiting Caching for Realtime Multimedia Systems
Authors: KyungOh Lee, J. B. Kwon, Heon Y. Yeom
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Several caching schemes for realtime multimedia systems have been proposed but they only concentrate on the hit ratio as the performance metric without providing any means to utilize the disk bandwidth gained through cache hits. A high cache hit ratio alone does not capture the effectiveness of a caching scheme for such systems unless hiccup-free service is guaranteed. We evaluate three caching schemes which make it possible to provide service to additional streams with the saved disk bandwidth. We first start with NIC in which no cached intervals are preempted or replaced unless they have finished their playback. Next, we propose PSIC, which preempts the cached intervals for more valuable intervals but still guarantees hiccup-free playback. Finally, we present SPT-L scheme which has a significantly greater overhead and the best hit ratio. However, STP-L suffers from frequent starvation, which verifies our claim that the high cache hit ratio does not necessary result in better performance.
Distributed processing with the NS16000 family
Authors: Leslie Kohn
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The paper discusses the benefits of microprocessor-based distributed processing systems, which are greater than those of conventional timeshared mini or main-frame systems. It highlights the advantages of the NS16000 microprocessor family for this application, and it explains how the NS16000 operating system supports distributed processing.
Instrumenting Multi-agent Organisations with Artifacts to Support Reputation Processes
Authors: Jomi Fred Hübner, Laurent Vercouter, Olivier Boissier
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

Reputation is often cited as an instrument to enforce norm compliance: agents that do not follow the norms have their reputation decreased. Conceiving reputation as a collective process, i.e. a kind of shared voices as proposed by Conte Paolucci, is not a simple task. In this paper, we propose a first step in this direction by instrumenting multi-agent organisation with an artifact that publishes some objective evaluations of the performance of the agents with respect to their behaviour within the organisation. The members of the organisation can then read these evaluations and build up their reputation of others. The artifact serves thus as an instrument that aid in the building of the reputation of the agents. We propose that the evaluation of the agents is not simply based on their obedience to norms, but also considers their pro-activeness and their contribution to the success of collective tasks that are being executed in the organisation. This proposal is detailed and exemplified in the context of the $\mathcal M$ oise + organisational model supported by a set of organisational artifacts as proposed in the ora4mas approach.
Initializing Markerless Tracking Using a Simple Hand Gesture
Authors: Taehee Lee, Tobias Hollerer
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We introduce a technique to establish a coordinate system for augmented reality (AR) on tabletop environments. A user's hand is tracked and the fingertips on the outstretched hand are detected, providing a camera pose estimation relative to the hand. As a user places the hand on the surface of a tabletop environment, the hand's coordinate system is propagated to the environment, detecting distinctive image features in the scene. The features are tracked fast and robustly using optical flow. In this way, a new tabletop AR environment is set up without having to carry a marker or a sophisticated tracking system to the environment itself. We also demonstrate a proof-of-concept application for establishing a tabletop AR environment and recognizing a scene when detecting its features.
The Dynamic Competition Diffusion Model of B2C E-commerce in Potential Customers
Authors: Yuantao Jiang, Zhisheng Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Various models have been constructed to explore the principles of competition diffusion of B2C e-commerce (hereafter e-commerce) in customers. The relationships between e-commerce websites also draw the attention of scholars, and many diffusion theory of e-commerce has been built to understand the competitive market environment. In fact, the potential group of customers is vitally important for e-commerce competition diffusion since the updating rate of e-commerce websites is too frequent in the information age now. In order to uncover the diffusion principles of e-commerce for competing in potential customers, this research concentrate on constructing a dynamic diffusion model of e-commerce that are striving with each other for potential customers.
Blind signature and ring signature schemes: Rehabilitation and attack
Authors: Sherman S. M. Chow
Venue: Computer Standards Interfaces (2009)

Blind signature and ring signature are two signature schemes with privacy concern. Zhang [Jianhong Zhang, Linkability analysis of some blind signature schemes, In International Conference on Computational Intelligence and Security 2006, IEEE, vol. 2, 2006, pp. 1367-1370, (Available at http://dx.doi.org/10.1109/ICCIAS.2006.295283.)] analyzed the unlinkability of Zhang and Kim [Fangguo Zhang, Kwangjo Kim, ID-based blind signature and ring signature from pairings, in: Yuliang Zheng (Ed.), Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2501, Springer, 2002, pp. 533-547], Huang et al. [Zhenjie Huang, Kefei Chen, Yumin Wang, Efficient identity-based signatures and blind signatures, in: Yvo Desmedt, Huaxiong Wang, Yi Mu, Yongqing Li (Eds.), Cryptology and Network Security, 4th International Conference, CANS 2005, Xiamen, China, December 14-16, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3810, Springer, 2005, pp. 120-133] and Wu et al. [Qianhong Wu, Willy Susilo, Yi Mu, Fangguo Zhang, Efficient partially blind signatures with provable security, in: Osvaldo Gervasi, Marina L. Gavrilova, (Eds.), Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III, Lecture Notes in Computer Science, vol. 4707, Springer, 2007, pp. 1096-1105] and claimed that they are indeed linkable. On the other hand, Gamage et al. [Chandana Gamage, Ben Gras, Bruno Crispo, Andrew S. Tanenbaum, An identity-based ring signature scheme with enhanced privacy, Securecomm and Workshops 2006, IEEE, 2006, pp. 1-5, (Available at http://dx.doi.org/10.1109/SECCOMW.2006.359554)] claimed that the scheme of Chow et al. [Sherman S.M. Chow, Siu-Ming Yiu, Lucas Chi Kwong Hui, Efficient identity based ring signature, in: John Ioannidis, Angelos D. Keromytis, Moti Yung (Eds.), Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3531, 2005, pp. 499-512] is vulnerable to key exposure attack. This paper shows that all these claims are incorrect. Furthermore, we show that the scheme proposed by Gamage et al. [Chandana Gamage, Ben Gras, Bruno Crispo, Andrew S. Tanenbaum, An identity-based ring signature scheme with enhanced privacy, Securecomm and Workshops 2006, IEEE, 2006, pp. 1-5, (Available at http://dx.doi.org/10.1109/SECCOMW.2006.359554)] which aimed to provide enhanced privacy actually has privacy level reduced. We hope this work can pinpoint the standard one should use when analyzing the unlinkability of blind signatures and the anonymity of ring signatures.