ppxscal/embedding_network huggingface dataset:
Clouds Mask Algorithm
Authors: Floricica Parauan, Mihaela Ordean, Andrei Diamandi
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The article exemplifies a way to identify the nature of a pixel up to different constants and indicators. An algorithm is described for clouds mask and pseudocode for snow respective ice detection. We present also the experimental results. In previous research we found different approaches of these algorithms but each of them attacks differently the subject.
Mobile Social TV: Extending DVB-H Services with P2P-Interaction
Authors: Raimund Schatz, Siegfried Wagner, Norbert Jordan
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

Mobile TV is widely considered as major future growth driver of mobile multimedia. Although certain benefits such as location-independence are evident, the potential of this medium reaches beyond plain "TV on the mobile'. In this paper, we propose the integration of service enablers for peer-to-peer interactivity into Mobile TV. Using our definition of Mobile Social TV we discuss opportunities of integrating content and peer-to-peer interaction in DVB-H services. Furthermore, we illustrate the concept by presenting our ongoing mobile TV research, technology and infrastructure aspects as well as future research directions.
Neural equalizer with adaptive multidimensional spline activation functions
Authors: M. Solazzi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a new neural architecture suitable for digital signal processing application. The architecture, based on adaptable multidimensional activation functions, allows one to collect information from the previous network layer in aggregate form. In other words the number of network connections (structural complexity) can be very low respect to the problem complexity. This fact, as experimentally demonstrated in the paper, improve the network generalization capabilities and speed up the convergence of the learning process. A specific learning algorithm is derived and experimental results, on channel equalization, demonstrate the effectiveness of the proposed architecture.
Implementation and Performance of a New Teleconference System by High Definition Omni-Directional Video Transmission over IP Network
Authors: Yosuke Sato, Yuya Maita, Koji Hashimoto, Yoshitaka Shibata
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

The omni-directional image has more advantages in that it provides a wider view than a single directional camera and able to realize flexible TV conferencing even between remotely separated small rooms. In this paper, In this paper, a new teleconference system by high definition flexible middleware system for omni-directional video transmission is introduced. we describe system architecture and functions of the middleware for high-definition omni-directional image control and effective video transmission system using DV and HDV (1080i format)[4]. Qos control function is also introduced to dynamically control the frame rate of video depending on the changes of network and CPU load. The prototype system of a TV conference is constructed to evaluate the performance of our suggested high-definition omni-directional system. Through the performance evaluation of the prototyped system, we could verify the usefulness of our proposed system.
an eye on network intruder-administrator shootouts
Authors: Luc Girardin
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

