ppxscal/embedding_network huggingface dataset:
On the computation and interpretation of auto- and cross-trispectra
Authors: V. Chandran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper discusses the principal domains of auto- and cross-trispectra. It is shown that the cumulant and moment based trispectra are identical except on certain planes in trifrequency space. If these planes are avoided, their principal domains can be derived by considering the regions of symmetry of the fourth order spectral moment. The fourth order averaged periodogram will then serve as an estimate for both cumulant and moment trispectra. Statistics of estimates of normalised trispectra or tricoherence are also discussed.
Scheduling refinement in abstract RTOS models
Authors: Fabiano Hessel, Vitor M. Da Rosa, Carlos Eduardo Reif, César Marcon, Tatiana Gadelha Serra Dos Santos
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

Scheduling decision for real-time embedded software applications has a great impact on system performance and, therefore, is an important issue in RTOS design. Moreover, it is highly desirable to have the system designer able to evaluate and select the right scheduling policy at high abstraction levels, in order to allow faster exploration of the design space. In this paper, we address this problem by introducing an abstract RTOS model, as well as a new approach to refine an unscheduled high-level model to a high-level model with RTOS scheduling. This approach is based on SystemC language and enables the system designer to quickly evaluate different dynamic scheduling policies and make the optimal choice in early design stages. Furthermore, we present a case of study where our model is used to simulate and analyze a telecom system.
Cryptanalysis of Block Ciphers via Improved Simulated Annealing Technique
Authors: Nalini N, Raghavendra Rao G
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Cryptanalysis of ciphers has been successfully demonstrated through several techniques such as brute force attack, linear and differential cryptanalysis and heuristic optimisation methods. To demonstrate the power of heuristic optimisation techniques for attacks of modern-day ciphers, we present for the first time systematic experiments on heuristic-based attacks of modified versions of Data Encryption Standard (DES) with 48 bits. A novel contribution of this work lies in combining the features of differential cryptanalysis and heuristic optimisation methods. This is possible by using differential cryptanalysis to obtain 42 bits of the key whereas the remaining missing 14 key bits are obtained through heuristic optimisation methods by a choice of suitable composite fitness function to capture this combined use of both these approaches. The studies reported in this paper will be useful for the attacks of other similar ciphers.
Accuracy improved ADI-FDTD methods: Research Articles
Authors: Iftikhar Ahmed, Zhizhang (David) Chen
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

FDTD method plays an important role for simulation of different structures in various fields of engineering, such as RF&#x002F;microwaves, photonics and VLSI. However, due to the CFL stability constraint, the FDTD time step is still small and the related CPU time is still large for modelling fine geometry where small cell sizes are required to resolve fields. As a result, the unconditionally stable CFL-condition-free ADI-FDTD method is becoming a popular alternative to the FDTD method. The ADI-FDTD method allows the use of larger time steps; however, it comes at the cost of larger errors. To mitigate the problem of these larger errors, in this paper we propose to modify the conventional ADI-FDTD algorithm. The modifications are based on the fact that because the ADI-FDTD is a truncated form of the Crank&ndash;Nicolson (CN) method, the truncated terms can be re-introduced approximately into the ADI algorithms to improve accuracy. Two accuracy-improved ADI-FDTD algorithms are derived and then validated for two-dimensional cases. Unfortunately, in the three-dimensional case the proposed methods are not found to be unconditionally stable. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Exploring the relationship between teachers' curriculum enactment experience and their understanding of underlying unit structures
Authors: Hsien-Ta Lin, Barry J. Fishman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This study investigates teachers' understanding of underlying unit structures including: the relationship between lessons and curriculum design principles; and the connections among lessons in a unit. We investigated: (1) teachers' understanding of curriculum design principles; and (2) the role of teachers' experiences with curriculum units in their understanding of underlying unit structures. Using clinical interviews, we identified patterns in teachers' understanding. We found that teachers do not understand design principles and the relationships between these principles and lessons well, although more experienced teachers seem to know more than less experienced peers. Teachers also have difficulty identifying connections among lessons and therefore the overall unit structures. Both of these findings are problematic for curriculum developers seeking implementation that is "true" to the intentions of the materials. This study helps to inform future design of curriculum units, professional development, and tools that help teachers understand unit structures.
Analysis of the influence of communication between researchers on experiment replication
Authors: Sira Vegas, Natalia Juristo, Ana Moreno, Martín Solari, Patricio Letelier
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

