ppxscal/embedding_network huggingface dataset:
Mobile Web Services for Collaborative Learning
Authors: Mohamed Amine Chatti, Satish Srirama, David Kensche, Yiwei Cao
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

Since learning nowadays is conceptualized as a social system within communities of practice, the best way to learn is with others, in groups. In the past few years, there has been an increasing focus on social software applications as a result of the rapid development of new web technologies. Furthermore, mobile and ubiquitous technologies have provided capabilities for more sophisticated open social systems, where mobile knowledge sharing is the norm. In this paper, we explore the use of these concepts for learning and present a smart phone driven mobile Web Services architecture for collaborative learning.
Reversible Implementation of Densely-Packed-Decimal Converter to and from Binary-Coded-Decimal Format Using in IEEE-754R
Authors: A. Kaivani, A. Zaker Alhosseini, S. Gorgin, M. Fazlali
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

The Binary Coded Decimal (BCD) encoding has always dominated the decimal arithmetic algorithms and their hardware implementation. Due to importance of decimal arithmetic, the decimal format defined in lEEE 754 floating point standavd has been revisited. It uses Densely Packed Decimal (DPD) encoding to store signijkand part of a decimal floating point number. Furthermore in recent years reversible logic has attracted the attention of engineers for designing low power CMOS circuits, as it is not possible to realize quantum compufing withouf reversible logic implementation. This paper derives the reversible implementation of DPD converter to andfrom conventional BCD format using in IEEE 754R.
Optimizations for LTL Synthesis
Authors: Barbara Jobstmann, Roderick Bloem
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-Büchi tree automata and alternating weak tree automata [1]. By careful optimization of all intermediate automata, we achieve a major improvement in performance. We present several optimization techniques for alternating tree automata, including a game-based approximation to language emptiness and a simulation-based optimization. Furthermore, we use an incremental algorithm to compute the emptiness of nondeterministic Büchi tree automata. All our optimizations are computed in time polynomial in the size of the automaton on which they are computed. We have applied our implementation to several examples and show a significant improvement over the straightforward implementation. Although our examples are still small, this work constitutes the first implementation of a synthesis algorithm for full LTL. We believe that the optimizations discussed here form an important step towards making LTL synthesis practical.
Self-Organizing Sensor Networks for Integrated Target Surveillance
Authors: Pratik K. Biswas, Shashi Phoha
Venue: IEEE Transactions on Computers (2006)

Self-organization is critical for a distributed wireless sensor network due to the spontaneous and random deployment of a large number of sensor nodes over a remote area. Such a network is often characterized by its abilities to form an organizational structure without much centralized intervention. An important design goal for a smart sensor network is to be able have an energy-efficient, self-organized configuration of sensor nodes that can scan, detect, and track targets of interest in a distributed manner. In this paper, we propose a novel self-organization protocol and describe other relevant, indigenous building blocks that can be combined to build integrated surveillance applications for self-organized sensor networks. Experiments in both simulated and real-world platforms indicate that this protocol can be useful for tracking targets that follow a predictable course.
Workload-aware anonymization
Authors: Kristen LeFevre, David J. DeWitt, Raghu Ramakrishnan
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality of the resulting data. While the bulk of previous work has measured quality through one-size-fits-all measures, we argue that quality is best judged with respect to the workload for which the data will ultimately be used.This paper provides a suite of anonymization algorithms that produce an anonymous view based on a target class of workloads, consisting of one or more data mining tasks, as well as selection predicates. An extensive experimental evaluation indicates that this approach is often more effective than previous anonymization techniques.
In the News
Authors: Danna Voth, Heather Lanir
Venue: IEEE Software (2006)

