ppxscal/embedding_network huggingface dataset:
An affine-scaling interior-point CBB method for box-constrained optimization
Authors: William W. Hager, Bernard A. Mair, Hongchao Zhang
Venue: Mathematical Programming: Series A and B (2009)

We develop an affine-scaling algorithm for box-constrained optimization which has the property that each iterate is a scaled cyclic Barzilai&#x2013;Borwein (CBB) gradient iterate that lies in the interior of the feasible set. Global convergence is established for a nonmonotone line search, while there is local R-linear convergence at a nondegenerate local minimizer where the second-order sufficient optimality conditions are satisfied. Numerical experiments show that the convergence speed is insensitive to problem conditioning. The algorithm is particularly well suited for image restoration problems which arise in positron emission tomography where the cost function can be infinite on the boundary of the feasible set.
An Automation Dynamic Testing Method Based AI-Controlling of VCR
Authors: Qiu-Sun Ye, Ting-Fang Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

To realize the dynamic testing method & collecting sampling data in process of fields in industry is a problem solving in all the time. This paper gives a novel automation dynamic testing method based AI-Controlling of VCR, it is with some advantages that as follows: 1)An excellent effectiveness for a given period of time; 2)An integrated controlling area without any spots as yet untouched by changing TC value; 3)A better computation precision of judging & analyzing; 4)A large capacity of numbers without any effective figures limited word size of CPU for its VCO. Otherwise, the dynamic testing method would be still used in drawing some curves such as not straight-line diagram for time area properties, etc.
Developing a Knowledge Sharing Platform: The Case of a Bio-Industry Research Consortium
Authors: Luc Cassivi, Anne-Laure Saives, Elkbir Labzagui, Pierre Hadaya
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Based on the managerial realities, practices and problems of firms in the bio-industry, the objective of this research project is to develop a knowledge sharing platform for a consortium of partners involved in research activities in the sector. The electronic knowledge sharing platform serves not only in the production of analyses and pre-emptive studies to accompany firms and bodies within the bio-industry but also to support members' activities in their respective field of research. The platform was elaborated to carry out four specific knowledge management processes (strategic monitoring and intelligence, academic monitoring and intelligence, creation of an expert knowledge base, and the development of a bio-industry firm directory). The six main applications chosen by the research consortium to support these processes are presented in this paper.
Reduced stability testing set for a diamond-type family of quasipolynomials
Authors: J. A. Torres-Muñoz, V. L. Kharitonov, M. B. Ortiz-Moctezuma
Venue: Multidimensional Systems and Signal Processing (2009)

A diamond-type family of quasipolynomials, for which vertex stability results hold, is presented. Both delay independent and delay-dependent stability conditions are given. In the first case, it suffices to check for the stability of a finite testing set of multivariate polynomials. While in the other one, it is also needed to check the stability of several edge sub-families of quasipolynomials.
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
Authors: Phiniki Stouppa, Thomas Studer
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

Information systems support data privacy by granting access only to certain (public) views. The data privacy problem is to decide whether hidden (private) information may be inferred from the public views and some additional general background knowledge. We study the problem of provable privacy in the context of $\mathcal{ALC}$ knowledge bases. First we show that the $\mathcal{ALC}$ privacy problem wrt. concept retrieval and subsumption queries is ExpTime-complete. Then we provide a sufficient condition for data privacy that can be checked in PTime.
Designing Visual Languages for Description Logics
Authors: Brian R. Gaines
Venue: Journal of Logic, Language and Information (2009)

Semantic networks were developed in cognitive science and artificial intelligence studies as graphical knowledge representation and inference tools emulating human thought processes. Formal analysis of the representation and inference capabilities of the networks modeled them as subsets of standard first-order logic (FOL), restricted in the operations allowed in order to ensure the tractability that seemed to characterize human reasoning capabilities. The graphical network representations were modeled as providing a visual language for the logic. Sub-sets of FOL targeted on knowledge representation came to be called description logics, and research on these logics has focused on issues of tractability of subsets with differing representation capabilities, and on the implementation of practical inference systems achieving the best possible performance. Semantic network research has kept pace with these developments, providing visual languages for knowledge entry, editing, and presenting the results of inference, that translate unambiguously to the underlying description logics. This paper discusses the design issues for such semantic network formalisms, and illustrates them through detailed examples of significant generic knowledge structures analyzed in the literature, including determinables, contrast sets, genus/differentiae, taxonomies, faceted taxonomies, cluster concepts, family resemblances, graded concepts, frames, definitions, rules, rules with exceptions, essence and state assertions, opposites and contraries, relevance, and so on. Such examples provide important test material for any visual language formalism for logic.
Modeling Trust Negotiation for Web Services
Authors: Halvard Skogsrud, Hamid R. Motahari-Nezhad, Boualem Benatallah, Fabio Casati
Venue: Computer (2009)

