ppxscal/embedding_network huggingface dataset:
Diagnostic Quality of Compressed Medical Images: Objective and Subjective Evaluation
Authors: S. E. Ghrare, M. A. M. Ali, M. Ismail, K. Jumari
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Without image compression, images data would become much larger and consequently retrieval of images will be slow, thus telemedicine would in many situations be impractical. But it is natural to raise the question of how much an image can be compressed and still preserve sufficient information for a given clinical application. Evaluation of the diagnostic quality of compressed medical image still remains an important issue. In this paper, three different medical image modalities have been compressed and decompressed using DWT for different compression ratios and evaluated using objective and subjective testing. The quality of the reconstructed images has been measured using objective measures such as MSE, MAE, SNR, and PSNR. Ten observers have been involved to carry out the subjective evaluation. Based on the quality of the reconstructed images, the PSNR obtained has been between 35.3dB to 58.0dB for CT scan images, 38.6dB to 55.0dB for MRI and 34.5dB to 51.0dB for x-ray images. For radiology applications, the compression ratio of 30:1 is acceptable for CT images, and a compression ratio of 40:1 is acceptable for MRI, and compression ratio of 20:1 is acceptable for x-ray images.
A universal planar graph under the minor relation
Authors: Reinhard Diestel, Daniela Kühn
Venue: Journal of Graph Theory (1999)

We construct an infinite planar graph that contains every planar graph as a minor. &copy; 1999 John Wiley & Sons, Inc. J. Graph Theory 32: 191&ndash;206, 1999
Analysis of Priority Queues with Session-Based Arrival Streams
Authors: Joris Walraevens, Sabine Wittevrongel, Herwig Bruneel
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we analyze a discrete-time priority queue with session-based arrivals. We consider a user population, where each user can start and end sessions. Sessions belong to one of two classes and generate a variable number of fixed-length packets which arrive to the queue at the rate of one packet per slot. The lengths of the sessions are generally distributed. Packets of the first class have transmission priority over the packets of the other class. The model is motivated by a web server handling delay-sensitive and delay-insensitive content. By using probability generating functions, some performance measures of the queue such as the moments of the packet delays of both classes are calculated. The impact of the priority scheduling discipline and of the session nature of the arrival process is shown by some numerical examples.
Switching performance of 65V vertical N-channel FLYMOSFETs
Authors: L. Théolier, K. Isoird, H. Tranduc, F. Morancho, J. Roig, Y. Weber, E. N. Stefanov, J. -M. Reynès
Venue: Microelectronics Journal (2008)

In this paper, the switching performance of 65V vertical N-channel FLYMOSFETs is investigated for the first time and compared with a conventional vertical DMOSFET (VDMOSFET). It is shown that measurements of the different capacitances and the gate charge of the two devices are comparable. A 2D simulation study of two equivalent structures (i.e. FLYMOSFET and VDMOSFET exhibiting the same breakdown voltage) confirms that floating islands did not cause parasitic or new phenomenon, in the case of weakly doped islands.
A Reactive Local Positioning System for Ad Hoc Networks
Authors: Sungil Kim, Yoo Chul Chung, Yangwoo Ko, Dongman Lee
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Existing ad hoc location systems measure locations proactively by continuous measurements and communication among all nodes in an ad hoc network. However, in certain location-based applications only a few nodes need the location of a few other nodes, in which case the proactive approach results in an unnecessarily large overhead. We propose a scheme for a reactive ad hoc location system, which avoids the overhead of a proactive scheme by limiting multi-lateration and coordination of coordinate systems to nodes centered around the route between the source node requesting the location and the target node whose location is being requested. Simulations show that our scheme reduces overheads substantially compared to an existing proactive scheme.
Counting descent pairs with prescribed tops and bottoms
Authors: John T. Hall, Jeffrey B. Remmel
Venue: Journal of Combinatorial Theory Series A (2008)

