ppxscal/embedding_network huggingface dataset:
Wavelet Based Analysis of Doppler Ultrasonic Wrist-pulse Signals
Authors: Dongyu Zhang, Lei Zhang, David Zhang, Yongping Zheng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Traditional Chinese pulse diagnosis (TCPD) is one of the most important diagnostic techniques in Traditional Chinese Medicine (TCM) and computerized analysis of pulse signals is a crucial step in objectifying and standardizing TCPD. In this work, we use Doppler ultrasonic device to collect wrist-pulse signals from patients with gastritis and cholecystitis as well as healthy persons. After extracting the envelopes of ultrasonic pulse contour, wavelet (packet) transforms are applied to decompose the pulse signals and extract the wavelet features. Together with some Doppler ultrasonic diagnostic parameters, such as STI, RI, etc., a two-category classifier is employed to distinguish the unhealthy persons from healthy ones, and tell the patients from different diseases. 12 gastritis sufferers (Group G), 15 cholecystitis sufferers (Group C) and 19 healthy persons (Group H) were involved in the experiment. An accuracy of 80.77% and an accuracy of 86.21% are achieved in discriminating Group G and Group C from Group H, respectively, and the classification accuracy between Group G and Group C can reach 100%.
Fully abstract models of the lazy lambda calculus
Authors: C.-H. L. Ong
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Much of what is known about the model theory and proof theory of the lambda -calculus is sensible in nature, i.e. only head normal forms are semantically meaningful. However, most functional languages are lazy, i.e. programs are evaluated in normal order to weak head normal forms. The author develops a theory of lazy or strongly sensible lambda -calculus that corresponds to practice. A general method for constructing fully abstract models for a class of lazy languages is illustrated. A formal system called lambda beta C ( lambda beta -calculus with convergence testing C) is introduced, and its properties are investigated.
Performance evaluation of dynamic probabilistic flooding under different mobility models in MANETs
Authors: Abdalla M. Hanashi, Aamir Siddique, Irfan Awan, Mike Woodward
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

In mobile ad hoc networks (MANET), broadcasting is widely used in route discovery and many other network services. The efficiency of broadcasting protocol can affect the performance of the entire network. As such, the simple flooding algorithm aggravates a high number of unnecessary packet rebroadcasts, causing contention and packet collisions. Proper use of probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighbouring nodes. A good probabilistic broadcast protocol can achieve high save rebroadcast and low collision. In this paper, we propose a dynamic probabilistic approach when nodes move according to different mobility models and compare it with simple flooding AODV and fixed probabilistic scheme. Our approach dynamically set the rebroadcast probability according to the number of neighbour nodes distributed in the ad hoc network. Simulation results show our approach performs better than both simple flooding and fixed probabilistic flooding.
Error-resilient low-power Viterbi decoders
Authors: Rami A. Abdallah, Naresh R. Shanbhag
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Two low-power Viterbi decoder (VD) architectures are presented in this paper. In the first, limited decision errors are introduced in the add-compare-select units (ACSUs) of a VD to reduce their critical path delays so that they can be operated at lower supply voltages in absence of timing errors. In the second one, we allow data-dependent timing errors which occur whenever a critical path in the ACSU is excited. Algorithmic noise-tolerance (ANT) is then applied at the level of the ACSU to correct for these errors. Power reduction in this design is achieved by either overscaling the supply voltage (voltage overscaling (VOS)) or designing at the nominal process corner and supply voltage (average-case design). Power savings in the first and second design are 58% and 40% at a coding loss of 0:15 dB and 1:1 dB respectively in a IBM 130nm CMOS process.
Fractal communication in software data dependency graphs
Authors: Daniel Greenfield, Simon W. Moore
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Communication is increasingly more costly than computation, but little work has been done on characterising the intrinsic communication behaviour of algorithms. We show that the dynamic data dependency graphs for a wide number of benchmarks exhibit multi-scale fractal communication. This has important implications for the locality of NoC communication in a CMP as well as for temporal locality. Benchmarks that do not exhibit fractal scaling or that have high fractal dimensionality may have poor communication scalability on a CMP.
Performance Analysis of Anonymous Communication Channels Provided by Tor
Authors: Andriy Panchenko, Lexi Pimenidis, Johannes Renner
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Providing anonymity for end-users on the Internet is a very challenging and difficult task. There are currently only a few systems that are of practical relevance for the provision of low-latency anonymity. One of the most important to mention is the Tor network that is based on onion routing. Practical usage of the system often leads to delays which are not tolerated by the average end-user. This, in return, discourages many of them from the use of such systems and hence indirectly lowers the protection of remaining users due to a smaller user base. In this paper we show to which extend overloaded nodes and links, as well as geographical diversity of nodes have an influence on the general performance of Tor communication channels. After that, we propose new methods of path selection for performance-improved onion routing which are based on actively measured latencies and estimated available capacities using passive observations of link-wise throughput.
On total 9-coloring planar graphs of maximum degree seven
Authors: Daniel P. Sanders, Yue Zhao
Venue: Journal of Graph Theory (1999)