As Web services become more widely adopted, developers must cope with the complexity of evolving trust negotiation policies spanning numerous autonomous services. The Trust-Serv framework uses a state-machine-based modeling approach that supports life-cycle policy management and automated enforcement.
An intermediate hardware model with load/store unit for C to FPGA
Authors: Akira Yamawaki, Masahiko Iwane
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

We propose the semi-programmable hardware (SPHW) as an intermediate hardware that can be used by the designers and the high-level synthesis tools converting the C programs to FPGAs. The SPHW consists of a load/store unit (LSU), a reconfigurable register file (RRF) and an execution unit (EXU). The LSU, executing the load/store instructions, transfers the data between the memory and the RRF. The hardware designed to make the computation faster is implemented on the EXU. The EXU is a reconfigurable hardware unit and processes the data on the RRF. The LSU flexibly performs complex memory accesses and bufferings by programming, so that the EXU can uniformly process the sequential data on the RRF. Since the EXU runs in parallel to the LSU, the memory access can be overlapped with the data processing. In addition, the SPHW that has a synchronization mechanism supports an execution of the multiple hardware threads on the EXU. By using the SPHW, the C programs can be easily converted to the hardware modules with data prefetching mechanisms. An experiment is performed using some application programs that show different memory access patterns. Compared with the cases that the custom data prefetching circuit is attached instead of the LSU, the SPHW can significantly reduce a design cost, achieving a comparable performance.
A sweep-line algorithm for spatial clustering
Authors: Krista Rizman alik, Borut alik
Venue: Advances in Engineering Software (2009)

This paper presents an agglomerative hierarchical clustering algorithm for spatial data. It discovers clusters of arbitrary shapes which may be nested. The algorithm uses a sweeping approach consisting of three phases: sorting is done during the preprocessing phase, determination of clusters is performed during the sweeping phase, and clusters are adjusted during the post processing phase. The properties of the algorithm are demonstrated by examples. The algorithm is also adapted to the streaming algorithm for clustering large spatial datasets.
Chinese text watermarking based on occlusive components
Authors: Zhang Wenyin, Jin Ningde
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Based on the idea of the mathematical expression of a Chinese character and its automatic generation, a novel watermarking technique for Chinese text is presented in this paper. The proposed method embeds the watermarking signals into some Chinese characters with occlusive components by adjusting the size of the closed rectangular regions in these components, so it is totally based on the content. Experiments show that the proposed text watermarking technique is more robust and transparent than the counterpart methods. It will play an important role in protecting Chinese information security such as authenticity, integrality, confidentiality over the Internet.
Moodle Administration: An administrator's guide to configuring, securing, customizing, and extending Moodle
Authors: ALEX BUCHNER
Venue:  (2008)

This is a one-stop reference for any task you will ever come across when administering a Moodle site of any shape and size. The author, who has been administering systems for over 20 years, has adopted a problem-solution approach to bring the content in line with your day-to-day operations. This book is written for technicians, systems administrators, as well as academic staff--basically anyone who has to administer a Moodle system. Whether you are dealing with a small-scale local Moodle system or a large-scale multi-site Virtual Learning Environment, this book will assist you with any administrative tasks. Some basic Moodle knowledge is helpful, but not essential.
Preserving and ensuring long-term access to digitally born legal information
Authors: Sarah Rhodes, Dana Neacsu
Venue: Information and Communications Technology Law (2009)

