ppxscal/embedding_network huggingface dataset:
New Image Fusion-Based Algorithm to Face Recognition
Authors: Zhao Tongzhou, Li Jin, Ai Zelin, Chen Nian, Ming Hui
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

A new face recognition algorithm based on image fusion is presented in this paper. Each original image sample is divided into a certain number of subimages and all training subimages from the same position construct a series of new training sub-pattern sets where Principal Component Analysis (PCA) method is used to extract local projection sub-feature vectors separately, then a set of projection sub-spaces can be obtained. For improving the robustness of face recognition against illumination, the face feature was extracted using the Gabor wavelet. To an unknown face image, after the same partition, projected subfeature vectors of corresponding sub-space are gained. After classification of local projected subfeatures, strategy of synthetic is adopted to fuse each of them. At last the result of classification is determined by maximum membership principle. Simulation experiments indicate that the proposed scheme does can suitably fuse local sub-feature of face images, improve recognition rate effectively and robust.
Contention free inter-cellular slot reservation
Authors: Gunther Auer, Stefan Videv, Birendra Ghimire, Harald Haas
Venue: IEEE Communications Letters (2009)

A distributed reservation protocol tailored for cellular wireless networks is presented that facilitates contention free inter-cellular slot allocation and reservation. While reserved slots are protected from inter-cell interference by a busy burst enabled reservation protocol, collisions due to simultaneously accessed unreserved slots by neighboring cells are mitigated by means of resource partitioning patterns. Shifting these partitioning patterns over time allows each cell to successively probe all slots. This ensures that full frequency reuse is maintained, in the way that all cells may utilize the entire frequency band. In effect a contention free inter-cellular slot allocation policy is established that in a distributed manner dynamically controls the spatial reuse, in terms of concurrently accessed radio resources by neighboring cells.
A low power listening MAC with scheduled wake up after transmissions for WSNs
Authors: Cristina Cano, Boris Bellalta, Anna Sfairopoulou, Jaume Barceló
Venue: IEEE Communications Letters (2009)

This work presents a new MAC protocol for WSNs that combines an unscheduled channel access, based on low-power listening, with an opportunistic scheduled wake up after transmissions mechanism. The proposed MAC provides a good tradeoff between energy consumption, complexity and performance in terms of throughput and delay. It achieves the benefits of scheduled MAC protocols without the cost of maintaining and sharing the schedule, as well as the low consumption and simple operation of unscheduled MAC protocols.
An efficient greedy scheduler for zero-forcing dirty-paper coding
Authors: Jisheng Dai, Chunqi Chang, Zhongfu Ye, Yeung Sam Hung
Venue: IEEE Transactions on Communications (2009)

In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible.
Optimal determination of warranty region for 2D policy: A customers' perspective
Authors: D. K. Manna, Surajit Pal, Sagnik Sinha
Venue: Computers and Industrial Engineering (2006)

Warranty is treated by the manufacturer as a marketing strategy that creates better customer satisfaction, which finally helps to get hold of a bigger market share. The cost incurred towards this service is termed as warranty cost, which is a function of warranty policy and region, product quality and reliability, and the customers' usage pattern. Under the 2D warranty policy, there exists numerous iso-cost regions for any specified value of warranty cost. In this article, we propose a methodology to determine the optimal region when customers' utility is measured by the length of warranty coverage time. It is believed that the results will help the manufacturer to provide improved customer service.
Breaklines in Coons surfaces over triangles for the use in terrain modelling
Authors: Marco Hugentobler, Bernhard Schneider
Venue: Computers Geosciences (2005)

The discipline of computer aided geometric design provides a number of surface interpolation techniques suitable for digitally specifying topographic surfaces, including Bezier and B-splines as well as Coons patches. The latter technique, rarely used in digital terrain modelling so far, is based on an intuitive concept. In a first step, a net of boundary curves is specified. In a second step, Coons patches are specified from these curves so that the resulting surface is globally zero- or first-order continuous. This paper introduces a modification to the triangular Coons patch method allowing the consideration and modelling of breaklines. The method leaves the boundary curves representing breaklines unchanged but alters the curves leading to breakline vertices. In order to abandon first-order continuity, it introduces left- and right-side surface normals at the breakline vertices and uses a special configuration of the cross-boundary derivatives. The results are visually and quantitatively assessed.
Modelling 3D spatial objects in a geo-DBMS using a 3D primitive
Authors: Clin Arens, Jantien Stoter, Peter van Oosterom
Venue: Computers Geosciences (2005)