Given a graph G, a total k-coloring of G is a simultaneous coloring of the vertices and edges of G with at most k colors. If &Delta;(G) is the maximum degree of G, then no graph has a total &Delta;-coloring, but Vizing conjectured that every graph has a total (&Delta; + 2)-coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing that every planar (and projective) graph with &Delta; &le; 7 has a total 9-coloring by means of the discharging method. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 6773, 1999
A cross-domain visual learning engine for interactive generation of instructional materials
Authors: K. R. Subramanian, T. Cassen
Venue: ACM SIGCSE Bulletin (2008)

We present the design and development of a Visual Learning Engine, a tool that can form the basis for interactive development of visually rich teaching and learning modules across multiple disciplines. The engine has three key features that makes it powerful and cross-disciplinary, (1) it is based on a finite state machine model, that supports concepts presented in any defined sequence, (2) instructional modules are designed and generated interactively using graphical interface widgets, facilitating non-programmers to use the system, and (3) ability to simultaneously present concepts and their visual representation that allows for a more intuitive and exploratory learning experience. We demonstrate a prototype of the learning engine by testing it on examples from Computer Science(sorting)algorithms, recursion) and Electrical Engineering (signal manipulations).
Analysis of dynamic characteristics for different design strategies
Authors: Alexander Zemliak
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

General methodology for the system design was elaborated by means of the optimal control theory approach. The problem of the system design can be formulated in this case as a classical problem of the optimal control for some functional minimization. In this context the aim of the optimal control is to result to zero of all right hand sides of the main system of the differential equations for the final time and to minimize the total computer time. The minimal time system design algorithm was defined as the problem of functional minimization. By this methodology the aim of the system design process with minimal computer time is presented as a transition process of some dynamic system that has the minimal transition time. The Lyapunov function of the design process was proposed to analyze the total design time. The special function that is a combination of Lyapunov function and its time derivative was proposed to predict the optimal control vector structure and to compare the different design strategies that compose the structural design basis.
AJAX Interview Questions, Answers, and Explanations: AJAX Certification
Authors: Terry,  Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Learning Guide for AJAX! Contains Comprehensive Selection of Questions, Answers, and Explanations AJAX is a must have in order for any web developer to stay current and competitive. As with any web development tool, however, it's challenging to find sources that are not only current, but relevant to today's business environment. AJAX Interview Questions, Answers, and Explanations: AJAX Certification Review is the guide you've been looking for. Whether you need to learn AJAX for the first time or merely require brushing up in order to perform well in an interview, we will help you get there. Areas of focus include: . AJAX for creating more interactive user interfaces . XTLHttpRequest objects to exchange data asynchronously with the web server . Troubleshooting in a heterogeneous setting of intranet, internet, or web-based configurations . Permissions and security . Markup and styling applications
Description of a teleconferencing floor control protocol and its implementation
Authors: Mohammed Ouzzif, Mohammed Erradi, Hassan Mountassir
Venue: Engineering Applications of Artificial Intelligence (2008)

In this paper, we present a formal specification of a teleconferencing floor control protocol and its implementation. The services provided by this protocol are described within the SCCP IETF document (Simple Conference Control Protocol). Finite state machines are used to model services behaviours part of this protocol. Temporal properties are defined as constraints of the teleconferencing system using SCCP protocol. The dynamic properties are described by the LTL logic (Linear Temporal Logic) and verified using the model-checker Spin/Promela. A prototype of a multimedia teleconferencing system is implemented and it is based on the specified protocol. This implementation uses UML notation and is developed with JMF (Java Media Framework) API.
Approximation algorithms for partially covering with edges
Authors: Ojas Parekh
Venue: Theoretical Computer Science (2008)