Given sets X and Y of positive integers and a permutation @s=@s"1@s"2...@s"n@?S"n, an (X,Y)-descent of @s is a descent pair @s"i>@s"i"+"1 whose ''top''@s"i is in X and whose ''bottom''@s"i"+"1 is in Y. We give two formulas for the number P"n","s^X^,^Y of @s@?S"n with s(X,Y)-descents. P"n","s^X^,^Y is also shown to be a hit number of a certain Ferrers board. This work generalizes results of Kitaev and Remmel [S. Kitaev, J. Remmel, Classifying descents according to parity, math.CO/0508570; S. Kitaev, J. Remmel, Classifying descents according to equivalence modk, math.CO/0604455] on counting descent pairs whose top (or bottom) is equal to 0modk.
Real-time wetting of Porous media
Authors: Kevin Hnat, Damien Porquet, Stéphane Merillou, Djamchid Ghazanfarpour
Venue: Machine Graphics Vision International Journal (2006)

Studying light reflection properties is a crucial factor in achieving a high degree of realism in image synthesis. Considered as a challenge in itself, it becomes even more complicated when dealing with specific changes in appearance due to external factors. Among these changes, one of the most common is wetting: surfaces appear darker and more specular as their wetting level increase. Such a phenomenon is of great visual importance in outdoor scenes under rain falls, for example. This change in appearance is mainly due to the porous nature of surfaces. In this paper, we propose to handle a porous surface BRDF post-process model in real-time and to extend it to account for wetting, with simple and intuitive parameters.
Comparing architecture description languages for mobile software systems
Authors: Nour Ali, Carlos Solís, Isidro Ramos
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

Software architecture is a technique which aids the development of complex and dynamic systems. Architecture Description Languages (ADLs) describe software architectures using a textual syntax or a graphical notation. However, not many ADLs have provided primitives for describing software architectures of distributed and mobile software systems. This paper presents a comparison among existing ADLs that have addressed distributed and mobile software systems. The features chosen for the comparison have been taken from the work of Roman et al. [15] which propose a framework for viewing mobility. The features taken into account in this work are how ADLs support the notion of location, mobility, coordination, middleware, a graphical notation, and tools. The work presented in this paper proposes to be a starting point for discovering whether ADLs have properly supported mobility or not.
Poisson equations with nonlinear source terms on networks
Authors: Soon-Yeong Chung, Dohan Kim Nam Kee Lee
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

C. Berenstein and the first author introduced an elliptic operator Δω and an ω-harmonic function on graphs, with its physical interpretation as a diffusion equation on graphs, which models electric networks. They also proved the solvability of the problems such as the Dirichlet and Neumann boundary value problems for the Laplace equation and the Poisson equation on networks. In this paper, we consider the Poisson equation with nonlinear source term on networks and show the existence and the uniqueness of a solution with suitable source term.
A possible effect of ionospheric perturbations associated with the Sumatra earthquake, as revealed from subionospheric very-low-frequency (VLF) propagation (NWC-Japan)
Authors: T. Horie, S. Maekawa, T. Yamauchi, M. Hayakawa
Venue: International Journal of Remote Sensing (2007)