There is a growing interest in modelling the world in three dimensions, both in applications and in science. At the same time, geographical information systems are changing into integrated architecture in which administrative and spatial data are maintained in one environment. It is for this reason that mainstream Data Base Management Systems (DBMSs) have implemented spatial data types according to the 'Simple Feature Specifications for SQL', described by the OpenGeospatial Consortium. However, these specifications are 2D, as indeed are the implementations in DBMSs. At the Section GIS Technology of TU Delft, research has been carried out in which a 3D primitive was implemented in a DBMS (Oracle Spatial). To explore the possibilities and complications, a fairly simple 3D primitive was chosen to start with: a polyhedron. In the future the study will be extended with more complex primitives, the ultimate aim being to build 3D models with features closer to the real world. Besides the data structure, a validation function was developed to check the geometric accuracy of the data. Rules for validation were established and translated into prototype implementations with the aid of literature. In order to manipulate the data, a list of useful 3D functions was specified. Most of these were translated into algorithms, which were implemented in the DBMS. The algorithms for these functions were obtained from the relevant literature. The research also comprised a comparative performance test on spatial indexing in 2D and 3D, using an R-tree. Finally, existing software was used to visualize 3D objects structured with the implemented 3D primitive. This research is a first attempt to implement a true 3D primitive in a DBMS. Future research will focus on extending and improving the implementations and on optimizing maintenance and query of 3D objects in DBMSs.
A Portable TPM Scheme for General-Purpose Trusted Computing Based on EFI
Authors: Lei Han, Jiqiang Liu, Dawei Zhang, Zhen Han, Xueye Wei
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Trusted computing is a promising technology for enhancing the security of platform by the TPM. The TPM is a tamper-resistant microcontroller designed to provide robust security capabilities for the trusted platform. It typically is affixed to the motherboard with LPC bus. However, It is so limitary that TPM can't be directly used in currently common PC, TPM isn't flexible and portable to be used in different platforms because of its interface with PC and its structure of certifications and keys. For these reasons, we propose a portable trusted platform module (PTPM) scheme to build a trusted platform for common PC based on a single crypto chip with the interface of USB and extensible firmware interface (EFI), by which users can get almost the same degree of security protection in general-purpose system. We also show that the structure of certifications and keys can bind to platforms with PTPM and provide portability and flexibility in different platforms to users while still allowing the user and platform to be protected and attested.
Computer Aided Decoration of Ceramic Tableware. Part I: 3-D decoration
Authors: Chee Kai Chua, Robert Gay, Wolfgang Hoheisel
Venue: Computers and Graphics (1997)

Computer usage in the ceramic tableware industry has largely been confined to word processing, spreadsheets, database, payroll, inventory and statistical process control. Computer Aided Design and Computer Aided Manufacturing (CAD/CAM)is slowly gaining ground in this industry. The relatively high speed of generating physical designs from conceptualisation using CAD/CAM and Rapid Prototyping have suggested their use for the decoration of ceramic tableware. A CAD/CAM system, or more specifically, Computer Aided Decoration Of Ceramic Tableware (CADOCT), is developed for the design and manufacture of patterns to be decorated on ceramic tableware. Numerous industrial case studies featuring ceramic tableware prototypes are carried out and presented to illustrate the various advantages of using the prototype CADOCT system. These advantages include significant time and cost savings. It asso avoids the heavy reliance on traditional practices, and the experience and skills of craftsmen. The major contribution of the research is an innovative approach from art to part or, from conceptualisation to realization, for the decoration of ceramic tableware. Part I, a study of the problems and the proposed prototype system are described, as well as the solutions of 3-D decoration. In Part II, the application of rapid tooling is described.
A Novel DGW Scheme Based on 2D_PPCT and Permutation
Authors: Jianqi Zhu, Kexin Yin, Yanheng Liu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

This paper presents a novel two-dimensional DGW structure (2D_PPCT). Then a new encoding scheme is proposed, which combines permutation encoding and 2D_PPCT. Experiment shows that the new scheme not only makes full use of the structural advantages of PPCT but has high coding efficiency of permutation encoding.
Development and evaluation of multimedia whiteboard system for improving mathematical problem solving
Authors: Wu-Yuin Hwang, Nian-Shing Chen, Rueng-Lueng Hsu
Venue: Computers Education (2006)

