ppxscal/embedding_network huggingface dataset:
Combining Bayesian classifiers and estimation of distribution algorithms for optimization in continuous domains
Authors: Teresa Miquélez, Endika Bengoetxea, Alexander Mendiburu, Pedro Larrañaga
Venue: Connection Science (2007)

This paper introduces a evolutionary computation method that applies Bayesian classifiers to optimization problems. This approach is based on Estimation of Distribution Algorithms (EDAs) in which Bayesian or Gaussian networks are applied to the evolution of a population of individuals (i.e. potential solutions to the optimization problem) in order to improve the quality of the individuals of the next generation. Our new approach, called Evolutionary Bayesian Classifier-based Optimization Algorithm (EBCOA), employs Bayesian classifiers instead of Bayesian or Gaussian networks in order to evolve individuals to a fitter population. In brief, EBCOAs are characterized by applying Bayesian classification techniques-usually applied to supervised classification problems-to optimization in continuous domains. We propose and review in this paper different Bayesian classifiers for implementing our EBCOA method, focusing particularly on EBCOAs applying naïve Bayes, semi-na¨ive Bayes, and tree augmented na¨ive Bayes classifiers. This work presents a deep study on the behavior of these algorithms with classical optimiztion problems in continuous domains. The different parameters used for tuning the performance of the algorithms are discussed, and a comprehensive overview of their influence is provided. We also present experimental results to compare this new method with other state of the art approaches of the evolutionary computation field for continuous domains such as Evolutionary Strategies (ES) and Estimation of Distribution Algorithms (EDAs).
The structure of the help-seeking process in collaboratively using a computer coach in problem-based learning
Authors: Julien Mercier, Carl Frederiksen
Venue: Computers Education (2008)

Research on help seeking with a computer coach providing on-demand help has not produced fully adequate models of the process from a cognitive perspective. The present study postulates a model of help seeking from a cognitive perspective and tests this model in a learning situation characterized as problem-based and computer-supported. The participants were 18 graduate students from the faculty of Education of a Canadian university. Their participation involved solving a complex problem in statistics, in pairs, with the help of a computer coach, the McGill statistics tutor. Analysis of the performance data was performed using directed probability graphs and the log-linear approach. Results show that the model is reflected in the data. Implications for the design of computer coaches and instructional situations are discussed.
Liquid types
Authors: Patrick M. Rondon, Ming Kawaguci, Ranjit Jhala
Venue: ACM SIGPLAN Notices (2008)

We present Logically Qualified Data Types, abbreviated to Liquid Types, a system that combines Hindley-Milner type inference with Predicate Abstraction to automatically infer dependent types precise enough to prove a variety of safety properties. Liquid types allow programmers to reap many of the benefits of dependent types, namely static verification of critical properties and the elimination of expensive run-time checks, without the heavy price of manual annotation. We have implemented liquid type inference in DSOLVE, which takes as input an OCAML program and a set of logical qualifiers and infers dependent types for the expressions in the OCAML program. To demonstrate the utility of our approach, we describe experiments using DSOLVE to statically verify the safety of array accesses on a set of OCAML benchmarks that were previously annotated with dependent types as part of the DML project. We show that when used in conjunction with a fixed set of array bounds checking qualifiers, DSOLVE reduces the amount of manual annotation required for proving safety from 31% of program text to under 1%.
A comparative study of production control systems through simulation
Authors: Kivanc Onan, Bahar Sennaroglu
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The purpose of this paper is to simulate pull, push and hybrid production control systems for a single line, multi-stage and continuous production process, which is aluminium casting, in order to compare their performances where the current production control system is push system. The paper also provides an approach in constructing hybrid system by using TSP in minimizing total setup time to obtain optimal sequence of orders.
High performance set associative translation lookaside buffers for low power microprocessors
Authors: Jonathan R. Haigh, Lawrence T. Clark
Venue: Integration, the VLSI Journal (2008)

