ppxscal/embedding_network huggingface dataset:
Schedulability: Real-Time Tasks Scheduling in a Multiprocessor System
Authors: Ghasem S. Alijani, Farhad Jafari, Chen Wen-Shui
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

This research investigates the capability of a multiprocessor system in guaranteeing the execution of critical tasks and determines the cause of deadline failures. By implementing a real-time application using an INMOS transputer and Occam language, we were able to distribute required tasks among the processors and determine their CPUs usage. We evaluated the performance of the system in terms of the number of guaranteed critical and non-critical tasks, arrival rates, and conflicting deadlines.
Embracing "Web 3.0"
Authors: Ora Lassila, James Hendler
Venue: IEEE Internet Computing (2007)

With more than 10 years' work on the Semantic Web's foundations and more than five years since the phrase became popular, it's an opportune moment to look at the field's current state and future opportunities. The Resource Description Framework (RDF) and Web Ontology Language (OWL)--the languages that power the Semantic Web--have become standards and new technologies are reaching maturity for embedding semantics in existing Web pages and querying RDF knowledge stores. Something exciting is clearly happening in this area.
Assuring Quality and Usability in Open Soruce Software Development
Authors: Henrik Hedberg, Netta Iivari, Mikko Rajanen, Lasse Harjumaa
Venue: Proceedings of the First International Workshop on Emerging Trends in FLOSS Research and Development (2007)

This paper reviews literature on quality and usability assurance in open source software (OSS) development, focusing specifically on OSS that is targeted at a large user population, which does not consist only of OSS developers anymore. In this type of OSS development, the "naïve', non computer professional users should be taken into account and usability of OSS improved. Furthermore, software quality becomes a very relevant issue to be assured. We contrast OSS literature on quality and usability with prescriptive literatures derived from the fields of software engineering and human computer interaction. We present a summary of the current practices utilized to assure quality and usability in OSS development, and recommend practices to be used in this context. We also point out limitations in the existing research and suggest paths for future work.
Exploring Defocus Matting: Nonparametric Acceleration, Super-Resolution, and Off-Center Matting
Authors: Neel Joshi, Wojciech Matusik Shai Avidan, Hanspeter Pfister, William T. Freeman
Venue: IEEE Computer Graphics and Applications (2007)

Defocus matting is a fully automatic and passive method for pulling mattes from video captured with coaxial cameras that have different depths of field and planes of focus. Nonparametric sampling can accelerate the video-matting process from minutes to seconds per frame. In addition, a super-resolution technique efficiently bridges the gap between mattes from high-resolution video cameras and those from low-resolution cameras. Off-center matting pulls mattes for an external high-resolution camera that doesn't share the same center of projection as the low-resolution cameras used to capture the defocus matting data.
An application adaptation layer for wireless sensor networks
Authors: M. Avvenuti, P. Corsini, P. Masci, A. Vecchio
Venue: Pervasive and Mobile Computing (2007)

In wireless sensor networks, poor performance or unexpected behavior may be experienced for several reasons, such as trivial deterioration of sensing hardware, unsatisfactory implementation of application logic, or mutated network conditions. This leads to the necessity of changing the application behavior after the network has been deployed. Such flexibility is still an open issue as it can be achieved either at the expense of significant energy consumption or through software complexity. This paper describes an approach to adapt the behavior of running applications by intercepting the calls made to the operating system services and changing their effects at run-time. Customization is obtained through small fragments of interpreted bytecode, called adaptlets, injected into the network by the base station. Differently from other approaches, where the entire application is interpreted, adaptlets are tied only to specific services, while the bulk of the application is still written in native code. This makes our system able to preserve the compactness and efficiency of native code and to have little impact on the overall application performance. Also, applications must not be rewritten because the operating system interfaces are unaffected. The adaptation layer has been implemented in the context of TinyOS using an instruction set inspired to the Java bytecode. Examples that illustrate the programming of the adaptation layer are presented together with their experimental validation.
A discriminant analysis using composite features for classification problems
Authors: Chunghoon Kim, Chong-Ho Choi
Venue: Pattern Recognition (2007)