The first story, "CodePlex: Microsoft's Latest Entry into Code Sharing," describes Microsoft's new environment for developers to create, host, and manage projects throughout the development cycle. The second story, "New Funding for Open Source Development," looks at the Open Source Development Labs' program for awarding fellowships to open source developers.
TTSF: A Novel Two-Tier Spam Filter
Authors: Yang Li, Bin-Xing Fang, Li Guo
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Spam prevention is a classic puzzle in the research area of network security. The conventional spam filtering techniques still result to high false positives and have weak on-line processing ability. This paper presents a novel Two-Tier Spam Filter (TTSF) on the basis of analyses over the conventional anti-spam techniques. TTSF on-line filters spam by using URLs and off-line filters spam using digest-based approach. Experimental evaluations from the constructed prototype based on TTSF demonstrate it can significantly raise the filtering accuracy, effectively reduce false positives and can be applied to on-line processing and heavy traffic environment by reducing the computational cost than the state-of-the-art techniques.
Removing blocking effects using an artificial neural network
Authors: Chin-Chen Chang, Chi-Shiang Chan, Chun-Sen Tseng
Venue: Signal Processing (2006)

In this paper, we shall propose a new method that modifies the AC coefficients of the image blocks suffering from blocking effects so as to improve the image quality. The AC coefficients are modified in accordance with the information provided by the neighboring blocks. Our new method employs an artificial neural network to help make clear the relationships between the AC coefficients of the current block and those of its neighboring blocks, so that we can accordingly determine whether or not to modify the current AC coefficients and what value the AC coefficients should be changed to. Then, after reversing the modified values from the DCT frequency domain to the pixel domain, we can successfully eliminate blocking effects. As our experimental results will show, our new method is capable of giving high quality images.
DB2 for OS/390 V5 vs. V6 outer join performance
Authors: M. Weihrauch
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The outer join operation is one of the most frequently used operations in a relational database management system. It becomes even more important in data warehouse and business intelligence applications. The processing of outer join of very large relations is a very costly operation. Therefore, a lot of effort has been expended in the development and implementation of optimization techniques to improve the performance of outer join. In this paper, the outer join optimization techniques implemented in DB2 UDB for OS/390 V6 (further reference as DB2 V6) are described and the efficiency is measured in a real world workload. 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
The Study of Key Technologies in Manufacturing Management-Control Integration
Authors: Zhaoshu Liu, Gangyan Li, Lili Zhu
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Currently, there is a great gulf fixed between management information system and process control system which handicaps the manufacturing information integration. The development and implementing of MES (Manufacturing Execution System) may resolve this problem. From the view of standard, this paper presents that the success of integration depends on three key technologies: the uniform information object, the uniform data collection technology and the uniform industrial control network. According to the key technologies, this paper studies S95 standard, OPC technology and Industrial Ethernet. Moreover, these standard technologies are extended and implemented in this paper, and the information integration in an auto-inner decorative fabric enterprise is developed.
On Scheduling Expansive and Reductive Dags for Internet-Based Computing
Authors: Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies - modeled via dags - for Internet-based computing. The goal of the schedules produced is to render tasks eligible for execution at the maximum possible rate. This goal aims: (a) to utilize remote clients' computational resources well, by always having work to allocate to an available client; (b) to lessen the likelihood of the "gridlock" that ensues when a computation stalls for lack of eligible tasks. The dags handled by the theory thus far are those that can be constructed from a given collection of bipartite building-block dags via the operation of dagcomposition. The current paper extends the range of applicability of the theory by significantly expanding the repertoire of building-block dags that the scheduling algorithms can handle. Thereby, the theory can now schedule large classes of "expansive" and "reductive" dags optimally.
A validation approach for neural network-based online adaptive systems: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: Sampath Yerramalla, Edgar Fuller, Bojan Cukic
Venue: Software&mdash;Practice Experience (2006)

