ppxscal/embedding_network huggingface dataset:
CFI-Stream: mining closed frequent itemsets in data streams
Authors: Nan Jiang, Le Gruenwald
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent closed itemsets, but they are mainly intended for traditional transaction databases and thus do not take data stream characteristics into consideration. In this paper, we propose a novel approach for mining closed frequent itemsets over data streams. It computes and maintains closed itemsets online and incrementally, and can output the current closed frequent itemsets in real time based on users' specified thresholds. Experimental results show that our proposed method is both time and space efficient, has good scalability as the number of transactions processed increases and adapts very rapidly to the change in data streams.
Delta-IDDQ Testing of Resistive Short Defects
Authors: Piet Engelke, Ilia Polian, Hans Manhaeve, Michel Renovell, Bernd Becker
Venue: Proceedings of the 15th Asian Test Symposium (2006)

This paper addresses the efficiency of IDDQ and more specifically Delta-IDDQ testing when using a realistic short defect model that properly considers the relation between the resistance of the short and its detectability. The results clearly show that the Delta-IDDQ approach covers a large number of resistive shorts missed by conventional logic testing, requiring only a relatively small vector set. In addition a significant number of defects which are proven to be undetectable by logic testing but may deteriorate and result in reliability failures are detected. The Delta-IDDQ threshold and thus the equipment sensitivity is shown to be critical for the test quality. Furthermore, the validity of the traditional IDDQ fault models when considering resistive short defects is found to be limited. For instance, the use of the fault-free next-state function for sequential IDDQ fault simulation is shown to result in a wrong classification of some resistive short defects. This is the first systematic study of IDDQ testing of resistive short defects. The impact of the threshold on the defect coverage is quantified for the first time. Although the simulation results are based upon a 0.35ìm technology, the results and methodology can be transferred to state-of-theart and NanoTechnologies.
Fast Feature Selection Method for Continuous Attributes with Nominal Class
Authors: Manuel Mejia-Lavalle, Eduardo F. Morales, Guillermo Rodriguez
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Feature selection has become a relevant pre-processing problem on knowledge discovery in databases, because of very large databases or because some attributes are expensive to obtain. There is a large number of diverse feature selection methods for databases with pure nominal data (attributes and class), or pure continuous data, but little work has been done for the case of continuous attributes with nominal class. Normally what we can do is perform discretization, and then apply some traditional feature selection method; however the results can vary greatly depending on the discretization method used. We propose a direct method for feature selection on continuous data with nominal class, inspired in the Shannon's entropy and an Information Gain measure. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and to produce very competitive solutions with a small set of attributes
Interaction Styles for Service Discovery in Mobile Business Applications
Authors: Markus Aleksy, Colin Atkinson, Philipp Bostan, Thomas Butter1, Martin Schader
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

As the power of mobile devices continues to grow, and the range of resources accessible via wireless networks expands, there is an increasing need to offer services to users in a customized way, based on their immediate desires and context. At the same time, to construct such applications in a cost-effective and reusable way, there is also a growing pressure on mobile application developers to structure their systems in terms of a service-oriented architecture. However, these two goals are not always compatible. In this paper we present a new set of architectural components and principles which allow context-sensitive, mobile business applications to be assembled in highly flexible and reuse-oriented way based on the principles of SOA. We present the four main configuration patterns and interaction styles which this architecture supports and evaluate their pros and cons from the perspective of different infrastructure and usability issues such as bandwidth usage, latency needs, pricing and, privacy. Finally, we discuss which configuration to use in which circumstances.
Designing a Decision Support System for Existing Clinical Organizational Structures: Considerations From a Rheumatology Clinic
Authors: Örjan Dahlström, Ingrid Thyberg, Ursula Hass, Thomas Skogh, Toomas Timpka
Venue: Journal of Medical Systems (2006)

The aim of this study was to identify the social and organizational requirements for a decision support system (DSS) to be implemented in a clinical rheumatology setting, utilizing data-mining techniques. Field observations and focus group interviews were used for data collection. The decision-making was found to be situated, patient-focused, and long-term in nature. At the same time, the main part of peer-to-peer communication was informal. Patient records were involved in almost every decision. The conclusion is that the main challenges, when introducing a DSS at a rheumatology unit, are adapting the system to informal communication structures and integrating it with patient records. Considering incentive structures, understanding workflow and incorporating awareness are relevant issues when addressing these issues in future studies.
Effective Web-Service Creation Mechanism for Ubiquitous Service Oriented Architecture
Authors: Yusuke Nakano, Michiharu Takemoto, Yoji Yamato, Hiroshi Sunaga
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