In this paper, we propose a new discriminant analysis using composite features for pattern classification. A composite feature consists of a number of primitive features, each of which corresponds to an input variable. The covariance of composite features is obtained from the inner product of composite features and can be considered as a generalized form of the covariance of primitive features. It contains information on statistical dependency among multiple primitive features. A discriminant analysis (C-LDA) using the covariance of composite features is a generalization of the linear discriminant analysis (LDA). Unlike LDA, the number of extracted features can be larger than the number of classes in C-LDA, which is a desirable property especially for binary classification problems. Experimental results on several data sets indicate that C-LDA provides better classification results than other methods based on primitive features.
Speaker identification via support vector classifiers
Authors: M. Schmidt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A novel approach to speaker identification is presented. The technique, based on Vapnik's (1995) work with support vectors, is exciting for several reasons. The support vector method is a discriminative approach, modeling the boundaries directly between speakers voices in some feature space rather than by the difficult intermediate step of estimating speaker densities. Most importantly, support vector discriminant classifiers are unique in that they separate training data while keeping discriminating power low, thereby reducing test errors. As a result it is possible to build useful classifiers with many more parameters than training points. Furthermore, Vapnik's theory suggests which class of discriminating functions should be used given the amount of training data by being able to determine bounds on the expected number of test errors. Support vector classifiers are efficient to compute compared to other discriminant functions. Though experimental results are preliminary, performance improvements over the BBN modified Gaussian Bayes decision system have been obtained on the Switchboard corpus.
Distributed Differential Evolution for the Registration of Remotely Sensed Images
Authors: I. De Falco, D. Maisto, U. Scafuri, E. Tarantino, A. Della Cioppa
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

This paper deals with the design and implementation of a parallel software system based on Differential Evolution for the registration of images, and with its testing on two bidimensional remotely sensed images on mosaicking problem. Registration is carried out by finding the most suitable affine transformation in terms of maximization of the mutual information between the first image and the transformation of the second one, without any need for setting control points. A coarse-grained distributed version is implemented on a cluster of personal computers.
New echo embedding technique for robust and imperceptible audio watermarking
Authors: J. Sorensen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Echo watermarking marks audio signals by adding an echo. The embedded signal is not additive noise but an audio signal having the same statistical and perceptual characteristics. The echo is even perceived as added resonance. Conventional echo watermarking techniques often exhibit inherent trade-offs between imperceptibility and robustness. A new echo embedding technique is proposed. The proposed method enables one to embed high energy echoes while the host audio quality is not deteriorated, so that it is robust to common signal processing modifications and resistant to tampering. This is possible due to echo kernels that are designed based on psychoacoustic analyses. Subjective and objective evaluations confirmed that the proposed method could improve the robustness without perceptible distortion.
Problem areas for the IP security protocols
Authors: Steven M. Bellovin
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

The Internet Engineering Task Force (IETF) is in the proces of adopting standards for IP-layer encryption and authentication (IPSEC). We describe a number of attacks against various versions of these protocols, including confidentiality failures and authentication failures. The implications of these attacks are troubling for the utility of this entire effort.
An extensible remote graphical interface for an ATM network simulator
Authors: Michael D. Santos, P. M. Melliar-Smith, L. E. Moser
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

The University of California, Santa Barbara, is developing a 40 gigabit per second ATM switch as part of its Thunder and Lightning network project. To use the high bandwidth efficiently, new network protocols are being developed and simulated on the Thunder and Lightning network protocol simulator. Due to the extreme memory and computational requirements of the simulator, the display, unlike most Tcl/Tk interfaces, must be implemented as a distinct process capable of running on a remote machine. This paper discusses some of the issues that arise with such a physical separation of application and interface, and describes the implementation of the simulator's display application, with an emphasis on the use of the Tcl language. One module of the GUI for the simulator is discussed in detail, demonstrating the use of XDR (external data representation) with Tcl sockets to provide for cross-platform binary data exchange between the simulator and its display application. We also discuss our experience in building the simulator GUI and propose ways in which XDR might be incorporated into Tcl. We discuss some shortcomings of the canvas widget and describe mechanisms to overcome them.
A Comparative Study of Star Graphs and Rotator Graphs
Authors: Subburajan Ponnuswamy, Vipin Chaudhary
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Star graph is an extensively studied Cayley graph, considered to be an attractive alternative to the popular binary cube. The rotator graphs are a set of directed Cayley graphs introduced recently. In this paper we compare the structural and algorithmic aspects of star graphs with that of rotator graphs. In the process we present some new results for star graphs and rotator graphs. We present a formula for the number of nodes at any distance from the identity permutation in star graphs. The minimum bisection width of star and rotator graphs is obtained. Partitioning and fault tolerant parameters for both star and rotator graphs are analyzed. The node disjoint parallel paths and hence the upper bound on the fault diameter of rotator graphs are presented. We compare the minimal path routing in star and rotator graphs using simulation results.
Energy demodulation of two-component AM-FM signals with application to speaker separation
Authors: B. Santhanam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