A fast low power four-way set-associative translation lookaside buffer (TLB) is proposed. The proposed TLB allows single clock phase accesses at clock frequencies above 1GHz. Comparisons to a conventional fully associative CAM tagged TLB, which is the type most commonly used in embedded processors, with the same number of entries on a 65nm low standby power process show that the proposed design has 28% lower delay and up to 50% lower energy delay product. Unlike previous set-associative TLBs, which replicate the TLB to support multiple page sizes, multiple page sizes are supported on a way-by-way basis. Alternative conventional CAM tagged and set-associative TLBs are investigated with regard to access latency, power dissipation and hit rates.
Mapping of the 26 December 2004 tsunami disaster by using FORMOSAT-2 images
Authors: M. D. Yang, T. C. Su, C. H. Hsu, K. C. Chang, A. M. Wu
Venue: International Journal of Remote Sensing (2007)

The Sumatra earthquake struck South Asia on 26 December 2004 and triggered monstrous waves that turned into a tsunami hitting the ocean regions and caused the most severe natural disaster of recent decades. The devastating earthquake and tsunami changed the landscape of coastal areas in many countries around the whole Indian Ocean region. To provide real-time information for rescue and rehabilitation plans, satellite images were applied to monitor and evaluate the damage over several devastated spots. The FORMOSAT-2 satellite, which was launched on 21 May 2004 and operated by the National Space Organization, Taiwan, is uniquely designed to take timely and low-cost black and white images daily with a resolution of 2 m and colour images of 8-m resolution. FORMOSAT-2 is expected to have many useful applications, such as natural-disaster evaluation, land-usage analysis, environmental monitoring, and coastal search and rescue. FORMOSAT-2 successfully acquired several post-tsunami images of the hazardous areas, both Puhket, Thailand and Banda Aceh, Indonesia on 28 December. A series of FORMOSAT-2 satellite images were processed by geometric and radiometric correction, haze reduction, image enhancement, feature extraction, image classification, and image fusion to assess the damage over those devastated areas. FORMOSAT-2 satellite images with a high-temporal resolution and high-spatial resolution were proved to be an efficient and useful information source for decision-makers to make rescue and recovery plans, especially for some isolated islands hard to reach in time.
Turbo techniques for joint source-channel decoding of multimedia content
Authors: Xavier Jaspar, Luc Vandendorpe
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

Joint source-channel turbo decoding is a promising alternative to classical tandem/separate decoding, as the literature has shown in the recent years. It is able at the receiver to jointly use and to benefit both from the redundancy left, or introduced intentionally, by the source code and from the error correcting capabilities of the channel code. This offers great advantages in terms of robustness with particular codecs, at the expense however of a reasonable increase in decoding complexity. We focus in this tutorial presentation on the derivation of such turbo decoders within the factor graph framework and the Sum-Product algorithm, and on theoretical arguments underlining some of the potentials of the joint source-channel turbo decoding concept.
A new resource selection approach based on reputation driven Min-min algorithm in the grid economy
Authors: Guanfeng Liu, Yuebin Xu, Shanzhou Ma
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