The observation of subionospheric very-low-frequency (VLF) propagation between the transmitter NWC (Australia) (frequency 19.8 kHz) and our three receiving sites in Japan (Chofu, Chiba, and Kochi) are used to find a possible precursor of ionospheric perturbations to the Sumatra earthquake in late December 2004. Night-time fluctuations in VLF propagation data at all three sites have exhibited significant enhancements from 4 days before the earthquake, which is likely to be a precursor to the earthquake.
Predictive runtime verification of multi-processor SoCs in SystemC
Authors: Alper Sen, Vinit Ogale, Magdy S. Abadir
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Concurrent interaction of multi-processor systems result in errors which are difficult to find. Traditional simulation-based verification techniques remove the concurrency information by arbitrary schedulings. We present a novel simulation-based technique for SystemC that preserves and exploits concurrency information. Our approach is unique in that we can detect potential errors in an observed execution, even if the error does not actually occur in that execution. We identify synchronization constructs in SystemC and develop predictive techniques for temporal assertion verification and deadlock detection. Our automated potential deadlock detection algorithm works on SystemC programs with semaphores, locks, wait and notify synchronizations and has less overhead compared with assertion verification. We patched SystemC kernel to implement our solution and obtained favorable results on industrial designs.
Brief paper: Solutions of nonlinear control and estimation problems in reproducing kernel Hilbert spaces: Existence and numerical determination
Authors: Gianluigi Pillonetto
Venue: Automatica (Journal of IFAC) (2008)

Many nonlinear optimal control and estimation problems can be formulated as Tikhonov variational problems in an infinite dimensional reproducing kernel Hilbert space. This paper shows that any closed ball contained in such spaces is compact in the sup-norm topology. This result is exploited to obtain conditions which guarantee existence of solutions for the aforementioned problems as well as numerical algorithms whose convergence is guaranteed in the space of continuous functions.
Decision making of negotiation agents using markov chains
Authors: Bo An, Kwang Mong Sim, Chun Yan Miao, Zhi Qi Shen
Venue: Multiagent and Grid Systems (2008)

In dynamic and complex negotiation environments, a negotiation agent can participate or quit negotiation at any time and can potentially reach an agreement with more than one trading partner as the result of the existence of dynamic outside options. Thus, it's important for a negotiation agent to make a decision on when to complete negotiation given its trading partners' current proposals and market dynamics. Rather than explicitly modeling all the trading partners, this paper presents a novel decision making strategy based on a tractable Markov chain model of negotiation process. An agent can use this model to determine whether to accept the best proposal of its trading partners or let negotiation proceed forward during each round of negotiation. Experimental results suggest that the proposed strategy achieved more favorable negotiation outcomes as compared with the general strategy.
An invert-free Arnoldi method for computing interior eigenpairs of large matrices
Authors: Qiang Niu, Linzhang Lu
Venue: International Journal of Computer Mathematics (2007)

This paper presents an invert-free Arnoldi method for extracting a few interior eigenpairs of large sparse matrices. It is derived by implicitly applying the Arnoldi process with the shifted and inverted operator (A-τ I)-1 in a shifted Krylov subspace (A-τ I)Km(A, v1). Due to a subtle relationship between the Krylov subspace Km(A, v1) and its shifted Krylov subspace, we avoid forming the shifted and inverted operator explicitly. Comparisons are drawn between the harmonic Arnoldi method and the invert-free Arnoldi method. Finally, numerical results are reported to show the efficiency of the new method.
Video Summarization Based on Semantic Feature Analysis and User Preference
Authors: Wen-Nung Lie, Kuo-Chiang Hsu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

A personalized video summarization system is proposed in this paper. "Personalized" means that each video can be summarized according to viewer's own preference. To meet user's preference, semantic features of each frame are detected so that their relevance to user preference can be determined. Users can be also capable of setting time or frame number constraint for video summary via a friendly interface. To summarize a video efficiently and effectively, a constrained optimization problem (subject to time constraint and video smoothness) is faced and solved to determine the non-uniform sampling rates for shots relevant to user preferences. Subjective tests show that the quality of the summarized video has a MOS of about 4.0, and the comprehension about the video contents is good.
Experimental implementation and analysis of a DNA computing readout method based on real-time PCR with TaqMan probes
Authors: Zuwairie Ibrahim, John A. Rose, Akira Suyama, Marzuki Khalid
Venue: Natural Computing: an international journal (2008)