In this paper, an efficient low-complexity algorithm is presented for the separation and demodulation of two-component AM-FM signals and applied to the separation of voice-modulated FM signals. The proposed algorithm is based on the generating differential equation of the mixture signal and nonlinear differential energy operators.
Identifying Employee Internet Abuse
Authors: Jeffrey J. Johnson, Kenneth W. Chalmers
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This study attempts to illuminate employee Internet abuse through analysis of a company's firewall log file. The difficulty of determining whether a given instance of web browsing constitutes "abuse" is addressed. Visits to web sites subjectively labeled "inappropriate" were found at varying levels, ranging from incidental to excessive.
Decision problems for pushdown threads
Authors: Jan A. Bergstra, Inge Bethke, Alban Ponse
Venue: Acta Informatica (2007)

Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a single stack is called a pushdown thread. Equivalence of pushdown threads is shown decidable whereas pushdown thread inclusion is undecidable. This is again an example of a borderline crossing where the equivalence problem is decidable, whereas the inclusion problem is not.
Cryptanalysis and enhancement of authentication protocols
Authors: Cetin Kaya Koc
Venue:  (2006)

Authentication protocols play important roles in network security. A variety of authentication protocols ranging from complex public-key cryptosystems to simple password-based authentication schemes have been proposed. However, currently there is no fully secure authentication scheme that can resist all known attacks. When a user authentication is performed over an insecure network, additional problems arise due to the fact that the communication may be intercepted, or even altered, by an attacker. In general, one cannot assume that there is a secure channel between the client and the server. In this dissertation, we present specific cryptanalytic attacks on existing protocols and show their vulnerabilities in order to design more secure protocols. In particular, we propose improved security schemes to overcome certain security defects with registration, login, and password/identifier-change schemes. We also propose new authentications schemes which are more secure against guessing, stolen-verifier, replay, denial-of-service, and impersonation attacks than the existing protocols.
Ultra fine pitch flat panel display packaging using 3&#x00a0;&#x03bc;m conductive particles
Authors: G. J. Wang, Y. C. Lin, G. S. Lin
Venue: Microsystem Technologies (2007)

In this research, dependency of the contact resistance on the hardness of the gold bump and process parameters such as the contact area and the load pressure of the extra fine pitch chip-on-glass (COG) flat panel display (FPD) packaging is investigated. The FJ2530 anisotropic conductive film (ACF) by Sony Inc. containing the currently smallest 3&#x00a0;&#x03bc;m conductive particles is implemented to conduct the experiments. Feasibility of the 3&#x00a0;&#x03bc;m ACF in ultra-fine pitch COG applications is further examined. From the experimental results, we found that no special process is required to obtain a satisfied contact resistance for the ultra fine pitch packaging based on the 3&#x00a0;&#x03bc;m conductive particles. It can be concluded that the combination of the 3&#x00a0;&#x03bc;m conductive particles and the IC gold bumps with hardness 70&#x00a0;Hv can lead to a miniaturized device with less cost. For mass production, test sample with pitch space being larger than 10&#x00a0;&#x03bc;m is suggested to retain a better reliability.
Book Review: Data plus Connectivity
Authors: Arturo Ortiz-Tapia
Venue: IEEE Distributed Systems Online (2007)

A review of "Inescapable Data: Harnessing the Power of Convergence" by Chris Stakutis and John Webster.
Sinusoidal frequency estimation using filter banks
Authors: A. Tkacenko
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

One problem of great interest to the signal processing community is that of estimating the frequencies of sinusoids buried in noise. Traditional methods applied to a fullband signal fail to estimate accurately when the signal-to-noise ratio (SNR) or spacing between frequencies is small. They also fail when the noise is not white and its statistics are unknown. We consider these methods when applied to the subbands of a filter bank and show that, through proper choice of analysis filters, the local SNR and frequency spacing increase by the decimation ratio. We also show that the subband noise processes are, on average, more "white" than the fullband one in terms of the spectral flatness measure. This suggests that if the noise statistics are unknown, there will be less error by estimating in the subbands as opposed to the fullband. Experimental results support this theory, as we show.
Effect of surface finish of substrate on mechanical reliability of In-48Sn solder joints in MOEMS package
Authors: Ja-Myeong Koo, Seung-Boo Jung
Venue: Microsystem Technologies (2007)