Traditional software validation methods cannot guarantee the safe behavior of online self-adaptive systems. These systems are characterized by continual adaptation to changing environmental conditions. We present a novel methodology for validating adaptive software systems based on online operational monitoring. The methodology inherits its theoretical underpinnings from the generic stability and convergence analysis of Lyapunov's theory. Lyapunov theory is well established in mathematics and control theory, but has not been used before for software validation. The presented validation technique is applied to a neural network-based online self-adaptive system, the intelligent flight control system. In this application, environmental changes include system failure modes, such as a stuck stabilator, broken aileron and&sol;or rudder, sensor failure, etc. Our case study for validation is a specific online self-adaptive system, the intelligent flight control that utilizes dynamic cell structures' neural networks to perform online adaptation. The theoretical foundation and practicability of the presented validation technique make the presented validation approach generally applicable to other types of online adaptive systems. Copyright &copy; 2006 John Wiley & Sons, Ltd.
OURS: optimal unicast routing systems in non-cooperative wireless networks
Authors: Weizhao Wang, Stephan Eidenbenz, Yu Wang, Xiang-Yang Li
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strate-gyproofness (using weakly dominant strategy). In addition, we systematically study the unicast routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient unicast routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS).Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose a mechanism that provably creates incentives for intermediate terminals to cooperate in forwarding packets for others. Our mechanism substantially reduces the overpayment by using Nash equilibrium solutions as opposed to strategyproof solutions. We then study a more realistic case where the service requestor can act selfishly. (2) We first show that if we insist on the requirement of strategyproofness for the relay terminals, then no system can guarantee that the central authority can retrieve at least 1overn of the total payment. (3) We then present a strategyproof unicast system that collects 1over2n of the total payment, which is thus asymptotically optimum. (4) By only requiring Nash Equilibrium solutions, we propose a system that creates incentives for the service requestor and intermediate terminals to correctly follow the prescribed protocol. More importantly, the central authority can retrieve at least half the total payment. We verify the economic efficiency of our systems through simulations that are based on very realistic terminal distributions.
A Computation Core for Communication Refinement of Digital Signal Processing Algorithms
Authors: Sylvain Huet, Emmanuel Casseau, Olivier Pasquier
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The most popular Moore's law formulation, which states the number of transistors on integrated circuits doubles every 18 months, is said to hold for at least another two decades. According to this prediction, if we want to take advantage of technological evolutions, designer's productivity has to increase in the same proportions. To take up this challenge, system level design solutions have been set up, but many efforts have still to be done on system modelling and synthesis. In this paper we propose a computation core synthesis methodology that can be integrated on the communication refinement steps of electronic system level design tools. In the proposed approach, computation cores used for digital signal processing application specifications relying on coarse grain communications and synchronizations (e.g. matrix) can be refined into computation cores which can handle fine grain communications and synchronizations (e.g. scalar). Its originality is its ability to synthesize computation cores which can handle fine grain data consumptions and productions which respect the intrinsic partial orders of the algorithms while preserving their original functionalities. Such cores can be used to model fine grain input output overlapping or iteration pipelining. Our flow is based on the analysis of a fine grain signal flow graph used to extract fine grain synchronizations and algorithmic expressions.
The DynCOAA algorithm for dynamic constraint optimization problems
Authors: Koenraad Mertens, Tom Holvoet, Yolande Berbers
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Numerous problems in software coordination, operations research, manufacturing control and others can be transformed in constraint optimization problems (COPs). Moreover, most practical problems change constantly, requiring algorithms that can handle dynamic problems.In this paper we present the dynamic constraint optimization ant algorithm (DynCOAA) that can solve dynamic COPs. DynCOAA is specifically designed for dynamic problems, as it is based upon the ant colony optimization (ACO) meta-heuristic that has already proven its merit in other dynamic optimization problems. DynCOAA is a distributed algorithm that is suited for a one-on-one mapping between variables and hosts, but it can effectively accommodate multiple variables per host. We compared our algorithm to two existing algorithms for dynamic constraint optimization: DynAWC and DynDBA. We find that DynCOAA outperforms DynAWC and DynDBA on some problems, while remaining competitive on others.
An Intelligent Decision Support System for Spare Parts Joint Replenishment
Authors: Lin Wang, Yurong Zeng, Yanhui Li, Hong Wang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