A new readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) is experimentally implemented and analyzed. Several types of fluorescent probes and detection mechanisms are currently employed in real-time PCR, including SYBR Green, molecular beacons, and hybridization probes. In this study, real-time amplification performed using the TaqMan probes is adopted, as the TaqMan detection mechanism can be exploited for the design and development of the proposed readout approach. Double-stranded DNA molecules of length 140 base-pairs are selected as the input molecules, which represent the solving path for an HPP instance. These input molecules are prepared via the self-assembly of 20-mer and 30-mer single-stranded DNAs, by parallel overlap assembly. The proposed readout approach consists of two steps: real-time amplification in vitro using TaqMan-based real-time PCR, followed by information processing in silico to assess the results of real-time amplification, which in turn, enables extraction of the Hamiltonian path. The performance of the proposed approach is compared with that of conventional graduated PCR. Experimental results establish the superior performance of the proposed approach, relative to graduated PCR, in terms of implementation time.
Ranking queries on uncertain data: a probabilistic threshold approach
Authors: Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often natural and useful in analyzing uncertain data in those applications. In this paper, we study the problem of answering probabilistic threshold top-k queries on uncertain data, which computes uncertain records taking a probability of at least p to be in the top-k list where p is a user specified probability threshold. We present an efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation based algorithm. An empirical study using real and synthetic data sets verifies the effectiveness of probabilistic threshold top-k queries and the efficiency of our methods.
Meeting the Needs of Sophisticated Applications with Ubiquitous Computing Systems
Authors: Dionisis X. Adamopoulos
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Ubiquitous computing is a new area of computing which aims to serve people in order to perform daily tasks with less effort and much faster that they used to. Ubiquitous computing systems consist of numerous devices, which are embedded and hidden within the environment. This paper reports the current status of ubiquitous computing, by presenting technologies and applications that are used today. In addition, it describes research projects and prototypes that have been developed until today. Also, there are references about ongoing efforts. Finally, the paper presents several evaluation schemes for ubicomp, while there is still no unified framework.
Iclone: towards online social navigation
Authors: Athanasios Papagelis, Manos Papagelis, Christos Zaroliagis
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

For a place that gathers millions of people the Web seems pretty lonely at times. This is mainly due to the current predominant browsing scenario; that of an individual participating in an autonomous surfing session. We believe that people should be seen as an integral part of the browsing and searching activity towards a concept known as social navigation. Based on this observation we present iClone (www.iclone.com), a social web browser that is able to raise awareness of other people surfing similar websites at the same time by utilizing temporal correlations of their web history logs and to facilitate online communication and collaboration.
Guaranteed Synchronization of Huffman Codes
Authors: Marek Tomasz Biskup
Venue: Proceedings of the Data Compression Conference (2008)

In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting such error propagation to no more than L bits, L being a parameter of the algorithm. The method utilizes the inherent tendency of the codes to synchronize spontaneously and does not introduce any redundancy if such a synchronization takes place.
From regular boundary graphs to antipodal distance-regular graphs
Authors: M. A. Fiol, E. Garriga, J. L. A. Yebra
Venue: Journal of Graph Theory (1998)

Let &Gamma; be a regular graph with n vertices, diameter D, and d + 1 different eigenvalues &lambda; > &lambda;1 > &middot;&middot;&middot; > &lambda;d. In a previous paper, the authors showed that if P(&lambda;) > n - 1, then D &le; d - 1, where P is the polynomial of degree d - 1 which takes alternating values &plusmn; 1 at &lambda;1, &hellip;, &lambda;d. The graphs satisfying P(&lambda;) = n - 1, called boundary graphs, have shown to deserve some attention because of their rich structure. This paper is devoted to the study of this case and, as a main result, it is shown that those extremal (D = d) boundary graphs where each vertex have maximum eccentricity are, in fact, 2-antipodal distance-regular graphs. The study is carried out by using a new sequence of orthogonal polynomials, whose special properties are shown to be induced by their intrinsic symmetry. &copy; 1998 John Wiley Sons, Inc. J Graph Theory 27: 123140, 1998
Nowhere-zero 3-flows in products of graphs
Authors: Jinlong Shu, Cun-Quan Zhang
Venue: Journal of Graph Theory (2005)