The replication of experiments is a key undertaking in SE. Successful replications enable a discipline's body of knowledge to grow, as the results are added to those of earlier replications. However, replication is extremely difficult in SE, primarily because it is difficult to get a setting that is exactly the same as in the original experiment. Consequently, changes have to be made to the experiment to adapt it to the new site. To be able to replicate an experiment, information also has to be transmitted (usually orally and in writing) between the researchers who ran the experiment earlier and the ones who are going to replicate the experiment. This article examines the influence of the type of communication there is between experimenters on how successful a replication is. We have studied three replications of the same experiment in which different types of communication were used.
Novel feature vector for image authentication
Authors: A. Datta, N. D. V. Lobo, J. J. Leeson
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

As the dissemination of images grows across the Internet, authentication of images is becoming an important research issue. Image watermarking techniques are the most used forms to authenticate an image, however they introduce distortions in the original image and are vulnerable to a multitude of attacks. In this paper we present a novel method to authenticate images. We propose that instead of watermarking images, we can authenticate an image by calculating an invariant feature vector which models the image based on its shape and illumination characteristics. We propose an algorithm to calculate such a robust feature vector which withstands a variety of attacks and hence can be a good alternative to watermarking techniques.
Personal Heart Monitoring and Rehabilitation System using Smart Phones
Authors: Peter Leijdekkers, Valerie Gay
Venue: Proceedings of the International Conference on Mobile Business (2006)

This paper discusses a personalized heart monitoring system using smart phones and wireless (bio) sensors. Based on several scenarios we present the functionality of a prototype we have built. The application is capable of monitoring the health of high risk cardiac patients. The smart phone application analyses in real-time sensor and environmental data and can automatically alert the ambulance and pre assigned caregivers when a heart patient is in danger. It also transmits sensor data to a healthcare centre for remote monitoring by a nurse or cardiologist. The system can be personalized and rehabilitation programs can monitor the progress of a patient. Rehabilitation programs can be used to give advice (e.g. exercise more) or to reassure the patient.
An ontology-driven framework for process-oriented applications
Authors: Perakath Benjamin, Kumar V. Akella, Kaiser Malek, Ronald Fernandes
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes an ontology-driven framework for process-oriented applications. The research described in this paper is motivated by the lack of information sharing mechanisms at the semantic level among process-oriented applications. Our approach addresses this problem through the determination of inter-application information flow requirements via an analysis of (i) application method ontologies and (ii) application software tool ontologies. The tool describes the overall ontology driven approach and the inter-method ontology mappings that drive the inter-tool information flow requirements. An example information integration scenario is outlined in order to illustrate the practical application of our approach. Lastly, we summarize the research and outline the benefits.
An Implementation on Remote Control of Embedded Network System using a PDA
Authors: Yu Fan, Soo-Young Park
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

We can see intelligent products with high AI (artificial intelligence) everywhere in our daily life. Intelligent telephones, intelligent copiers, intelligence washing machines, intelligent refrigerators, intelligent robots and so on. So we will ask ourselves how these products work and why. If we push a button the intelligent product can easily finish there own work by embedded chips which were firstly programmed so that we don't need stand by and waiting for any nugatory work. But there is also a problem that these machines can not do anything if there are no people. My business is to program remote control function for a PDA (personal digital assistants) so that we can use a PDA to control these machines with wireless network card. Unfortunately, rates and ranges of the wireless network card differ depending on your location.
Strengthening ECDSA Verification Algorithm to be More Suitable to Mobile Networks
Authors: Komathy K, Narayanasamy P
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The primary objective of the paper is to augment the efficiency of signature process in Elliptic Curve Digital Signature Algorithm (ECDSA), which turns out to be a bottleneck in mobile devices due to its heavy consumption of resources. An improved algorithm for strengthening the speed of verification process in ECDSA is proposed and evaluated. A comparative study of Comb algorithm with the proposed algorithm for simultaneous multiplication on the NISTrecommended elliptic curves over prime fields is done and a broad analysis of the outcomes are also carried out. Strengthening the pre-computation process with respect to the speed of execution during verification will be the crucial task of this implementation.
User defined monitoring strategies for BDI agent programs
Authors: Timothy William Cleaver, Abdul Sattar, Raihana Ferdous
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

