ppxscal/embedding_network huggingface dataset:
A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP
Authors: Ruanhua Shi, Hong Zhong, Liusheng Huang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a_i,1P1 + a_i,2 P_2 + ... + a_i,t Pt in our scheme, we present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme.
MRI Brain Phase Image Unwrapping Process by Wavelet Zero-Padding Technique
Authors: Puu-An Juang, Ming-Ni Wu
Venue: Proceedings of the Third International Conference on International Information Hiding and Multimedia Signal Processing (IIH-MSP 2007) - Volume 02 (2007)

We present a preliminary design and experimental results of a phase discontinuity relaxation method for MRI (magnetic resonance imaging) phase images. Our method utilizes a wavelet transform algorithm with zero-padding technique. The method is capable of solving the ambiguity problem in MRI phase image by removing the discontinuous borders. The key idea of the wavelet transform algorithm is to process the given MRI phase data by operating frequency domain relaxation in coarse grids and then transferring the intermediate result into finer grids. In this paper we investigate the possibility of employing this approach for phase image based-MRI application. We also evaluate and compare these processed images with the original ones. The application of the proposed method for removing discontinuous border is demonstrated by examples.
Clouding Algorithm: A Novel Multi-population Evolution Model and its Applying to Global Numerical Optimization
Authors: Rui He, Guangwei Zhang, Jianwei Niu, Yu Liu, Yanni Han, Deyi Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper proposes a multi-population evolution model, which is distinguished from other models by declaring that the fittest individuals should produce a population with many offspring rather than only one child. Therefore, special attention is spent upon evolution of populations in a community rather than individuals in a population. To model this idea, an uncertainty model, namely cloud model, is employed. By means of model a population with a cloud, inheritance and mutation of population is well unified in a natural way. Further more, we propose a novel evolutionary algorithm, namely clouding algorithm, which describes the framework of algorithms using multi-population evolution to solve global numerical optimization problems. It has no crossover operator, but significantly focuses on mutation control. Besides, a concrete clouding algorithm or the basic clouding algorithm is presented in detail. Experiments are also conducted and results demonstrate good performance of BCA when compared with other algorithms.
CODO: firewall traversal by cooperative on-demand opening
Authors: Sechang Son, B. Allcock, M. Livny
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Firewalls and network address translators (NATs) cause significant connectivity problems along with benefits such as network protection and easy address planning. Connectivity problems make nodes separated by a firewall/NAT unable to communicate with each other. Due to the bidirectional and multi-organizational nature of grids, they are particularly susceptible to connectivity problems. These problems make collaboration difficult or impossible and cause resources to be wasted. This paper presents a system, called CODO, which provides applications end-to-end connectivity over firewalls/NATs in a secure way. CODO allows applications authorized through strong security mechanisms to traverse firewalls/NATs, while blocking unauthorized applications. This paper also formalizes the firewall/NAT traversal problem and clarifies how a traversal system fits in the overall security policy enforcement by a firewall/NAT.
Evaluation of rule interestingness measures in medical knowledge discovery in databases
Authors: Miho Ohsaki, Hidenao Abe, Shusaku Tsumoto, Hideto Yokoi, Takahira Yamaguchi
Venue: Artificial Intelligence in Medicine (2007)

Objective: We discuss the usefulness of rule interestingness measures for medical KDD through experiments using clinical datasets, and, based on the outcomes of these experiments, also consider how to utilize these measures in postprocessing. Methods and materials: We first conducted an experiment to compare the evaluation results derived from a total of 40 various interestingness measures with those supplied by a medical expert for rules discovered in a clinical dataset on meningitis. We calculated and compared the performance of each interestingness measure to estimate a medical expert's interest using f-measure and correlation coefficient. We then conducted a similar experiment for hepatitis. Results and conclusion: The comprehensive results of experiments on meningitis and hepatitis indicate that the interestingness measures, accuracy, chi-square measure for one quadrant, relative risk, uncovered negative, and peculiarity, have a stable, reasonable performance in estimating real human interest in the medical domain. The results also indicate that the performance of interestingness measures is influenced by the certainty of a hypothesis made by the medical expert, and that the combinational use of interestingness measures will contribute to support medical experts to generate and confirm their hypotheses through human-system interaction.
Moving beyond tacit and explicit distinctions: a realist theory of organizational knowledge
Authors: Ashok Jashapara
Venue: Journal of Information Science (2007)