As Grid is a dynamic environment, the function of reputation is more and more obvious. Reputation systems have been a hot topic in the Peer-to-Peer community for several years. However the researches of it in the Grid are still not perfect, especially in the emerging Grid economy field. In this paper, we propose a reputation calculation model that is suitable in the economic-based Grid computing environment. We also propose a new module, Reputation Control Module (RCM), for the Grid Architecture for Computational Economy (GRACE), and give a detailed introduction of the internal structure of RCM and workflow of different module in GRACE architecture. Additionally, a reputation driven Min-min algorithm was designed based on reputation system in the Grid economy for resource selection. At last we show the performance of the system by simulating experiments.
A New Electronic Communication Technology - VT Position Code Communication Technology and Its Implementation
Authors: Shi Ying Zhou, Gui He Qin, Yu Bo Jin
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Now computer and electronic device technology has been monopolized by binary system, not only unable to break through the existing technology bottleneck, but bring a lot of potential safety problems. Aiming at this question, a new electronic communication technology is presented in this paper. The technology quantifies the time axis and the voltage axis synchronously, uses the quantified time dot as the address of the communication, and realizes the transmission of the multi-system data via transmitting the multi-steps voltage quantification. The technology solves the bottleneck problem of the speed, circuit and electromagnetism in the electronic communication, changes the binary system coding mode and communication connection form of the electronic device, reduces the transmission quantity of the redundant information, advances the security of electronic system and network, debases the complexity of the devices connection, enhances the rate of the processing and the transmission, simplifies the transformation between the difference protocols. The experimental results approve the validity and the robustness of the technology.
A Monte Carlo Method for Estimating the Extended All-Terminal Reliability
Authors: Shiang-Ming Huang, Quincy Wu, Shi-Chun Tsai
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Designing a network with optimal deployment cost and maximum reliability considerations is a hard problem, especially when the all-terminal reliability is required. For efficiently finding out an acceptable solution, Monte Carlo simulation (GAs) have been widely applied to solve this problem. In these GAs, the reliability values could be calculated in their objective functions. In year 2002, an extended network reliability model was proposed which considers the connection important level between each pair of nodes. This paper proposes an approximation algorithm based on Monte Carlo simulation for the new network reliability model. This approximation algorithm can be integrated into GAs to solve the optimal cost reliable network design problem under the extended model.
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Authors: David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalence. We are interested in the relationship between these two presentations. Using our characterisation of the behaviour preorders by means of simulations up-to we were able to generate the canonical preorders corresponding to each behaviour equivalence. The axiomatizations of these preorders can be obtained by adding to the axioms of the equivalence that of the appropriate simulation. Aceto, Fokkink and Ingolfsdottir have presented an algorithm that goes in the opposite direction, constructing an axiomatization of the induced equivalence from that of a given preorder. Following a different path we were able to get a correct proof and an enhanced algorithm. In this paper we present an shorter and simpler proof of this result, based on our coinductive characterisations of the behaviour preorders, and in particular in the existence of the canonical preorders. More important, we also present further generalisations of the result, since our coinductive characterisations are not only valid for the semantics coarser than the ready simulation. By means of these new proofs and results we hope to contribute to a better knowledge of the semantics of processes and to better understand the tight relations between preorders and equivalences that define them.
Compromising Reflections-or-How to Read LCD Monitors around the Corner
Authors: Michael Backes, Markus Dürmuth, Dominique Unruh
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

We present a novel eavesdropping technique for spying at a distance on data that is displayed on an arbitrary computer screen, including the currently prevalent LCD monitors. Our technique exploits reflections of the screen's optical emanations in various objects that one commonly finds in close proximity to the screen and uses those reflections to recover the original screen content. Such objects include eyeglasses, tea pots, spoons, plastic bottles, and even the eye of the user. We have demonstrated that this attack can be successfully mounted to spy on even small fonts using inexpensive, off-the-shelf equipment (less than 1500 dollars) from a distance of up to 10 meters. Relying on more expensive equipment allowed us to conduct this attack from over 30 meters away, demonstrating that similar attacks are feasible from the other side of the street or from a close-by building. We additionally establish theoretical limitations of the attack; these limitations may help to estimate the risk that this attack can be successfully mounted in a given environment.
A cooperative process-management system based on the manufacturing grid
Authors: Zuo-Liang Ye, Guo-Ning Qi, Xin-Jian Gu, Zhi-Gang Bao, Ya-Dong Qian
Venue: International Journal of Computer Integrated Manufacturing (2007)