An agent needs to balance its time between reflecting on its past behaviors, the execution of its current behaviors and the recognition of opportunities for future action. The optimal strategy to achieve this balance is heavily dependent on the environment in which the agent is situated. In this paper we extend a BDI agent programming language called AgentSpeak(L) in two ways. Firstly we refine the use of execution monitoring to enable agents to reflect on their past endeavors. Secondly, we extend the semantics and syntax of the language to allow for user defined monitoring strategies. This allows agent designers to utilize execution monitoring in a way that balances the focus of an agents behavior in a way that is appropriate for its application domain.
Data-Dependency Graph Transformations for Superblock Scheduling
Authors: Mark Heffernan, Kent Wilken, Ghassan Shobaki
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In gen- eral, scheduling superblocks is an NP-Hard optimiza- tion and prior work includes both heuristic (polynomial- time) and optimal (enumerative) scheduling techniques. This paper presents a set of transformations to the data-dependency graph which significantly improves the results of heuristic and enumerative superblock scheduling. The graph transformations prune redun- dant and inferior schedules from the problem solution space. Heuristically scheduling the transformed data- dependency graphs yields significant reduction in ex- pected execution time for hard superblocks. Also, enu- meratively scheduling the transformed graphs is faster, and an optimal schedule is found for more problem in- stances within a bounded time. The transformations are applied to superblocks generated with the GNU Compiler Collection (GCC) using the SPEC CPU2000 benchmarks targeted to various processor models. The experimental results confirm that the transformations significantly improve the results for heuristic and enu- merative superblock scheduling.
Empirical Studies of the Existence of the Biometric Menagerie in the FRGC 2.0 Color Image Corpus
Authors: M. Wittman, P. Davis, P. J. Flynn
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The issue of recognizability of subjects in biometric identification is of particular interest to the designers of these systems. We have applied the concept of Doddington's biometric menagerie to the area of facial recognition. We performed a series of tests for the presence of goats, lambs, and wolves on FRGC 2.0 color image data. The data for the subjects that appeared at the extreme end of these tests was then visually examined. Even a cursory comparison of images showed that for this set of data, some images fell into the defined menagerie categories. Our tests show the statistical existence of these animal classifications within the constraints of this set of FRGC 2.0 data using the baseline matching algorithm. Ultimately, these tests were limited by the image data set and matching algorithm used. For further confirmation of the existence of the menagerie, the analysis must be expanded to include different image sets and matching algorithms..
Error-Tolerance and Multi-Media
Authors: Melvin A. Breuer, Haiyang (Henry) Zhu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Error-tolerance deals with the use of defective circuitry that occasionally produces errors, yet provides acceptable performance to end users when executing certain applications. The motivation for using such devices is the related increase in effective yield, and hence lower cost parts. We present a framework for the analysis of the applicability of error-tolerance. The framework is illustrated with respect to a digital telephone-answering device, but is applicable to a broad class of multi-media systems. Key components of this framework are: defining acceptable yet imperfect behavior; determining if a large class of realistic defects in a subsystem provide acceptable behavior at the system level; and determining how to recognize (test) if a defective subsystem will provide acceptable system performance.
Team tutoring systems: reifying roles in problem solving
Authors: Mark K. Singley, Peter G. Fairweather, Steven Swerling
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

We are pursuing the notion of a Team Tutoring System, an intelligent tutoring system that monitors and manages teams of students as they collaborate synchronously and remotely to solve extended, distributed, multi-step problems. Our system, named Algebra Jam, provides opportunities for each team member to take on a variety of roles in order to come to know the domain from a variety of perspectives. To do this, we are defining a typology of collaborative problem solving roles, reifying these roles at the problem solving interface, and accumulating evidence about individual behavior and group problem solving performance in a Bayesian inference network.
Three-Dimensional Shape-Structure Comparison Method for Protein Classification
Authors: Petros Daras, Dimitrios Zarpalas, Apostolos Axenopoulos, Dimitrios Tzovaras, Michael Gerassimos Strintzis
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2006)