Carefully logging network activity is essential to meet the requirements of high security and optimal resource availability. However, detecting break-in attempts within this activity is a difficult task. Making the distinction between misuse and normal use is hard, and identifying intrusions that use novel attacks is fundamentally difficult. In this paper, we introduce a visual approach for analyzing network activity. This approach differs from anomaly and misuse detection because it considers human factors to support the exploration of network traffic. Our prototype application is based on an unsupervised neural network and consequently does not rely on any prior knowledge of the data being analyzed. We use self-organizing maps to project the network events on a space appropriate for visualization, and achieve their exploration using a map metaphor. The approach we present can be used to analyze past and present activities, as well as to show trends in the events. To demonstrate the usability of our tools, we describe the investigation of a dataset containing common intrusion patterns. We also discuss some weaknesses of current intrusion detection systems and propose a new paradigm for monitoring network activity that enables the discovery of new, sophisticated, and structured attacks.
Multistage Interconnection Networks with Multiple Outlets
Authors: Toshihiro Hanawa, Hideharu Amano, Yoshifumi Fujikawa
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Multistage Interconnection Networks(MINs) with multiple outlets are networks which can support higher bandwidth than that of nonblocking networks by passing multiple packets to the same destination. A novel MIN topology with multiple outlets called Piled Banyan Switching Fabrics (PBSF) is proposed for the Simple Serial Synchronized (SSS)-MIN used in multiprocessors, and analyzed with other two types of MIN with multiple outlets called Multi-Banyan Switching Fabrics (MBSF) and Tandem Banyan Switching Fabrics (TBSF). The throughput of these MINs is evaluated and compared with both the theoretical model and simulation. The PBSF supports the best throughput and latency used for the SSS-MIN. Although the latency of the TBSF is large, the pass-through ratio is close to 1 if the number of connected banyan networks are more than 4. Therefore, the TBSF is useful for the ATM switching networks in which the relatively large latency is tolerable. The conflict-free access of these MINs is also analyzed, and it appears that rows, column, forward and backward diagonal of the matrix can be accessed without conflict.
Multiple Sclerosis Diagnoses--Case-Base Reasoning Approach
Authors: V. Kurbalija, M. Ivanovic, Z. Budimac, M. Semnic
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Case-Based Reasoning (CBR) is the area of the artificial intelligence in which the new problems are solved by adapting the solutions of the previously successfully solved similar problems. Medicine is a suitable domain for application of CBR because the knowledge of medical experts consists of mixture of textbook knowledge and experience, which consists of cases. Architecture of the system for the diagnoses of multiple sclerosis disease, based on CBR is proposed in this paper.
A term recognition approach to acronym recognition
Authors: Naoaki Okazaki, Sophia Ananiadou
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present a term recognition approach to extract acronyms and their definitions from a large text collection. Parenthetical expressions appearing in a text collection are identified as potential acronyms. Assuming terms appearing frequently in the proximity of an acronym to be the expanded forms (definitions) of the acronyms, we apply a term recognition method to enumerate such candidates and to measure the likelihood scores of the expanded forms. Based on the list of the expanded forms and their likelihood scores, the proposed algorithm determines the final acronym-definition pairs. The proposed method combined with a letter matching algorithm achieved 78% precision and 85% recall on an evaluation corpus with 4,212 acronym-definition pairs.
Consumer decision support systems: Internet versus in-store application
Authors: S. J. Westerman, G. C. Tuck, S. A. Booth, K. Khakzar
Venue: Computers in Human Behavior (2007)

This paper reports a study of consumer decision support in the context of Internet and in-store applications. A sample (n=30) of experienced runners made running shoe selections in either 'product only', 'decision support system only', or 'decision support system and product' conditions. Participants' decisions tended to be more uniform and of better quality when the DSS was available. Decision making was clearly influenced by DSS recommendations, but these were not always accepted. In this latter circumstance participants reported themselves to be relatively less happy with and less confident in their decision. Consistent with previous literature, abstract attributes were considered more frequently and given higher weightings when using the decision support system. However, predicted differences between conditions with respect to the types of attributes considered and the importance ascribed to different types of attributes were not found.
Keynote address: Challenges of digital consumer and mobile SoC's: more Moore possible?
Authors: Tohru Furuyama
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Digital consumer and mobile products have continuously accommodated more features and functions. For example, the recent high-end cellular phones can operate as terrestrial digital TV viewers, MP3 music players, digital cameras, substitutes of credit cards and many more in addition to multi-modal wireless communication terminals that handle various formats; GSM, 3G, BT, WiFi and so on. These products require to best combine highly integrated SoC's and sophisticated software stacks in a timely manner. It is essential to establish a hardware/software co-development/verification environment with an ESL design methodologies and an IP reuse platform where various functions are realised on an SoC by legacy sub-systems with a low-power multi-processor architecture. This challenge gets more complicated in deep sub-100 nm technology nodes. Approaches to these complex problems from different aspects will be presented.
Device driver issues in high-performance networking
Authors: John Michael Tracey, Arindam Banerji
Venue: Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium (1994)