The key features of manufacturing today are globalization, regional specialization, and multi-agent cooperation. The traditional network technologies have difficulties in meeting these demands in the new manufacturing environment, but the latest Grid technology provides new solutions. The development of Grid technology will significantly affect manufacturing. As a new manufacturing model, the Manufacturing Grid is emerging. Process management is an important aspect of manufacturing. In this work, a Grid-based cooperative process management system (GCPMS) was developed to cope with the complexity of worldwide production in the Internet environment. The following main modules are developed in the system: (1) the enterprise cooperation modelling module, (2) the project-management module, (3) the task-management module, and (4) the process-monitoring and control module. GCPMS benefits the dispersed institutions by creating a virtual project team to work together for a long-term project and effectively manage the cooperative process in manufacturing. The broader cooperation, application integration, and resource sharing are emphasized in the system. The open and standard interfaces bring GCPMS flexibility and scalability.
SIP paging and tracking of wireless LAN hosts for VoIP
Authors: Behcet Sarikaya, Xiao Zheng
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper introduces a new paging technique to track and wake up a mobile node (MN) attached to an access point (AP) in a wireless LAN network after a session initiation protocol (SIP) INVITE message is initiated by a caller. A tracking agent (TA) keeps track of the mobiles' handoffs between the APs. A paging agent (PA) triggers the TA to page the mobile when a SIP INVITE is received for one of its users. The context transfer feature of our paging protocol allows the paging messages to deliver the station context in order to enable faster session reestab-lishment. The AP then does onlink paging in a wireless link. SIP extensions are needed to trigger the PA to start paging MNs to notify their dormant status using an extended SIP REGISTER method. Tracking protocol is analyzed to compare soft- and hard-state approaches for state inconsistency ratio, message rate, and the overall cost. The simulation model we developed enables us to evaluate the traffic introduced by the tracking protocol and the cache (state) size. Paging protocol is analyzed for CPU processing times and the transmission delays in the SIP session setup with paging. Simulation of the paging with context transfer is used to show the gains in reauthentication.
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Authors: Yanqing Chen, Timothy A. Davis, William W. Hager, Sivasankaran Rajamanickam
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AAT, updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx&thinsp;=&thinsp;b, and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS. Both real and complex matrices are supported. CHOLMOD is written in ANSI/ISO C, with both C and MATLABTM interfaces. It appears in MATLAB 7.2 as x&thinsp;=&thinsp;A\b when A is sparse symmetric positive definite, as well as in several other sparse matrix functions.
An efficient scheme for secure group communication in mobile wireless sensor networks
Authors: Nahar Sultana, Eui-Nam Huh
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The deployment of sensor network, in security and safety critical environment requires secure communication primitives. Wireless mobile sensor network deployed in the hostile environments are susceptible to malicious traffic analysis which allow the enemy to trace the routing messages and the sensitive data packets. The network involves as group communication in this type of environment. This paper proposes and analyzes a scalable and efficient group communication scheme, by introducing identity based routing path in mobile wireless sensor networks. The system employs multiple member change operation in a group (group merge) and demonstrate a secure routing path for event changed group along with the existing group. Through comparison and simulation, we have shown that our protocol has high probability to be resilient and also having low communication overhead for secure communication among mobile nodes.
Minimization of multiway decision graphs for RTL verification by stochastic optimization
Authors: Yi Feng, Xiaoyu Song
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The complexity of digital hardware designs has increased substantially with new advancements in electronic designs. It is becoming increasingly difficult to verify their correctness. MDGs have been proved to be a very effective tool in automatic hardware verification of RTL designs. In this paper, a method of variable reordering for Multiway Decision Graphs (MDG) is discussed. We present an automatic dynamic variable ordering algorithm for MDGs to reduce the effects of the state explosion problem. By contrast to ROBDDs, in MDGs difficulties are created by the presence of first order terms. The method we present here merges the benefits of stochastic evolution and sifting. It will be utilized to minimize the MDG size throughout the verification procedure. The effectiveness of our method is demonstrated by the empirical results provided.
Enculturating conversational interfaces by socio-cultural aspects of communication
Authors: Matthias Rehm, Elisabeth André, Yukiko Nakano, Toyoaki Nishida
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

The workshop is centered around three main research challenges: 1.) Computationally viable models of cultural aspects of conversations: Cultural norms and values penetrate all our communications and interactions by giving us heuristics how to behave and how to interpret the verbal and nonverbal behavior of others. To make such a notion like culture available for computation, we need a very specific theory of culture that takes its effects on communication and interaction into account.2.) Reliable empirical data on cultural/cross-cultural interaction: To realize technical systems that take cultural influences on behavior into account, precise data analysis on how this influence manifests itself is necessary. In the literature, this information is often given in very general forms without to the precise data on which the observations are based.3.) Enculturating conversational interfaces: Having identified cultural influences on verbal/nonverbal communicative behaviors, it remains to be shown how this can be applied to the development of human-computer interfaces, for instance in an interface reflecting cultural norms and values of communication.