This paper proposes a novel method for creating Web services from functions or content provided by ordinary Web applications. Since service composition platforms for context-aware ubiquitous computing and communication services are being actively studied and developed, resources for composing a meaningful and useful service should be obtainable at all times and in any situation. Because such platforms use Web services as a uniform interface, the number of Web services that can be used as resources should be increased. Here, the use of wrappers that convert functions provided by ordinary Web applications into Web services is a very effective approach that can produce various kinds of services. To enable this mapping, our method extracts the HTML structure of a Web application by analyzing its features through fast Fourier transformation to produce an HTML spectrum. By converting the peak part of the HTML spectrum to the Web service interface, it can easily construct a Web service. This method will be useful for promoting ubiquitous business.
Structured analysis techniques for large Markov chains
Authors: Peter Buchholz
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

Analysis of large and realistic Markov models suffers mainly from the so-called state space explosion. Large systems of equations have to be solved to obtain the result measures. The limiting factors of a solution are space and time. Apart from using more powerful computers for the solution, sophisticated data structures have been used for a compact storage of huge Markov chains and new efficient analysis techniques have been developed recently to exploit structure in the model for a more efficient analysis of the Markov chains. This paper gives an overview of analysis techniques based on model structure, describes the availability of these new techniques and outlines future research directions in the field.
Cognitive Work Analysis and Design Research: Designing for Mobile Human-Technology Interaction Within Elementary Classrooms
Authors: Latika Nirula, Earl Woodruff
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

This paper discusses how Cognitive Work Analysis (CWA) can be seen as a critical element of the design research methodology. CWA has been shown to be an effective approach to adopt in analyzing, designing, and evaluating complex sociotechnical systems. Within design research, CWA can be seen as an integral precursor to any design iteration, as key constraints are identified and considered in collaboration with the classroom teacher in order to design effective innovations that optimize human-technology interactions. CWA may enable us to surmise why new mobile technologies may fail in their implementation in schools or do not have the level of impact on student learning they purport. We suggest how CWA informs the interpretation of the results of a study involving the introduction of handhelds in an elementary classroom, our understanding of the human-technology interaction in this context, and directions for iterations of design.
Towards Collaborative Environments for Ontology Construction and Sharing
Authors: Jie Bao, Doina Caragea, Vasant Honavar
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Ontologies that explicitly identify objects, properties, and relationships in specific domains are essential for collaborations that involve sharing of data, knowledge, or resources among autonomous individuals. Against this background, this paper motivates the need for collaborative environments for ontology construction, sharing, and usage; identifies the desiderata of such environments; and proposes package based description logics (P-DL) that extend classic description logic (DL) based ontology languages to support modularity and (selective) knowledge hiding. In P-DL, each ontology consists of packages (or modules) with well-defined interfaces. Each package encapsulates a closely related set of terms and relations between terms. Together, these terms and relations represent the ontological commitments about a small, coherent part of the universe of discourse. Packages can be hierarchically nested, thereby imposing an organizational structure on the ontology. Package-based ontologies also allow creators of packages to exert control over the visibility of each term or relation within the package thereby allowing the selective sharing (or conversely, hiding) of ontological commitments captured by a package.
Operation and Performance of Link-Quality Based Channel Assignment Schemes in Adaptive Packet-Switched Mobile Radio Systems
Authors: J. Gozalvez, J. J. González-Delicado
Venue: Wireless Personal Communications: An International Journal (2006)

This paper proposes and evaluates a set of physical level assisted cross-layer channel assignment schemes. These schemes allocate an incoming call the available channel that experienced the best channel quality conditions during previous transmissions. To estimate such conditions, three different link quality metrics have been considered. The performance of the proposed schemes has been compared to that of the commonly employed random allocation mechanism. The obtained results show that the proposed schemes improve the system performance of an adaptive packet-switched mobile radio system while also exhibiting the long-term channel uniform use characteristic of the random allocation mechanism. The higher performance attained with the proposed schemes is due to their short-term channel use pattern that results in an implicit cooperation among co-channel interfering cells during the channel allocation process. With the proposed schemes, interfering cells avoid assigning the same channels to simultaneous incoming calls, therefore reducing the experienced interference and increasing the system performance.
SmashGuard: A Hardware Solution to Prevent Security Attacks on the Function Return Address
Authors: Hilmi Ozdoganoglu, T. N. Vijaykumar, Carla E. Brodley, Benjamin A. Kuperman, Ankit Jalote
Venue: IEEE Transactions on Computers (2006)