Written laws, records and legal materials form the very foundation of a democratic society. Lawmakers, legal scholars and everyday citizens alike need, and are entitled, to access the current and historic materials that comprise, explain, define, critique and contextualize their laws and legal institutions. The preservation of legal information in all formats is imperative. Thus far, the twenty-first century has witnessed unprecedented mass-scale acceptance and adoption of digital culture, which has resulted in an explosion in digital information. However, digitally born materials, especially those that are published directly and independently to the Web, are presently at an extremely high risk of permanent loss. Our legal heritage is no exception to this phenomenon, and efforts must be put forth to ensure that our current body of digital legal information is not lost. The authors explored the role of the United States law library community in the preservation of digital legal information. Through an online survey of state and academic law library directors, it was determined that those represented in the sample recognize that digitally born legal materials are at high risk for loss, yet their own digital preservation projects have primarily focused upon the preservation of digitized print materials, rather than digitally born materials. Digital preservation activities among surveyed libraries have been largely limited by a lack of funding, staffing and expertise; however, these barriers could be overcome by collaboration with other institutions, as well as participation in a large-scale regional or national digital preservation movement, which would allow for resource-sharing among participants. One such collaborative digital preservation program, the Chesapeake Project, is profiled in the article and explored as a collaborative effort that may be expanded upon or replicated by other institutions and libraries tackling the challenges of digital preservation.
Sequential optimal design of neurophysiology experiments
Authors: Jeremy Lewi, Robert Butera, Liam Paninski
Venue: Neural Computation (2009)

Adaptively optimizing experiments has the potential to significantly reduce the number of trials needed to build parametric statistical models of neural systems. However, application of adaptive methods to neurophysiology has been limited by severe computational challenges. Since most neurons are high-dimensional systems, optimizing neurophysiology experiments requires computing high-dimensional integrations and optimizations in real time. Here we present a fast algorithm for choosing the most informative stimulus by maximizing the mutual information between the data and the unknown parameters of a generalized linear model (GLM) that we want to fit to the neuron's activity. We rely on important log concavity and asymptotic normality properties of the posterior to facilitate the required computations. Our algorithm requires only low-rank matrix manipulations and a two-dimensional search to choose the optimal stimulus. The average running time of these operations scales quadratically with the dimensionality of the GLM, making real-time adaptive experimental design feasible even for high-dimensional stimulus and parameter spaces. For example, we require roughly 10 milliseconds on a desktop computer to optimize a 100-dimensional stimulus. Despite using some approximations to make the algorithm efficient, our algorithm asymptotically decreases the uncertainty about the model parameters at a rate equal to the maximum rate predicted by an asymptotic analysis. Simulation results show that picking stimuli by maximizing the mutual information can speed up convergence to the optimal values of the parameters by an order of magnitude compared to using random (nonadaptive) stimuli. Finally, applying our design procedure to real neurophysiology experiments requires addressing the nonstationarities that we would expect to see in neural responses; our algorithm can efficiently handle both fast adaptation due to spike history effects and slow, nonsystematic drifts in a neuron's activity.
On the Quality of Experience of SopCast
Authors: Benny Fallica, Yue Lu, Fernando Kuipers, Rob Kooij, Piet Van Mieghem
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial environments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies and the Quality of Experience (QoE) provided by them is not well known. Therefore, investigating their mechanisms, analyzing their performance, and measuring their quality are important for researchers, operators and end users. In this paper, we present results from a measurement study of a P2PTV application called SopCast, using both objective and subjective measurement technologies. The results obtained in our study reveal important design issues of SopCast and the QoE that the end users perceive.
The md-Matrix: a learning tool in the mobile application development course
Authors: Norshuhada Shiratuddin, Siti Mahfuzah Sarif
Venue: International Journal of Mobile Communications (2009)

An electronic decision matrix-based on the Pugh method, called the md-Matrix, to be used as one of the learning tools in a mobile development course, is introduced. The md-Matrix is designed and developed to assist developers (especially the novice) to choose the methodology that suits the requirements of their mobile development projects based on Software Development Methodology (SDM) properties. Detailed descriptions of how the md-Matrix can be used in facilitating the learning process of mobile development are elaborated in this paper. The results from the users' perceived usefulness evaluation are also discussed in this paper.
Combining preprocessor slicing with C/C++ language slicing
Authors: László Vidács, Árpád Beszédes, Tibor Gyimóthy
Venue: Science of Computer Programming (2009)

Of the very few practical implementations of program slicing algorithms, the majority deal with C/C++ programs. Yet, preprocessor-related issues have been marginally addressed by these slicers, despite the fact that ignoring (or only partially handling) these constructs may lead to serious inaccuracies in the slicing results and hence in the program analysis task being performed. Recently, an accurate slicing method for preprocessor-related constructs has been proposed, which-when combined with existing C/C++ language slicers-can provide more complete slices and hence a more successful analysis of programs written in one of these languages. In this paper, we present our approach which combines the two slicing methods and, via practical experiments, describe its benefits in terms of the completeness of the resulting slices.
Semantic scaffolds in hypermedia learning environments
Authors: Wolfgang Schnotz, Andrea Heií
Venue: Computers in Human Behavior (2009)