A graph G is an odd-circuit tree if every block of G is an odd length circuit. It is proved in this paper that the product of every pair of graphs G and H admits a nowhere-zero 3-flow unless G is an odd-circuit tree and H has a bridge. This theorem is a partial result to the Tutte's 3-flow conjecture and generalizes a result by Imrich and Skrekovski [7] that the product of two bipartite graphs admits a nowhere-zero 3-flow. A byproduct of this theorem is that every bridgeless Cayley graph G&thinsp;=&thinsp;Cay(&Gamma;,S) on an abelian group &Gamma; with a minimal generating set S admits a nowhere-zero 3-flow except for odd prisms. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Mitigating media bias: a computational approach
Authors: Souneil Park, Seungwoo Kang, Sangjeong Lee, Sangyoung Chung, Junehwa Song
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

The bias in the news media is an inherent flaw of the news production process, spanning news gathering, writing, and editing stages. Producer's subjective valuation, wittingly or unwittingly, takes place during the daily production process. The resulting bias often causes a sharp increase in political polarization and in the cost of conflict on social issues such as Iraq war [3]. It is very difficult, if not impossible, for readers to have penetrating views on realities against such bias. We propose NewsCube, a novel Internet news service framework aiming at mitigating the effect of media bias. NewsCube is designed to automatically create and promptly provide readers with multiple classified viewpoints on a news event of interest. It helps readers to easily discover rich facts and compare diverse biased views on the event. In this paper, we discuss the design of the NewsCube framework and introduce novel approaches which are under development.
Design and Characterization of Planar Antennas on the Semi-Insulated GaAs for Rectenna Devices
Authors: Farahiyah Mustafa, Nurul Izni Rusli, Abdul Manaf Hashim
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents the design and characterization of the planar type antennas. A dipole type antenna has been designed to be used in the rectifying antenna (rectenna) devices. Normally, a rectenna consists of an antenna and a diode which can rectify microwave power to dc power. We present the novel coplanar waveguide (CPW) facilitated with antenna for future applications such as Intelligent Quantum (IQ) Chips. The return loss characteristic of antenna has been investigated by simulation. From our preliminary results, it is shown that an antenna with length, L=4mm and width, W=20µm showed high return loss characteristics up to -47dB at 15GHz. The obtain characteristics also showed that the dipole antenna can be directly integrated with other devices without any matching circuits for use like in approximate communication system.
CoDesign Space: a collaborative design support system in a network environment
Authors: Ling Tian, Jizhong Chen, Qiaoyu Wang, Wentao Hao, Bingshu Tong
Venue: International Journal of Computer Integrated Manufacturing (2007)

In order to satisfy the various applicational requirements in a network environment, a multi-mode collaborative design method is proposed. Based on XML and VRML technology, the implement method of product data sharing and integration is also discussed. A general type net-based collaborative product design support system called CoDesign Space is designed, and the system architecture and realization method are presented. The CoDesign Space system has a flexible and extendable three-tier B/S architecture. Meanwhile, the system can satisfy the requirements of geographically dispersed collaborative design in many ways by integrating several collaborative design support tools that can be used independently.
Topic structure mining using temporal co-occurrence
Authors: Hiroyuki Toda, Hiroyuki Kitagawa, Ko Fujimura, Ryoji Kataoka
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper proposes a topic structure mining method for document sets that include time stamps. Topic structure mining is a text mining method that uses the graph structure that represents the document pair similarities in the document set. This method yields not only topic extraction from documents and clustering of documents but also extracts the relationship between clusters and the meaning of each document in the cluster. Our method combines temporal co-occurrence with document similarity in constructing the graph structure. We also report evaluation results and the effectiveness of the proposed method.