This paper challenges the popular notions of tacit and explicit organizational knowledge and argues that its philosophical underpinnings derived from Gilbert Ryle are problematic due to their logical behaviourist perspective. The paper articulates the philosophical problem as the neglect of any role for the mind in organizational activity and the representation of mental activity as purely a set of behaviours. An alternative realist philosophy is advanced taking into account the potential of adopting a number of competing philosophical perspectives. The paper forwards a realist theory of organizational knowledge that moves beyond the surface behaviours of tacit and explicit knowledge and argues that collective consciousness and organizational memory play primary and deeper roles as knowledge processes and structures. Consciousness is not a Hegelian world spirit but rather a real process embedded in people's brains and mental activity. Further, the paper argues that organizational routines provide the contingent condition or `spark' to activate organizational knowledge processes. The implications of this model are explored in relation to the measurement of intellectual capital. The theory developed in this paper represents the first attempt to provide a coherent philosophically grounded framework of organizational knowledge that moves organizational theory beyond neat conversion processes of tacit and explicit knowledge.
Incorporating unawareness into contract theory
Authors: Emel Filiz
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Asymmetric awareness of the contracting parties regarding the uncertainty surrounding them is proposed as a reason for incompleteness in contractual forms. An insurance problem is studied between a risk neutral insurer, who has superior awareness regarding the nature of the uncertainty, and a risk averse insuree, who cannot foresee all the relevant contingencies. The insurer can mention in a contract some contingencies that the insuree was originally unaware of. It is shown that there are equilibria where the insurer strategically offers incomplete contracts. Next, equilibrium contracts are fully characterized for the case where the insuree is ambiguity averse and holds multiple beliefs when her awareness is extended. Competition among insurers who are symmetrically aware of the uncertainty promotes awareness of the insuree.
A Parallel Programming Environment
Authors: J. R. Allen
Venue: IEEE Software (1985)

Automated techniques will not entirely free the programmer from thinking about parallelism but will uncover natural parallelism in loops and generate appropriate synchronization primitives to exploit that parallelism
Thai small and medium enterprises engagement in the emerging digital content and game industry
Authors: Vasin Chooprayoon, Chun Che Fung
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

The digital content and game industry in Thailand is growing and maturing rapidly. The Thai government is playing an important role contributing to the development of the industry in both business and social sectors. With respect to the business sector, the contributions are offered in the forms of direct investment, business privileges related to business performance and relevant laws and regulations have been established. SMEs are supported and encouraged to enter into the industry. They are also assisted to make their presence known on the world market of game and animation. In addition, the Thai government is concerned with the social aspects. They have embraced projects to assess issues which impact the communities. The objective of this paper is to present an overview of the digital content and game industry in the context of Thailand. The paper covers the evolution of the industry, government support, education institutes involvement, SMEs' engagements and trends of the industry.
Large-Scale Graph Database Indexing Based on T-mixture Model and ICA
Authors: Bin Luo, Aihua Zheng, Jin Tang, Haifeng Zhao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposes an indexing scheme based on t-mixture model and ICA, which is more robust than Gaussian mixture modeling when atypical points (or outliers) exist or the set of data has heavy tail. This indexing scheme combines optimized vector quantizer and probabilistic approximate-based indexing scheme. Experimental results on large-scale graph database show a notable efficiency improvement with optimistic precision.
Performance Evaluation of Instruction Set Extensions for Long Integer Modular Arithmetic on a SPARC V8 Processor
Authors: Johann Grobschadl, Stefan Tillich, Alexander Szekely
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Many important algorithms for public-key cryptography rely on computation-intensive arithmetic operations like modular exponentiation on very long integers, typically in the range of 512 and 2048 bits. Modular exponentiation is generally realized through a sequence of modular multiplications and spends the majority of execution time in simple inner loops. Speeding up these performance-critical inner loop operations with custom instructions has, therefore, a significant impact on the total execution time of public-key cryptosystems. In this paper we analyze the performance of instruction set extensions for long integer arithmetic on a SPARC V8 processor. We discuss various implementation options and optimization opportunities for both modular multiplication and exponentiation. In particular, we introduce a partial loop unrolling (PLU) technique for modular multiplication which allows to achieve large performance gains at the cost of a moderate increase in code size, while maintaining the full flexibility of a "rolled-loop" implementation. In addition, we study window methods for modular exponentiation and analyze their impact on performance and memory requirements. Our experimental results, obtained with an FPGA prototype of the LEON-2 SPARC V8 core, show that a full 1024-bit modular exponentiation can be performed in about 12.5 · 106 clock cycles, which is a reasonable value for embedded devices like smart cards or sensor nodes.
A Brinkman penalization method for compressible flows in complex geometries
Authors: Qianlong Liu, Oleg V. Vasilyev
Venue: Journal of Computational Physics (2007)