High-performance networking requires attention to operating system support at the device driver level. Existing driver models, such as those of Unix, are not necessarily well-suited to supporting high-speed network interfaces. In fact, current drivers may represent a significant obstacle between applications and the high-speed network adapters they seek to exploit. Yet existing models cannot simply be discarded. Certain trends in RISC processor design can also tend to make existing device driver implementations less efficient. Specifically, many drivers make extensive use of operations which are becoming relatively more costly as RISC architectures evolve. This paper describes an effort currently underway to develop device drivers specifically designed to support high-speed network interfaces on RISC architectures. We have analyzed the operation of some existing commercial device driver implementations and modified one using several techniques. Taken together, these techniques promise to produce network device drivers which deliver the high level of performance demanded by today's high speed networks.
Least and most disjoint root sets for Daubechies wavelets
Authors: C. Taswell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A new set of wavelet filter families has been added to the systematized collection of Daubechies (1988) wavelets. This new set includes complex and real, orthogonal and biorthogonal, least and most disjoint families defined using constraints derived from the principle of separably disjoint root sets in the complex z-domain. All of the new families are considered to be constraint selected without a search and without any evaluation of filter properties such as time-domain regularity or frequency-domain selectivity. In contrast, the older families in the collection are considered to be search optimized for extremal properties. Some of the new families are demonstrated to be equivalent to some of the older families, thereby obviating the necessity for any search in their computation.
Razor: mining distance-constrained embedded subtrees
Authors: Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabeth Chang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Our work is focused on the task of mining frequent subtrees from a database of rooted ordered labeled subtrees. Previously we have developed an efficient algorithm, MB3 [12], for mining frequent embedded subtrees from a database of rooted labeled and ordered subtrees. The efficiency comes from the utilization of a novel Embedding List representation for Tree Model Guided (TMG) candidate generation. As an extension the IMB3 [13] algorithm introduces the Level of Embedding constraint. In this study we extend our past work by developing an algorithm, Razor, for mining embedded subtrees where the distance of nodes relative to the root of the subtree needs to be considered. This notion of distance constrained embedded tree mining will have important applications in web information systems, conceptual model analysis and more sophisticated ontology matching. Domains representing their knowledge in a tree structured form may require this additional distance information as it commonly indicates the amount of specific knowledge stored about a particular concept within the hierarchy. The structure based approaches for schema matching commonly take the distance among the concept nodes within a sub-structure into account when evaluating the concept similarity across different schemas. We present an encoding strategy to efficiently enumerate candidate subtrees taking the distance of nodes relative to the root of the subtree into account. The algorithm is applied to both synthetic and real-world datasets, and the experimental results demonstrate the correctness and effectiveness of the proposed technique.
Towards a Formal Framework for Developing Secure Web Services
Authors: Ali Nasrat Haidar, Ali E. Abdallah
Venue: Proceedings of the 2nd Int'l. Workshop on Automated Specification and Verification of Web Systems (2006)

In this paper, we experiment with use of a formal framework for developing secure Web Services (WSs) from components. The framework focuses on separating security requirements from the functional ones. For each component, the approach makes use of two complementary models: one is state-based, described in Z, and the other is event-based, expressed in Hoare's Communicating Sequential Processes (CSP) Process Algebra. The former is particularly useful to capture persistent data and model "back-end" operations whereas the latter is particularly useful to model behaviour, and in particular, "front-end" interactions and communications. The whole system can then be seen in Z as a combination of the constituent components. In CSP the software architecture of the whole system could be viewed as a parallel composition of appropriate customizations of the behaviour of relevant components. The CSP descriptions can be implemented as Web Services using current technologies such as Java 2 Enterprise Edition (J2EE) and Microsoft's .NET framework. We illustrate this approach with a case study for a conference management system. With this approach, it is possible to specify the core functionalities of a system independently from the security mechanisms. Authentication and authorization are viewed as components which are carefully integrated with the global system.
On-line incremental speaker adaptation with automatic speaker change detection
Authors: Zhi-Peng Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In order to improve the performance of speech recognition systems when speakers change frequently and each of them utters a series of several sentences, a new unsupervised, online and incremental speaker adaptation technique combined with automatic detection of speaker changes is proposed. The speaker change is detected by comparing likelihoods using speaker-independent and speaker-adaptive Gaussian mixture models (GMMs). Both the phone HMM and GMM are adapted by MLLR transformation. In a broadcast news transcription task, this method reduces the word error rate by 10.0%. In comparison with the conventional method that uses HMMs for the speaker change detection, the GMM-based method requires a significantly less number of computations at the cost of only a slightly lower word recognition rate.
Engineering recruitment and retention: a successful bridge
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Arizona State University's (USA) Office of Minority Engineering Programs hosted a very unique Minority Engineering Program Summer Bridge Program to promote greater awareness of and recruit potential candidates to the College of Engineering and Applied Sciences. The program content and curriculum were designed to prepare underrepresented ethnic minority students for educational success. This paper describes the program, the curriculum and the participant evaluations of the program. In addition, the paper discusses the setting for the program in the university and the need for it.
Influence of Release Timer on MAC-hs Performance
Authors: Robert Bestak
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The MAC-hs protocol of HSDPA ensures retransmissions of erroneous blocks and in-sequence data delivery to the upper layer. The first function is fulfilled through the HARQ mechanism. The second function is achieved by handling sliding transmitting/receiving window and by numbering of blocks. In this paper, the MAC-hs performance for different MAC-hs window sizes and channel conditions are studied. Simulations show that the parameter setting has to be advisably set up in order to prevent deterioration of the protocol performance.
The discrete fractional Fourier transform
Authors: C. Candan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We propose and consolidate a definition of the discrete fractional Fourier transform which generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform (FRT) generalizes the continuous ordinary Fourier Transform. This definition is based on a particular set of eigenvectors of the DFT which constitutes the discrete counterpart of the set of Hermite-Gaussian functions. The fact that this definition satisfies all the desirable properties expected of the discrete FRT, supports our confidence that it will be accepted as the definitive definition of this transform.
Windows NT in a ccNUMA system
Authors: B. Brock, G. Carpenter, E. Chiprout, E. Elnozahy, M. Dean, D. Glasco, J. Peterson, R. Rajamony, F. Rawson, R. Rockhold, A. Zimmerman
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