A buffer overflow attack is perhaps the most common attack used to compromise the security of a host. This attack can be used to change the function return address and redirect execution to the attacker's code. We present a hardware-based solution, called SmashGuard, to protect against all known forms of attack on the function return addresses stored on the program stack. With each function call instruction, the current return address is pushed onto a hardware stack. A return instruction compares its address to the return address from the top of the hardware stack. An exception is raised to signal the mismatch. Because the stack operations and checks are done in hardware in parallel with the usual execution of instructions, our best-performing implementation scheme has virtually no performance overhead (because we are modifying hardware, it is impossible to guarantee zero overhead without an actual hardware implementation). While previous software-based approaches' average performance degradation for the SPEC2000 benchmarks is only 2.8 percent, their worst-case degradation is up to 8.3 percent. Apart from the lack of robustness in performance, the software approaches' key disadvantages are less security coverage and the need for recompilation of applications. SmashGuard, on the other hand, is secure and does not require recompilation of applications.
A new parallelization strategy for solving time-dependent 3D Maxwell equations using a high-order accurate compact implicit scheme: Research Articles
Authors: Eugene Kashdan, Barak Galanti
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2006)

With progress in computer technology there has been renewed interest in a time-dependent approach to solving Maxwell equations. The commonly used Yee algorithm (an explicit central difference scheme for approximation of spatial derivatives coupled with the Leapfrog scheme for approximation of temporal derivatives) yields only a second-order of accuracy. On the other hand, an increasing number of industrial applications, especially in optic and microwave technology, demands high-order accurate numerical modelling. The standard way to increase accuracy of the finite difference scheme without increasing the differential stencil is to replace a 2nd-order accurate explicit scheme for approximation of spatial derivatives with the 4th-order accurate compact implicit scheme. In general, such a replacement requires additional memory resources and slows the computations. However, the curl-based form of Maxwell equations allows us to construct an effective parallel algorithm with the alternating domain decomposition (ADD) minimizing the communication time. We present a new parallel approach to the solution of three-dimensional time-dependent Maxwell equations and provide a theoretical and experimental analysis of its performance. Copyright &copy; 2006 John Wiley & Sons, Ltd.The paper is based on the talk given at the SIAM conference &lsquo;Parallel Processing in Scientific Computing&rsquo;, San Francisco, CA, February 2004.This research was carried out during author's PhD studies at Tel Aviv University, Israel.
The Effect of Frame Freezing and Frame Skipping on Video Quality
Authors: Yining Qi, Mingyuan Dai
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Apparent motion discontinuities in the videos, such as frame freezing and frame skipping, are a common temporal degradation in the video transmission via Internet and Mobile channels. The end-user perceives a fluidity break of visual information having an impact on his quality assessment of the delivered video sequence. A video subjective test based on SAMVIQ (Subjective Assessment Methodology for VIdeo Quality) [1] has set up to estimate the effect of frame freeze and frame skip on video quality. In this paper, we will present the subjective test which has already set up for the estimation of video quality, then we can deduce the different situations of frame freeze and frame skip distortion has different impairments on video quality.
Querying Encrypted XML Documents
Authors: Ravi Chandra Jammalamadaka, Sharad Mehrotra
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