In knowledge acquisition from hypermedia, learners have to orient themselves in a non-linear information space, navigate in this space and build a knowledge structure from the information there. Research on learning from hypermedia has focused primarily on enhancing orientation and navigation, with only minor attention on possibilities for supporting semantic processing. In a first experiment, 98 students from senior high school and university undergraduates learned about a complex subject matter either without or with semantic scaffolds, which were presented either in an obligatory (non-removable) or in an optional mode. High prior knowledge learners profited from adequately used semantic scaffolds, whereas low prior knowledge learners did not. In a second experiment, 53 senior high school students and university undergraduates received the learning material with semantic scaffolds presented either in an obligatory mode (but removable on demand) or in an optional mode. Learners with low prior knowledge performed better with optional presentation. Learners with high prior knowledge performed better with obligatory presentation, which allowed removing scaffolds on demand. Learners generally preferred the optional presentation of learning scaffolds.
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Authors: Yury L. Orlovich, Valery S. Gordon, Dominique de Werra
Venue: Theoretical Computer Science (2009)

We consider the complexity of approximation for the Independent Dominating Set problem in 2P3-free graphs, i.e., graphs that do not contain two disjoint copies of the chordless path on three vertices as an induced subgraph. We show that, if P&ne;NP, the problem cannot be approximated for 2P3-free graphs in polynomial time within a factor of n1-&epsilon; for any constant &epsilon;>0, where n is the number of vertices in the graph. Moreover, we show that the result holds even if the 2P3-free graph is restricted to being weakly chordal (and thereby perfect).
Note: On a parallel machine scheduling problem with equal processing times
Authors: Svetlana A. Kravchenko, Frank Werner
Venue: Discrete Applied Mathematics (2009)

In this note, we give a polynomial algorithm for solving problem P|r"j,p"j=p|@?f"j(C"j), where f"j is any non-decreasing function such that for any indices i and j, function f"i-f"j is monotonic.
Content-Based Digital Signature for Motion Pictures Authentication and Content-Fragile Watermarking
Authors: Jana Dittmann, Arnd Steinmetz, Ralf Steinmetz
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The development of new multimedia services and environments requires new concepts both to support the new working process and to protect the multimedia data during the production and distribution. This article addresses image/video authentication and copyright protection as major security demands in digital marketplaces. First we present a content-based signature technique for image and video authenticity and integrity. Based on this technique, we introduce a tool for interactive video authentication and propose content-fragile watermarking, a concept which combines watermarking and content-based digital signatures to ensure copyright protection and detection of integrity violation.
A Load Balancing Algorithm for a Distributed Multimedia Game Server Architecture
Authors: Dugki Min, Donghoon Lee, Byungseok Park, Eunmi Choi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Network game servers, in which a huge number of users can play a common game through interconnecting network, can be designed in a distributed system architecture with the benefit of scalability, reliability, and cost-effectiveness. In order to develop an efficient and scalable network game server system, this paper investigates the issue of load balancing for dynamic change of workload in network game. We propose a dynamic load balancing algorithm for network games which takes into account the geographical relationship among game units and the short response time of frequent user interactions. We also present simulation results of the proposed algorithm.
An active noise cancelling algorithm with secondary path modeling
Authors: Edgar Lopez-Caudana, Pablo Betancourt, Enrique Cruz, Mariko Nakano-Miyatake, Hector Perez-Meana
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper presents a hybrid active noise canceling (HANC) algorithm to overcome the acoustic feedback present in most ANC system, together with an efficient secondary path estimation scheme. The HANC system provides a solution of two fundamental problems present in these kind of ANC systems: The first consists in a reduction of the acoustic feedback from the cancellation loudspeaker to the input microphone, using two FIR adaptive filters, one with a feedforward configuration an the other with a feedback adaptive filter configuration. To overcome the secondary path modeling problem, a modification of the method proposed by Akhtar is used. Computer simulation results are provide to show the noise cancellation and secondary path estimation performance of presented scheme.
Using a Virtual Body to Aid in Exergaming System Development
Authors: Jeff Sinclair, Philip Hingston, Martin Masek, Kazunori (Ken) Nosaka
Venue: IEEE Computer Graphics and Applications (2009)

A framework for simulating physiological responses to exercise lets exergame developers more efficiently test their games during development. An example implementation combines software that simulates heart-rate responses with a custom hardware setup. Simulated heart-rate responses closely match the real physiological responses, demonstrating the approach's validity and potential.