The edge dominating set (EDS) and edge-cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. Given a bound on the total amount of penalties that we are permitted to pay, the objective is to find a minimum cost cover with respect to this bound. We give an 8/3-approximation for generalized partial EDS. This result matches the best-known guarantee for the {0,1}-EDS problem, a specialization in which only a specified set of edges need to be covered. Moreover, 8/3 corresponds to the integrality gap of the natural formulation of the {0,1}-EDS problem. Our techniques can also be used to derive an approximation scheme for the generalized partial edge-cover problem, which is NP-complete even though the uniform penalty version of the partial edge-cover problem is in P.
Data-flow skeleton filled with activities driven workflow design
Authors: Nanshan Du, Yiwen Liang, Li Zhao
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Using the same semantics on the same data is the basis of information sharing. Moreover, it is also the foundation of workflow cooperation and coordination. The data-flow of a workflow process should be focused on in workflow design. Prevalent workflow design methods are from functional perspective or both perspectives of functional and informational. The approach of Data-Flow Skeleton Filled with Activities(DFSFA) is proposed to construct a workflow process by automatically building a data-flow skeleton and then filling it with activities. DFSFA is easily understandable and the data-flow skeleton can be used as the foundation for cooperation and coordination among workflow processes. Data-flow skeleton can also be used as an evaluation criterion to identify a workflow process from others.
Structural Rationale for Differential Carbohydrate Recognition by Barley and Fibrobacter succinogenes 1,3-1,4-β-D-Glucanases
Authors: Li-Chu Tsai
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Glycosyl hydrolase family 16 (GHF16) truncated Fibrobacter succinogenes (TFs) and GHF17 barley 1,3-1,4-E-D-glucanases (E-glucanases) catalyze the specific hydrolysis of E-1,4 glycosidic bonds adjacent to E-1,3 linkages in mixed E-1,3 and E-1,4 E-D-glucans or lichenan. GHF17 banana E-1,3-glucanase displays a conserved structural fold similar to that of barley 1,3-1,4-E-D-glucanase, however, the enzymes cleave different E-1,3 and E-1,4 linked polysaccharides. In order to understand the structural rationale for the recognition of different polysaccharides by GHF 16 and 17 enzymes, we applied comparative modeling and structural analysis to study the protein-carbohydrate interaction and cleavage mechanism of these enzymes. Differences in the active site region residues of TFs E-glucanase and barley E-glucanase create binding site topographies that require different substrate conformations. In contrast to barley E-glucanase, TFsE-glucanase possesses a unique and compact active cleft site.
Case-based intelligent e-learning systems
Authors: Abdel-Badeeh M. Salem
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Case based reasoning (CBR) technology presents a foundation for a new technology of building intelligent systems for teaching, learning and training. This Technology directly addresses the problems found in the traditional artificial intelligence (AI) techniques, e.g. the problems of knowledge acquisition, remembering, robust and maintenance. This paper discusses the CBR methodology, the research issues and technical aspects of implementing effective intelligent e-learning systems. Some examples of successful applications in different domain are also given in the paper.
Turing's Responses to Two Objections
Authors: Darren Abramson
Venue: Minds and Machines (2008)

In this paper I argue that Turing's responses to the mathematical objection are straightforward, despite recent claims to the contrary. I then go on to show that by understanding the importance of learning machines for Turing as related not to the mathematical objection, but to Lady Lovelace's objection, we can better understand Turing's response to Lady Lovelace's objection. Finally, I argue that by understanding Turing's responses to these objections more clearly, we discover a hitherto unrecognized, substantive thesis in his philosophical thinking about the nature of mind.
A bundle-filter method for nonsmooth convex constrained optimization
Authors: Elizabeth Karas, Ademir Ribeiro, Claudia Sagastiz&#x00e1;bal, Mikhail Solodov
Venue: Mathematical Programming: Series A and B (2008)

For solving nonsmooth convex constrained optimization problems, we propose an algorithm which combines the ideas of the proximal bundle methods with the filter strategy for evaluating candidate points. The resulting algorithm inherits some attractive features from both approaches. On the one hand, it allows effective control of the size of quadratic programming subproblems via the compression and aggregation techniques of proximal bundle methods. On the other hand, the filter criterion for accepting a candidate point as the new iterate is sometimes easier to satisfy than the usual descent condition in bundle methods. Some encouraging preliminary computational results are also reported.
Spanning a strong digraph by &#x03b1; circuits: A proof of Gallai&#x2019;s conjecture
Authors: St&#x00e9;phane Bessy, St&#x00e9;phan Thomass&#x00e9;
Venue: Combinatorica (2007)

In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by &#x03b1; directed circuits, where &#x03b1; is the stability of D. We give a proof of this conjecture.
Aspect-oriented in-lined reference monitors
Authors: Kevin W. Hamlen, Micah Jones
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