The interfacial reactions and shear properties of the In-48Sn (wt.%) ball grid array (BGA) solder joints after bonding were investigated with four different surface finishes of the substrate over an underlying Cu pad: electroplated Ni/Au (hereafter E-NG), electroless Ni/immersion Au (hereafter ENIG), immersion Ag (hereafter I-Ag) and organic solderability preservative (hereafter OSP). During bonding, continuous AuIn2, Ni3(Sn,In)4, and Cu6(Sn,In)5 intermetallic compound (IMC) layers were formed at the solder/E-NG, solder/ENIG and solder/OSP interfaces, respectively. The interfacial reactions between the solder and I-Ag substrate during bonding resulted in the formation of Cu6(Sn,In)5 and Cu(Sn,In)2 IMCs with a minor Ag. The In-48Sn/I-Ag solder joint showed the best shear properties among the four solder joints after bonding, whereas the solder/ENIG solder joint exhibited the weakest mechanical integrity.
Service blending for converged IMS services: a BT Alcatel-Lucent collaboration
Authors: V. S. Abhayawardhana, K. Kocan, J. Matthews
Venue: BT Technology Journal (2007)

BT has embarked on an ambitious and innovative programme to replace its current core network with an all-IP next generation network (NGN) known as 21CN. One of the important properties of an NGN is to allow new and innovative services to be created and deployed quickly, easily and cost effectively. However, managing the sheer number of services, be they generated in-house or by a third party, that will be hosted on such an NGN is not a trivial task. The process of service orchestration (i.e. service blending) is complex and the major standards bodies have, as yet, been unable to define a suitable method. One of the contenders for the role of service orchestration is the Alcatel-Lucent Service Broker¿. BT has been engaged with Alcatel-Lucent during the past year on a proof of concept demonstration to test the Alcatel-Lucent Service Broker's suitability for this role. The findings have shown that this development can support and aid rapid service creation and blending while providing excellent levels of flexibility and programmability.
Coding techniques for reducing code maintenance
Authors: Clifton Flynt
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Tcl/Tk supports code constructs that can reduce the amount of code that needs to be changed when code is modified. The following examples and brief discussion explain some code conventions that can reduce code maintenance. Shell or C programmers are familiar with using a switch statement to parse a command line. In Tcl the command line parsing code can reformat the arguments into Tcl commands. This allows new command line arguments to be added without code modification. One such convention is "-varName value", which can be parsed by a set of code resembling example 1. The names of global variables can be placed in a list to be evaluated by procs which need access to them. This creates a single point of change when new variables need to be declared global. Example 2 shows sample code. Menu construction can be data driven instead of code driven. For example, a program which processes the contents of files can have the file selection menu built with the Tcl glob command. This allows new files to be automatically included in the menu. The traditional method of hardcoding a list of items to place in a menu would require a code modification whenever new files are added (or a new BaseDirectory is selected from the command line). See Example 3. Saving and restoring state arrays can also be data driven instead of code driven. Tcl can report all of the indices of an array. This list can then be used to drive the code which saves these values. By saving the variables as a Tcl command string, the state can be restored with the source command. See Example 4. Further examples and discussion are included in the posters. These conventions were developed while writing, extending and maintaining TclTutor.tk which is available at: http://www.msen.com/~clif. Clif Flynt can be reached as clif@clif.ypsi.mi.us
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Authors: Ishay Haviv, Oded Regev
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We show that unless NP ⊆ RTIME (2poly(log n)), for any ε > 0 there is no polynomial-time algorithm approximating the Shortest Vector Problem (SVP) on n-dimensional lattices inthe lp norm (1 ≤q p<∞) to within a factor of 2(log n)1-ε. This improves the previous best factor of 2(logn)1/2-ε under the same complexity assumption due to Khot. Under the stronger assumption NP ࣰ RSUBEXP, we obtain a hardness factor of nc/log log n for some c > 0. Our proof starts with Khot's SVP instances from that are hard to approximate to within some constant. To boost the hardness factor we simply apply the standard tensor product oflattices. The main novel part is in the analysis, where we show that Khot's lattices behave nicely under tensorization. At the heart of the analysis is a certain matrix inequality which was first used in the context of lattices by de Shalit and Parzanchevski.
Error Control for a Class of Runge-Kutta Discontinuous Galerkin Methods for Nonlinear Conservation Laws
Authors: Andreas Dedner, Charalambos Makridakis, Mario Ohlberger
Venue: SIAM Journal on Numerical Analysis (2007)

We propose an a posteriori error estimate for the Runge-Kutta discontinuous Galerkin method (RK-DG) of arbitrary order in arbitrary space dimensions. For stabilization of the scheme a general framework of projections is introduced. Finally it is demonstrated numerically how the a posteriori error estimate is used to design both an efficient grid adaption and gradient limiting strategy. Numerical experiments show the stability of the scheme and the gain in efficiency in comparison with computations on uniform grids.