To simulate flows around solid obstacles of complex geometries, various immersed boundary methods had been developed. Their main advantage is the efficient implementation for stationary or moving solid boundaries of arbitrary complexity on fixed non-body conformal Cartesian grids. The Brinkman penalization method was proposed for incompressible viscous flows by penalizing the momentum equations. Its main idea is to model solid obstacles as porous media with porosity, @f, and viscous permeability approaching zero. It has the pronounced advantages of mathematical proof of error bound, strong convergence, and ease of numerical implementation with the volume penalization technique. In this paper, it is extended to compressible flows. The straightforward extension of penalizing momentum and energy equations using Brinkman penalization with respective normalized viscous, @h, and thermal, @h"T, permeabilities produces unsatisfactory results, mostly due to nonphysical wave transmissions into obstacles, resulting in considerable energy and mass losses in reflected waves. The objective of this paper is to extend the Brinkman penalization technique to compressible flows based on a physically sound mathematical model for compressible flows through porous media. In addition to penalizing momentum and energy equations, the continuity equation for porous media is considered inside obstacles. In this model, the penalized porous region acts as a high impedance medium, resulting in negligible wave transmissions. The asymptotic analysis reveals that the proposed Brinkman penalization technique results in the amplitude and phase errors of order O((@h@f)^1^/^2) and O((@h/@h"T)^1^/^4@f^3^/^4), when the boundary layer within the porous media is respectively resolved or unresolved. The proposed method is tested using 1- and 2-D benchmark problems. The results of direct numerical simulation are in excellent agreement with the analytical solutions. The numerical simulations verify the accuracy and convergence rates.
Architecture Exploration of 3D Video Recorder Using Virtual Platform Models
Authors: Matti Etelapera, Janne Vatjus Anttila, Juha Pekka Soinimen
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Virtual platform modeling is a new method for developing complex softwareintensive systems such as SystemonChips, NetworksonChips and embedded devices. Hardware prototyping is notneeded in the early design phase, as similar functionality can be achieved quicker and more flexibly with virtual platform models. In this paper the virtual platform model is used for hardware architecture exploration. We evaluated the design method of a 3D video recorder and measured the time and effort needed to build and run complete system simulations using real software. The results suggest that virtual platform modeling is a viable option for architecture exploration, but only if its limitations due to abstracted models are understood. The design process of a virtual platform without prior experience of the tools was measured to be 16 weeks for two designers. Afterwards, changes to the hardware platform could be made in less than 2 weeks depending on how challenging they are.
Indexing XML data stored in a relational database
Authors: Shankar Pal, Istvan Cseri, Oliver Seeliger, Gideon Schaller, Leo Giakoumakis, Vasili Zolotov
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

As XML usage grows for both data-centric and document-centric applications, introducing native support for XML data in relational databases brings significant benefits. It provides a more mature platform for the XML data model and serves as the basis for interoperability between relational and XML data. Whereas query processing on XML data shredded into one or more relational tables is well understood, it provides limited support for the XML data model. XML data can be persisted as a byte sequence (BLOB) in columns of tables to support the XML model more faithfully. This introduces new challenges for query processing such as the ability to index the XML blob for good query performance. This paper reports novel techniques for indexing XML data in the upcoming version of Microsoft® SQL ServerTM, and how it ties into the relational framework for query processing.
Analyzing Distance Measures for Symbolic Data Based on Fuzzy Clustering
Authors: Alzennyr da Silva, Yves Lechevallier, Francisco de Carvalho
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Various propositions to solve the problem of symbolic data clustering are available in the literature. This paper introduces a comparative study among some well known dissimilarity functions treating symbolic data. An extension of the fuzzy c-means clustering algorithm is used to create groups of individuals characterized by symbolic variables of mixed types. The proposed method furnishes a fuzzy par- tition and a prototype for each cluster by optimizing a cri- terion dependent on the dissimilarity function. Experiments involving benchmark data sets are carried out in order to compare the accuracy of each function.
The scheme of things: portability
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1988)