This paper presents a web-based intelligent decision support system (IDSS) for spare parts joint replenishment in a nuclear power plant. In this study, we integrate the artificial neural network and gene algorithms-based spare parts criticality class identifying system to confirm the target service level, and the web-based joint replenishment IDSS to obtain reasonable inventory control parameters that can be helpful for reducing of total inventory holding costs. The proposed IDSS was successful in decreasing inventories holding costs significantly by modifying the unreasonable purchase applications while maintaining the predefined target service level.
Towards a reference model for agent-based systems
Authors: Pragnesh Jay Modi, Spiros Mancoridis, William M. Mongan, William Regli, Israel Mayk
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The current state of the art in agent technology sees that several implementations of agent frameworks exist. However, there is little agreement on the terms and concepts used to describe such systems, which is a significant barrier towards adoption of these technologies by industry, military and commercial entities. A clear definition of terms and concepts at an appropriate level of abstraction is needed to facilitate discussion, evaluation and adoption of these emerging agent technologies. In this paper, we argue that a reference model for agent-based systems can fill this need. We discuss what a reference model is, why one is needed for agent-based systems, and our proposed methodology for creating such a reference model. While the complete model is a work in progress, we present a preliminary version to motivate further discussion from the agents community at large. It is our hope that ultimately a wider community of practice will assume responsibility for the standardization similar to the way that the well-known seven-layer Open Systems Interconnection (OSI) reference model was a driving force underlying communications standards.
Pulse transit time as an indirect marker for variations in cardiovascular related reactivity
Authors: Jong Yong Abdiel Foo, Chu Sing Lim
Venue: Technology and Health Care (2006)

Study of cardiac functions has shown to be important in understanding the prognosis and pathogenesis of vascular diseases. A physiologic parameter termed pulse transit time (PTT) has been studied intensively to be used as an indirect marker of such pathologic conditions. It is defined as the time it takes a pressure pulsation to travel between two arterial sites. For convenience of measurement, the interval between the peak of the R-wave on the electrocardiogram and the onset of the corresponding pulse in the finger pad measured by photoplethysmography is usually used. In this review, its definition, current applications in cardiovascular related studies and issues are presented in turn. Investigational studies suggest that PTT did not meet the level of accuracy required for medical practice as a marker for beat-to-beat blood pressure (BP). However, documented evidences indicate that PTT has high correlations when it is utilised as a surrogate semi-quantitative monitor of abrupt BP changes. Present literature suggests that description of disease-specific cardiovascular reactivity pattern is possible with techniques based on PTT. The attraction of PTT due to its non-invasive nature and revealing properties can only increase. Hence, the use of this simple technique in a clinical setting is still to realise its full potential
Signalling Management to Reduce Roaming Effects over Streaming Services
Authors: M. Vilas, X. G. Paneda, D. Melendi, R. Garcia, V. G. Garcia
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Multimedia streaming services performance depends on network conditions. To actively adapt streaming flow consumptions, streaming clients and servers estimate the available bandwidth. In recent years, intense research activity has been carried out on the effects of wireless LAN over streaming services. In this paper the analysis is focused on the effective periods of time during which streaming clients fail to receive data while roaming. The main conclusion is that wireless LAN handoff management produces temporary periods of high packet loss which affect bandwidth estimations. These underestimations reduce service performance during longer periods of time than those caused by the usual handover process. Also, mobile users can produce negative effects on static clients. Based on off-the-shelf WiFi hardware and unmodified commercial streaming clients and servers, a solution to mitigate all these negative effects, based on the pro-active management of signalling control messages between clients and server, is proposed.
Combining Scan Test and Built-in Self Test
Authors: Markus Seuring
Venue: Journal of Electronic Testing: Theory and Applications (2006)

For digital chips containing functional logic and embedded memories, these are usually tested separately: Scan test is used for testing functional logic; Memory Built-in Self Test (MBIST) is run for embedded memories. A new approach is proposed to exercise scan test and MBIST in parallel in order to reduce production test time and improve stress tests. It requires only small additional logic and allows to simultaneously run both test modes. In general, the approach can be used to control simultaneously scan test and any Built-in Self Test (BIST) providing a simple pass/fail result.