An Aspect-Oriented, declarative, security policy specification language is presented, for enforcement by In-lined Reference Monitors. The semantics of the language establishes a formal connection between Aspect-Oriented Programming and In-lined Reference Monitoring wherein policy specifications denote Aspect-Oriented security automata---security automata whose edge labels are encoded as pointcut expressions. The prototype language implementation enforces these security policies by automatically rewriting Java bytecode programs so as to detect and prevent policy violations at runtime.
Resource reclamation using meta-events in a real time java system
Authors: Cedric Curcio, Serge Midonnet
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

The objective of this work is to optimize the behavior of a real-time java system, by identifying and then reaffecting resources which have been allocated to tasks but unused. The tasks in question are periodic tasks which produce aperiodic events such as exceptions. In a real-time system, guaranteeing the task response time leads to resource reservation (CPU, Memory) necessary to their execution. Resource reservation is nevertheless essential because the worst case scenario, where all events are produced at their maximum frequency, is the one that must be catered for. In many cases the worst case scenario never materialises and a part of the resources is wasted. The objective of this work is to present a reclamation mechanism for unused resources. This applies to asynchronous events which have not been activated and other events which we are certain will remain inactivated. An asynchronous event is, at the same time, an object (the AsyncEvent) and the associated handler of that object (AsyncEventHandler). A meta-event is an object used to specify the relationship between asynchronous events. It is this relationship which will enable us to predict the resources which will remain unused and can thus be reallocated. In this paper we will discuss three points. What quantity of resources can be saved from each task ? When can they be collected and for how long will they be available?
Multimedia Digital Rights Protection Using Watermarking Techniques
Authors: N. Vyaghreswara Rao, S. N. Narahari Pandit
Venue: Information Systems Security (2007)

With the advancement of Internet technologies and its wide usage, it has become easy to illegally copy, distribute, and manipulate digital products. Digital watermarking is a proven method to protect authenticity by identifying the owner of the digital content. Significant work has been reported in the last five years on legal and technical measures for protecting digital rights. This paper explains the concepts of ownership rights and related intellectual property rights and their technical and legal protection measures. It also introduces digital water marking, its classification, features, and applications.
Speaking with spatial relations
Authors: Lukasz Wawrzyniak, Dennis Nikitenko, Pascal Matsakis
Venue: International Journal of Intelligent Systems Technologies and Applications (2006)

Natural language descriptions are an important step in bridging the gap between numerical representations of spatial data and the human user. In this work, we present a system for generating linguistic descriptions of the spatial relationships between two-dimensional objects. The most pertinent relations for the description are chosen based on a fuzzification of the set relations DISJOINT, OVERLAP, SUBSET, SUBSETi and EQUAL. A handful of relevant Allen relations is then selected and their Allen F-histograms are analysed to extract further topological and directional information. The approach is validated using several sets of real and synthetic data.
Computation of the exact Cramer--Rao lower bound for the parameters of a nonsymmetric half-plane 2-D ARMA model
Authors: Aydin Kizilkaya
Venue: Digital Signal Processing (2008)

The Cramer-Rao lower bound (CRLB) that gives the minimal achievable variance/standard deviation for any unbiased estimator offers a useful tool for an assessment of the consistency of parameter estimation techniques. In this paper, a closed-form expression for the computation of the exact CRLB on unbiased estimates of the parameters of a two-dimensional (2-D) autoregressive moving average (ARMA) model with a nonsymmetric half-plane (NSHP) region of support is developed. The proposed formulation is mainly based on a matrix representation of 2-D real-valued discrete and homogeneous random field characterized by the NSHP ARMA model. Assuming that the random field is Gaussian, the covariance matrix of the NSHP ARMA random field is first expressed in terms of the model parameters. Then, using this matrix structure, a closed-form expression of the exact Fisher information matrix required for the CRLB computation of the NSHP ARMA model parameters is developed. Finally, the main formulas derived for the NSHP ARMA model are rearranged for its autoregressive and moving average counterparts, separately. Numerical simulations are included to demonstrate the behavior of the derived CRLB formulas.
An Approach for Compliance Validation of Trusted Computing Applications
Authors: Qi Cui, Wenchang Shi
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Trusted Computing (TC) is considered to be one of the newly developed technologies on improving computer security and creating a trustworthy environment. Although the Trusted Computing Group (TCG) has defined specifications for TC, including that of Trusted Platform Module (TPM), criteria on compliance testing is still not available. It is important that the design and implementation of TPM and other components follow the specifications, as incompliance may lead to crucial security impacts. In this paper, a test mechanism checking TPM commands is instrumented into TPM application, so that conformance to standards can be examined before TPM's functional execution to validate its compliance with the specifications. Furthermore, this paper also initially puts forward the concept of "chain of compliance", which enhances the trustworthiness of computing platforms by verifying the conformance of their components.