We have built a 16-way, ccNUMA multiprocessor prototype to study the feasibility of building large scale servers out of Standard High Volume (SHV) components. Using a cache-coherent interconnect, our prototype combines four 4-processor SMPs built using 350MHz Intel XeonTM processors, yielding a 16-way system with a total of 4 GBytes of physical memory distributed over the nodes. Such an environment poses several performance challenges to Windows NT®, which assumes that memory is equidistant to all processors. To overcome these problems, we have implemented an abstraction called a Resource Set, which allows threads to specify their execution and memory affinity across the ccNUMA complex. We used a suite of parallel applications to evaluate the scalability and performance of the system. Our results confirm the feasibility of building ccNUMA systems out of SHV components, and suggest that memory allocation affinity should be incorporated as part of the standard Windows NT API. Also, the performance degradation due to poor bus bandwidth in the current generation of Intel-based processors often dominates the degradation due to the latency of remote memory accesses.
Next generation techniques for robust and imperceptible audio data hiding
Authors: J. Chou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We combine recent theoretical and algorithmic advances in the area of information-hiding with the current mature knowledge-base in the human audio perception system to propose a novel audio data-hiding technique that significantly pushes the state-of-the-art in the field. Our work is based on a combination of advances in two disjoint fields: information-hiding and human auditory masking. The field of information-hiding has recently seen a resurgence due to advances in the understanding of fundamental bounds from information theory. By integrating this with the human perceptual system knowledge that has been successfully exploited for several years in the audio compression community, we derive a new and improved audio data-hiding technique that finds application in a number of exciting scenarios like music enhancement and digital communications over analog data channels. Our preliminary results show that we can embed data at a rate an order of magnitude higher than existing audio data hiding systems, while being robust to channel noise.
Energy functions for the segmentation of ultrasound volume data using active rays
Authors: M. Martin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper we address the problem of ultrasound volume data segmentation by means of active contours. The segmentation is performed on an slice-by-slice basis but exploiting the high correlation that exists across nearby slices. We have used active rays to alleviate the computational load of the optimization process. Classical energy functions have trouble finding the optimal solution in speckle imagery. We therefore propose new energy functions that work well under this type of images. Moreover, we propose both a probabilistic relaxation scheme and a heuristic search of the minimal energy configuration to end up making a hybrid use of both. We compare two rendered surfaces to illustrate the smoothness of our reconstruction.
Vital Signs Monitoring Through Internet
Authors: Tonatiuh Rivera-Toral, Ruben Alejos-Palomares, M. C. Yuhsi Takahashi-Iturriaga
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

The system described in this paper is able to monitor three vital signs of a patient: Oxygen Saturation Percentage, heart rate and temperature. It is accomplished using a SpO2 Sensor model DS-100A manufactured by Nellcor. Analyzing the signal obtained by this sensor is possible to measure SpO2 and heart rate. Temperature is measured using a LM-92 sensor manufactured by National Instruments. The user interface has been developed using LabView 8.0, the obtained VI is visible through internet.