This study developed a web-based multimedia whiteboard system to help students learning with mathematical problem solving. The purpose is to promote a new online mathematical learning model that students not only use electronic whiteboard to write down their mathematical problem solving solutions but also use voice recording tool to give oral explanations about their thinking behind the solutions. To cultivate students' critical thinking capability and encourage collaborative peer learning, the new learning model also requests students to criticize others' solutions and reply to others' arguments. With the multimedia supporting tools, students can communicate easily with each other about what they think and how they solve mathematical problems. We have conducted an experiment with sixth grade primary school students for evaluation. After the experiment, a questionnaire about students' attitude toward the multimedia whiteboard system for math learning was then held. The results show that students were satisfied with the use of the multimedia whiteboard system for helping them with learning fractional division. Most students were interested in studying mathematics with the multimedia whiteboard system and thought this tool is particularly useful for doing collaborative learning. After analyzing the recorded solving processes and discussions content of students, we found that the performance of female students was superior to male students in communications and mathematical problem solving. Additionally, students with higher final exam grades had better mathematical abilities for doing critiques, arguments and communications.
Development evaluation systems for educational institutions using reusable information objects
Authors: Valeri Pougatchev
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This article describes our approach of building Reusable Information Objects, based on presently used data in different Information Systems in the University of Technology, Jamaica. Based on Object-Oriented ideas, we are able to create and maintain these objects as an Information Basis for any other Systems that can be developed. Instantiations of these objects allow generating new Information Systems that don't modify this Basis, which is critical for other systems. Flexibility and customization of new Information Systems which use the basic data are the main benefits of that approach.
Global Static Separation of Duty in Multi-domains
Authors: Xiaopu Ma, Ruixuan Li, Zhengding Lu, Jianfeng Lu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Separation of duty (SoD) is an important control principle in computer security. In the context of role-based access control, the Static SoD (SSoD) policies can be enforced by Statically Mutually Exclusive Roles (SMER) constraints. This paper studies the problem of SSoD in multi-domains in the context of IRBAC model firstly. Then investigates a question related to multi-domains: the Global SSoD (GSSoD) policy in order to satisfy the global requirements. It shows that directly enforce the problem is coNP-complete. Finally, enforcing GSSoD policies by the Global Statically Mutually Exclusive Roles (GSMER) constraints in IRBAC model is given.
Consistency-aware evaluation of OLAP queries in replicated data warehouses
Authors: Javier García-García, Carlos Ordonez
Venue: Proceeding of the ACM twelfth international workshop on Data warehousing and OLAP (2009)

OLAP tools for distributed data warehouses generally assume underlying replicated tables are up to date. Unfortunately, maintaining updated replicas is difficult due to the inherent tradeoff between consistency and availability. In this paper, we propose techniques to evaluate OLAP queries in distributed data warehouses assuming a lazy replication model. Considering that it may be admissible to evaluate OLAP queries with slightly outdated replicated tables, our technique first efficiently computes the degree of obsolescence of replicated local tables and when such result is acceptable, given an error threshold, then the query is evaluated locally, avoiding the transmission of large tables over the network. Otherwise, the query can be remotely evaluated less efficiently with the master copy of tables, provided they are stored at a single site. Inconsistency measurement is computed by adapting distributed set reconciliation algorithms to efficiently compute the symmetric difference between the master and replicated tables. Our improved distributed database algorithm has linear communication complexity and cubic time complexity in the size of the symmetric difference, which is expected to be small in a replicated data warehouse. Our technique is independent of the method employed to propagate data warehouse insertions, deletions and updates. We present experiments simulating distributed databases, with different CPU and transmission speeds, showing our method is effective to decide if the query should be evaluated either locally or remotely.
A more well-founded security proof of the privacy-preserving distributed mining of association rules protocols
Authors: Feng Zhang, Gansen Zhao
Venue: Proceeding of the first international workshop on Model driven service engineering and data quality and security (2009)

Privacy-preserving data mining aims at discovering beneficial information from a large amount of data without violating the privacy policy. Privacy-preserving association rules mining research has already generated many interesting results. Based on commutative encryptions and the Secure Multi-party Computation (SMC) theory, Kantarcioglu and Clifton [1] propose two protocols to implement privacy-preserving mining of association rules over horizontally partitioned data. The paper addresses its incorrect security proof and introduces a more well-founded proof. This paper also identifies several other errors in [1]. This kind of protocols and their proof are a concrete application of Secure Multi-party Computation, which is be of great significances to the privacy-preserving data mining studies based on SMC. Thus establishment of the correct proof methodology is important. This paper demonstrates the correct proof methodology by correcting the fault proof in [1]
Coding schemes for relay-assisted information embedding
Authors: Abdellatif Zaidi, Luc Vandendorpe
Venue: IEEE Transactions on Information Forensics and Security (2009)