A reader has asked for suggestions on how to write Common Lisp programs so that they can in the future be translated into Scheme without too much difficulty. Someone else wants to write programs in Scheme that might eventually be translated into Common Lisp. These are interesting questions, but a related question is more immediate: How do you write programs in Scheme that can easily be translated to run in other implementations of Scheme?
Safe Delay Optimization for Physical Synthesis
Authors: Kai-hui Chang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Physical synthesis is a relatively young field in electronic design automation. Many published optimizations for physical synthesis end up hurting the final result, often by neglecting important physical aspects of the layout, such as long wires or routing congestion. In this work we propose SafeResynth, a safe resynthesis technique, which provides immediately-measurable delay improvement without altering the design's functionality. It can enhance circuit timing without detrimental effects on route length and congestion. When applied to IWLS'05 benchmarks, SafeResynth improves circuit delay by 11% on average after routing, while increasing route length and via count by less than 0.2%. Our resynthesis can also be used in an unsafe mode, akin to more traditional physical synthesis algorithms popular in commercial tools. Applied together, our safe and unsafe transformations achieve 24% average delay improvement for seven large benchmarks from the OpenCores suite. The relative contribution of safe and unsafe techniques varies depending on the amount of whitespace in the layout.
Hybrid Recursive Super-resolution Image Reconstruction using Neural Networks
Authors: Di Zhang, Xuelan Miao, Jiazhong He
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Most published super-resolution image reconstruction techniques usually perform well on small magnifications, however, as magnification increases, they suffer two severe problems: the exponentially increased computational complexity and the degradation of reconstruction quality caused by severe ringing artifacts. In this paper, a hybrid recursive reconstruction algorithm using neural networks is proposed to tackle these two problems.
Development of remote-controlled laboratories for distance education
Authors: David Lieberman, Tak Cheung
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

At Queensborough Community College, with the support of the National Science Foundation (Advanced Technological Education grant awards #DUE - 9752061 and DUE - 0402332), we have addressed the issues of distance learning in laboratory courses. We have adapted courses for our Laser and Fiber-Optics Engineering Technology Program for distance learning. The "problem" of the laboratory is solved by remote-controlled laboratory equipment. We have completed the work on course materials in physical optics, lasers and fiber optics and near completion on materials for our geometric optics course. Course materials include interactive multimedia textbooks and laboratory manuals along with the remote-controlled laboratory exercises. The remote-controlled exercises are "real" experiments with "real' data as opposed to simulations. The real nature of the exercises allows for the unexpected, which occurs in any laboratory situation. Remote-controlled laboratory exercises include many topics in optics, lasers and fibers optics. As course materials were developed they were tested at a remote site, Suffolk County Community College.
OASIS: an online and accurate technique for local-alignment searches on biological sequences
Authors: Colin Meek, Jignesh M. Patel, Shruti Kasetty
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

A common query against large protein and gene sequence data sets is to locate targets that are similar to an input query sequence. The current set of popular search tools, such as BLAST, employ heuristics to improve the speed of such searches. However, such heuristics can sometimes miss targets, which in many cases is undesirable. The alternative to BLAST is to use an accurate algorithm, such as the Smith-Waterman (S-W) algorithm. However, these accurate algorithms are computationally very expensive, which limits their use in practice. This paper takes on the challenge of designing an accurate and efficient algorithm for evaluating local-alignment searches. To meet this goal, we propose a novel search algorithm, called OASIS. This algorithm employs a dynamic programming A*-search driven by a suffix-tree index that is built on the input data set. We experimentally evaluate OASIS and demonstrate that for an important class of searches, in which the query sequence lengths are small, OASIS is more than an order of magnitude faster than S-W. In addition, the speed of OASIS is comparable to BLAST. Furthermore, OASIS returns results in decreasing order of the matching score, making it possible to use OASIS in an online setting. Consequently, we believe that it may now be practically feasible to query large biological sequence data sets using an accurate local-alignment search algorithm.