In this paper, a 3D shape-based approach is presented for the efficient search, retrieval, and classification of protein molecules. The method relies primarily on the geometric 3D structure of the proteins, which is produced from the corresponding PDB files and secondarily on their primary and secondary structure. After proper positioning of the 3D structures, in terms of translation and scaling, the Spherical Trace Transform is applied to them so as to produce geometry-based descriptor vectors, which are completely rotation invariant and perfectly describe their 3D shape. Additionally, characteristic attributes of the primary and secondary structure of the protein molecules are extracted, forming attribute-based descriptor vectors. The descriptor vectors are weighted and an integrated descriptor vector is produced. Three classification methods are tested. A part of the FSSP/DALI database, which provides a structural classification of the proteins, is used as the ground truth in order to evaluate the classification accuracy of the proposed method. The experimental results show that the proposed method achieves more than 99 percent classification accuracy while remaining much simpler and faster than the DALI method.
A Novel Audio Watermarking in Wavelet Domain
Authors: Ming Li, Yun Lei, Jian Liu, Yonghong Yan
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A novel approach is proposed for robust audio water- marking in wavelet domain. It emphasizes on enhancing security by dynamically modifying embedding strategy. The modification is based on real-time changes of the water- mark information and host audio. Without using any secret key, informative watermark are embedded into audio with different strength. The distribution of watermarked audio in wavelet domain is relatively similar to clean audio, com- pared to existing watermarking schemes in wavelet domain. The analysis and experimental results are given to demon- strate that the proposed watermarking scheme is effective against common signal processing manipulations and at- tacks, such as Gaussian noise corruption, resampling, re- quantization, MP3 compression and D/A-A/D conversion.
Towards unbiased end-to-end network diagnosis
Authors: Yao Zhao, Yan Chen, David Bindel
Venue: ACM SIGCOMM Computer Communication Review (2006)

Internet fault diagnosis is extremely important for end users, overlay network service providers (like Akamai [1]) and even Internet service providers (ISPs). However, because link-level properties cannot be uniquely determined from end-to-end measurements, the accuracy of existing statistical diagnosis approaches is subject to uncertainty from statistical assumptions about the network. In this paper, we propose a novel Least-biased End-to-end Network Diagnosis (in short, LEND) system for inferring link-level properties like loss rate. We define a minimal identifiable link sequence (MILS) as a link sequence of minimal length whose properties can be uniquely identified from end-to-end measurements. We also design efficient algorithms to find all the MILSes and infer their loss rates for diagnosis. Our LEND system works for any network topology and for both directed and undirected properties, and incrementally adapts to network topology and property changes. It gives highly accurate estimates of the loss rates of MILSes, as indicated by both extensive simulations and Internet experiments. Furthermore, we demonstrate that such diagnosis can be achieved with fine granularity and in near real-time even for reasonably large overlay networks. Finally, LEND can supplement existing statistical inference approaches and provide smooth tradeoff between diagnosis accuracy and granularity.
Changing Visual Practices
Authors: Catelijne Coopmans, Jennifer Whyte
Venue: Proceedings of the conference on Information Visualization (2006)

In emerging theoretical models of innovation, digital simulation and prototyping tools are described as new means of production. However, relatively little is known about how such digital tools are used in construction and other industrial contexts, in particular how they are changing visual practices. In this paper, we present a study of the changes associated with interactive 3D technologies between 1990 and 2005 and we situate the findings in the context of innovation theory. With an empirical focus on the construction and film/television industries, our study is based both on the analysis of articles in trade publications and on interviews with key stakeholders. The dataset suggests that aspirations for these technologies are closely linked to their role as means of production; however, new practices also develop around the technologies as ends. We highlight preliminary implications of this study for industry, and give suggestions for further research in this area.
Value-Centric, Model-Driven Business Transformation
Authors: Juhnyoung Lee, Anca-Andreea Ivan
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)

Business transformation is a key executive management initiative that attempts to align the technology initiatives of a company closely with its business strategy and vision. Business transformation projects are often hampered by situations known as "business-IT gaps", which lead to failures in demonstrating the business values of IT functions and capabilities. To address this problem, we propose an innovative model-driven approach to value-centric business analysis and transformation. This new approach maps IT functions and capabilities to business performance, and facilitates the demonstration of the delivered value of IT and services. Also, the approach integrates value models with business models of processes and components to leverage the value model at different levels and phases of business transformation.
Improving plasma stabilization system in ITER by excluding non-efficient poloidal coils
Authors: D. A. Ovsyannikov, A. D. Ovsyannikov, A. P. Zhabko, E. I. Veremey, B. A. Misenov, V. A. Belyakov, A. A. Kavin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

In the paper the problem of plasma control in the toroidal magnetic chamber of ITER tokamak is investigated. Extreme physical conditions in tokamaks lead to very high requirement to control accuracy for electromagnetic capture system while positioning plasma within given gaps from the walls of chamber. On the other hand, real conditions restrict some characteristics, such as control power. Mathematical methods of stabilizing control design based on modern optimization theory are proposed. These methods were designed to increase control efficiency by redistributing its power between tasks.