Cooperative information embedding deals with the problem of embedding unperceived information into some cover signal by different users or partners, cooperatively. It models applications in which embedded signals, or watermarks, transmitted over wireless networks need to be reinforced in order to withstand channel impairments. In cooperative information embedding, each embedder that can reinforce the embedded signal may or may not know the original cover signal. In this paper, we concentrate on the two user cases: 1) an initial embedder and 2) an assisting embedder or helper collaborate to embed some watermark into given digital media content which is transmitted over a wireless network. One important application is that of infrastructure-aided information embedding, a case in which the network provider plays the role of a helper and contributes to securing the distribution of the media, not only by blocking unauthorized signals but also by reinforcing the watermarks in legitimate signals. We investigate the two scenarios in which the helper does or does not know the cover signal. For each scenario, we derive lower and upper bounds on channel capacity. Furthermore, we also design implementable coding schemes and derive the embedding rates practically allowed by these schemes, for both scenarios. Among others, the performance characterization shows that for cooperative information embedding to be effective, careful code design is required at the initial embedder and the helper. The careful design concerns the joint conception of the embedded codes and the exploitation of the knowledge of the cover signal, if any.
Balls Hierarchy: A Proximity Query for Metric Spaces and Covering Theorem
Authors: Sinan Kockara
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

In recent years, considerable advances have been made in the field of storing and processing moving data points. Data structures that discretely update moving objects or points are called Kinetic Data Structures. A particular type of data structure that constructs geometric spanner for moving point sets is called Deformable Spanner. This paper explores the underlying philosophy of deformable spanner and describes its rudiments. Deformable Spanners create a multi-resolution hierarchical subgraph that reflects a great deal about the original graph while maintaining all the existing proximity information in the graph. This proximity information plays a crucial role in wide variety of application areas, such as fast similarity queries in metric spaces, clustering in both dynamic and static multidimensional data, and cartographic representation of the complex networks. The motivation behind our work is twofold: first, to provide comprehensive understanding of the deformable spanner with sample illustrations without sacrificing depth of coverage; second, to analyze and improve deformable spanner’s covering property for 2D case in Euclidean space.
A model-driven approach to weave architectural styles into service-oriented architectures
Authors: Marcos López-Sanz, Juan Manuel Vara, Esperanza Marcos, Carlos E. Cuesta
Venue: Proceeding of the first international workshop on Model driven service engineering and data quality and security (2009)

Model-driven development is recognized as one of the most popular approaches in Software Engineering. Recent research in the area highlights the importance of using an explicit architectural model in this context. Since current needs in software development have been adequately covered by service-oriented architectures, we have used the model-driven approach to generate service-oriented architectural models. However, the emphasis on the SOC paradigm has led to the design of architectures lacking some desirable features. Knowing the benefits provided by architectural styles, we have found that their use can help us to overcome those needs. Our goal is to obtain a service-oriented model which satisfies the requirements of the concrete architecture and complies with the constraints and vocabulary defined for a specific architectural style. To achieve this, we propose to use a weaving model which merges the architectural model with a model of the architectural style of choice.
Abnormal Video Sections Detection Based on Inter-frames Information
Authors: Wei Wang, Peng Zhang, Runsheng Wang
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

An approach is proposed for abnormal sections detection in video sequences. In this approach, firstly the histogram is selected to describe the color change in the section, and then the histograms of the frames selected from the section compose the histogram matrix. In order to improve the process efficiency, the principal components analysis (PCA) is used to reduce dimensions of the histogram matrix. Secondly the information of frames differences is used to describe the motion change information, and the information twice frame difference is used to describe the change rate. Lastly, the results gotten from the features are fused to get the final result. This method is experimented with some samples. The results show that this method can realize the abnormal detections and rank classification of video sequences, and the results are better than the other related techniques.
Subset selection in multiple linear regression: a new mathematical programming approach
Authors: Burak Eksioglu, Riza Demirer, Ismail Capar
Venue: Computers and Industrial Engineering (2005)

A new mathematical programming model is proposed to address the subset selection problem in multiple linear regression where the objective is to select a minimal subset of predictor variables without sacrificing any explanatory power. A parametric solution of this model yields a number of efficient subsets. To obtain this solution, an optimal or one of two heuristic algorithms is repeatedly used. The subsets generated are compared to ones generated by several standard procedures. The results suggest that the new approach finds subsets that compare favorably against the standard procedures in terms of the generally accepted measure: adjusted R^2.