This paper proposes techniques to query encrypted XML documents. Such a problem predominantly occurs in "Database as a Service (DAS) architectures, where a client may outsource data to a service provider that provides data management services. Security is of paramount concern, as the service provider itself may be untrusted. Encryption offers a natural solution to preserve the confidentiality of the client's data. The challenge now is to execute queries over the encrypted data, without decrypting them at the server side. In this paper we develop: 1) primitives using which a client can specify the sensitive parts of the XML documents; 2) mechanisms to map the XML documents to encrypted representations that hides sensitive portions of the documents; and 3) techniques to run SPJ (Selection-projection-join) queries over encrypted XML documents. A strategy, where indices/ancillary information is maintained along with the encrypted XML documents is exploited, which helps in pruning the search space during query processing.
A Decision--Theoretic Assistant Based on Gesture Recognition
Authors: Jose Antonio Montero, Luis Enrique Sucar
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This paper presents a new approach that combines computer vision and decision theory for an automatic human assistant. The setting is a washstand where a person is trying to complete the activity "cleaning the hands", guided by auditive instructions. To perform this activity the user interacts with surrounding objects. We assume that each step of the activity can be recognized based on previous and current hand gestures, and their interaction with the objects in the environment. The proposed approach combines context-based gesture recognition with a decision theoretic model to select the most adequate message. Gesture recognition is based on hidden Markov models, combining motion and contextual information, where the context refers to the relation of the position of the hand with other objects. The posterior probability of each gesture is used in a partially observable Markov decision process (POMDP) to select the best auditive instruction according to a utility function. The POMDP is implemented as a dynamic Bayesian network with certain lookahead. Preliminary tests on the system based on a comparison with a human assistant show promising results.
Enhancing learning of expository science texts in a remedial reading classroom via iSTART
Authors: Roger S. Taylor, Tenaha O'Reilly, Grant P. Sinclair, Danielle S. McNamara
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Scientific literacy is a critical skill that requires the ability to deeply comprehend challenging scientific concepts. This research investigated the effectiveness of extended classroom practice with an automated reading strategy training program (iSTART) that is designed to enhance the comprehension of expository science text. Twelve 9th grade students, enrolled in a high school remedial reading program, were trained with the iSTART program. They were compared to a control group of twelve other 9th grade students, who were comparable in reading ability but who did not receive such training. There were no significant pretest-posttest differences between the groups on comprehension questions that could be answered from a single sentence within a passage. However, the iSTART training group performed significantly better than those in the control group on bridging inference questions, which require the generation of inferences between two or more sentences within a passage.
An OptimizedWorkload for Failure Data Analysis of Mobile P2P over Bluetooth Ad-Hoc Networks
Authors: G. Carrozza, M. Cinque, F. Cornevilli, S. Russo
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Mobile Peer-to-Peer (P2P) is a base paradigm for many new killer applications for mobile ad-hoc networks and the Mobile Internet. Currently, it is not well understood whether this paradigm is able to meet business and consumer dependability expectations. Dependability assessment of P2P applications can be achieved by field failure data analysis. The collection of failure data from wireless ad-hoc networks is a challenging task due to the intermittent usage and the mobility of users that do not allow to measure time-based dependability parameters. For this reason, we propose to deploy automated workloads on the actual peer nodes which have to operate continuously. Specifically, this paper formalizes the problem and presents the design of a workload for mobile P2P that aims to orchestrate the peers uniformly, letting the failure occurrence be independent of the network load. Simulation results and experimentation over an actual Bluetooth network demonstrate that the proposed workload meets the defined requirements.
Reconfiguring Publish/Subscribe Overlay Topologies
Authors: Helge Parzyjegla, Gero Gero Muhl, Michael A. Jaeger
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Distributed content-based publish/subscribe systems are usually implemented by a set of brokers forming an overlay network. Most existing publish/subscribe middleware assumes that the overlay topology is static. Those that consider reconfiguration, exchange a single link that is torn down by another link that comes up. However, they do not guarantee that no notifications are lost or duplicated nor do they ensure any message ordering policy. In this paper, we discuss the dynamic reconfiguration of publish/subscribe systems which are built on content-based routing. We present algorithms that allow for reconfigurations without notification loss or duplication that can also ensure FIFO-publisher and causal ordering. Moreover, the efficiency of reconfigurations is increased by limiting their effects to those parts of the network which are directly affected by the reconfiguration.
Wideband multiple target tracking
Authors: A. Satish, R. L. Kashyap
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

We propose a new scheme involving autoregressive parameter estimation and pattern classification with maximum likelihood (ML) direction of arrival (DOA) estimation to track multiple targets moving in the far-field. The targets are sources of wideband signals which impinge on a uniform linear array of passive sensors. These wideband signals are modeled as vector autoregressive (AR) models so that the spectral densities of the targets are characterized by a finite number of parameters. Defining each target as a 'class', we use ML estimates of AR parameters and DOA as components to form a feature vector for a particular class. A Bayes classifier is employed to decide which DOA estimate should be associated with which target. Target tracking is achieved by the combined process of spectral density estimation, estimation of DOA and classification at regular time intervals. Experimental results illustrate performance of the proposed method.