ppxscal/embedding_network huggingface dataset:
Scanner identification using feature-based processing and analysis
Authors: Nitin Khanna, Aravind K. Mikkilineni, Edward J. Delp
Venue: IEEE Transactions on Information Forensics and Security (2009)

Digital images can be obtained through a variety of sources including digital cameras and scanners. In many cases, the ability to determine the source of a digital image is important. This paper presents methods for authenticating images that have been acquired using flatbed desktop scanners. These methods use scanner fingerprints based on statistics of imaging sensor pattern noise. To capture different types of sensor noise, a denoising filter-bank consisting four different denoising filters is used for obtaining the noise patterns. To identify the source scanner, a support vector machine classifier based on these fingerprints is used. These features are shown to achieve high classification accuracy. Furthermore, the selected fingerprints based on statistical properties of the sensor noise are shown to be robust under postprocessing operations, such as JPEG compression, contrast stretching, and sharpening.
Virtual and remote laboratories in cooperative knowledge spaces
Authors: Sabine Cikic, Sabina Jeschke, Nadine Ludwig, Uwe Sinha
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

Cooperative knowledge spaces create new potentials for the experimental fields in natural sciences and engineering because they enhance the accessibility of experimental setups through virtual laboratories and remote technology, opening them for collaborative and distributed usage. A concept for extending existing virtual knowledge spaces for the means of the technological disciplines ("ViCToR-Spaces" - Virtual Cooperation in Teaching and Research for Mathematics, Natural Sciences and Engineering) is presented. The integration of networked virtual laboratories and remote experiments will be described.
An adaptive rendezvous data dissemination for irregular sensor networks with multiple sinks
Authors: Sonia Hashish, Ahmed Karmouch
Venue: Computer Communications (2010)

Rendezvous mechanisms that mix pull and push dissemination strategies have significant importance as reporting mechanisms in sensor networks. Ordinary rendezvous approaches are optimized for flat architecture and face challenges such as irregularities in topology and the uncontrolled propagation of events. In this paper, we introduce TRDD, a topology adaptive rendezvous data dissemination approach for irregular, tiered sensor network architecture. In our proposal, sinks cooperatively build a query region QR along the perimeter of the network. This QR surrounds the network interior and forms a virtual closed region. The construction of the QR explicitly triggers interior nodes to initiate event paths to carry the events to the QR. The events could propagate in any direction yet the intersection at the query region is guaranteed. Different policies by which nodes could select the direction of events propagation (random, round-robin, centroid-based) are investigated. All of them guarantee the query-events intersection. In addition to the topological adaptation, the protocol has the ability to adapt its dissemination behavior according to the type of the submitted queries. The protocol is evaluated with simple analytical model and extensive software simulation. Comparisons to benchmark protocols that exemplify both pull and hybrid schemes are given. Results show the robustness and efficiency of the proposed solution in any network topology whether regular or irregular. Results also show noticeable reduction in the communication cost and an even distribution of events propagation through the network
CRT-based high-speed parallel architecture for long BCH encoding
Authors: Hao Chen
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Bose-Chaudhuri-Hocquenghen (BCH) error-correcting codes are now widely used in communication system and digital technology. The direct linear feedback shifted register (LFSR)-based encoding of a long BCH code suffers from the large fan-out effect of some XOR gates. This makes the LFSR-based encoders of long BCH codes not keep up with the data transmission speed in some applications. The technique for eliminating the large fan-out effect by J-unfolding method and some algebraic manipulation has been proposed. In this brief, we present a Chinese remainder theorem (CRT)-based parallel architecture for long BCH encoding. Our novel technique can be used to eliminate the fan-out bottleneck. The only restriction on the speed of long BCH encoding of our CRT-based architecture is log2 N, where N is the length of the BCH code.
A neural network to enhance local search in the permutation flowshop
Authors: Ahmed El-Bouri, Subramaniam Balakrishnan, Neil Popplewell
Venue: Computers and Industrial Engineering (2005)

This paper considers the n-job, m-machine permutation flowshop with the objective of minimizing the mean flowtime. Initial sequences that are structured to enhance the performance of local search techniques are constructed from job rankings delivered by a trained neural network. The network's training is done by using data collected from optimal sequences obtained from solved examples of flowshop problems. Once trained, the neural network provides rankable measures that can be used to construct a sequence in which jobs are located as close as possible to the positions they would occupy in an optimal sequence. The contribution of these 'neural' sequences in improving the performance of some common local search techniques, such as adjacent pairwise interchange and tabu search, is examined. Tests using initial sequences generated by different heuristics show that the sequences suggested by the neural networks are more effective in directing neighborhood search methods to lower local optima.
The impact of user constructs on e-learning effectiveness using the repertory grid
Authors: Gladys To, Robert Wright, Stephen Chan
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

The present study examines e-Learning stakeholders' cognition by examining the participants' personal and shared constructs of experience, discussing their satisfaction in using the WebCT e-learning system as a case study. The method used in the research, Repertory Grid grounded by Personal Construct Theory, allows deeper insight into the core perceptive factors that influence respondents' attitudes. We found that the respondents understood the objectives and potentials offered by the system. They felt the system helped them learn and enhanced motivation through interaction, handling problems within short periods of time. Yet not every students found e-learning suitable for his or her learning style. The study also confirmed that human factors such as the impact of face-to-face and group interactions must be considered in formulating a comprehensive set of user requirements for learning systems.
Design and evaluation of a virtual sign animated pedagogical agent
Authors: Benjaporn Saksiri, Joel S. Greenstein, Pintip Ruenwongsa
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

A Virtual Sign Animated Pedagogical Agent (VSAPA) is developed as an educational tool for d/Deaf students. This paper investigates the design issues addressed in the development of the tool and its associated learning environment. A usability testing methodology is proposed to evaluate and refine the resulting instructional system.
Impact of search results on user queries
Authors: Sofia Stamou, Lefteris Kozanidis
Venue: Proceeding of the eleventh international workshop on Web information and data management (2009)

In this paper, we experimentally study how web searchers select the keywords to describe their information needs and specifically we investigate whether query keyword selections are influenced by the results the users reviewed for a previous search. For our study, we determine two types of searches: (i) those in which users define their queries without any external influence and which we call tightly-focused and (ii) those in which users define their queries under some external influence and which we call loosely-focused. Based on the analysis of the user querying trends and web visits on the query results, we propose a model that tries to capture the results' influence on the specification of the subsequent user queries. The application of our model on a search trace of 19,250 queries issued to Google by 18 users over a period of two months reveals that in overall search results influence the specification of 12.79% of the web queries.
Getting clean with Herkimer: A software package for teaching children in special education to classify common objects
Authors: Debora L. Adler
Venue: Computers Education (1994)

Getting Clean with Herkimer is a software package designed to meet a school district goal by teaching special education students to classify grooming items. The design was derived from cognitive theories of concepts and teaching. The software was compared to another software package with similar goals and a behavioral orientation. Ten elementary-age subjects in special education who used both Getting Clean with Herkimer and the alternative software showed significantly higher pretest-posttest difference scores and significantly stronger interest scores using Getting Clean with Herkimer.
Spatial targeting using queries in a 3-D GIS environment with application to mineral exploration
Authors: Kevin Sprague, Eric de Kemp, Winston Wong, John McGaughey, Gervais Perron, Tucker Barrie
Venue: Computers Geosciences (2006)

A query framework for spatial targeting within a 3-D geographic information system (GIS) software environment is introduced. Input to a query consists of parameters relevant to the query type together with a set of Common Earth Modelling objects represented as point sets, polygonal lines, surfaces, and grids or a region set (subset) thereof. The result of a 3-D GIS query is a region within each of the input objects that consists of nodes or grid cells where the query criteria was satisfied. We provide example scenarios, drawn from mineral exploration, where 3-D queries are used to guide spatial targeting within a near-mine or regional map scale setting. Query types supported are: proximity query (to a ''probe'' object), property query (numeric attribute), shell query (containment within a closed surface), meta-data query, feature query (dome, depression, curvature), trend query (dip plane, vector) and intersection query (with a ''probe'' object). Queries can be specific for a given object type but in general transcend object types. Standard set theoretical operations for a query results in newly defined regions and are supported within the Gocad^(C) development environment. This development focuses on queries relevant in the 3-D data integration and interpretation stages of mature geological model development as well as early analysis, typically undertaken before a fully partitioned and attributed 3-D topological model is available.
Fast Haar transform based feature extraction for face representation and recognition
Authors: Yanwei Pang, Xuelong Li, Yuan Yuan, Dacheng Tao, Jing Pan
Venue: IEEE Transactions on Information Forensics and Security (2009)

Subspace learning is the process of finding a proper feature subspace and then projecting high-dimensional data onto the learned low-dimensional subspace. The projection operation requires many floating-point multiplications and additions, which makes the projection process computationally expensive. To tackle this problem, this paper proposes two simple-but-effective fast subspace learning and image projection methods, fast Haar transform (FHT) based principal component analysis and FHT based spectral regression discriminant analysis. The advantages of these two methods result from employing both the FHT for subspace learning and the integral vector for feature extraction. Experimental results on three face databases demonstrated their effectiveness and efficiency.
A Partial Video Encryption Scheme for Mobile Handheld Devices with Low Power Consideration
Authors: Dayong Wang, Yujie Zhou, Dandan Zhao, Jufa Mao
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

H.264 video applications based on mobile handheld devices are becoming more and more popular. How to protect the security has become an important topic. However, the significant power consumption of video encryption algorithms executing the limited battery capacity of handheld devices restricts the abroad use. In this paper, we propose a low power partial encryption scheme based on H.264, it combines the RC4 stream cipher, and encrypts Intra 4×4 Prediction Mode, Intra 16×16 Prediction Mode, Exponential-Golomb for MVD and level_suffix of CAVLC respectively. Experimental and analytic results show that the proposed method exhibits low power, low complexity and good security, and it hasn't effect on compression ratio. Moreover, it is suitable for secure mobile multimedia handheld products.
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Authors: Weijun Xia, Zhiming Wu
Venue: Computers and Industrial Engineering (2005)

Scheduling for the flexible job-shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. Particle swarm optimization is an evolutionary computation technique mimicking the behavior of flying birds and their means of information exchange. It combines local search (by self experience) and global search (by neighboring experience), possessing high search efficiency. Simulated annealing (SA) as a local search algorithm employs certain probability to avoid becoming trapped in a local optimum and has been proved to be effective for a variety of situations, including scheduling and sequencing. By reasonably hybridizing these two methodologies, we develop an easily implemented hybrid approach for the multi-objective flexible job-shop scheduling problem (FJSP). The results obtained from the computational study have shown that the proposed algorithm is a viable and effective approach for the multi-objective FJSP, especially for problems on a large scale.
Improve the Portability of J2ME Applications: An Architecture-Driven Approach
Authors: Xiaowei Zhang, Donggang Cao, Hong Mei
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

The porting of J2ME applications is usually difficult because of diverse device features, limited device resources, and specific issues like device bugs. Therefore, achieving high efficiency in J2ME application porting can be challenging, tedious and error-prone. In this paper, we propose an architecture-driven approach to help address these issues through improving the portability of J2ME applications. It abstracts and models the features that affect porting tasks using component model named NanoCM (Nano Component Model). The model is described in an architecture description language named NanoADL. Several open source J2ME applications are used as the case studies, and are evaluated using metrics indicating coupling, comprehensibility and complexity. Experiment results show that our approach effectively improves the portability of J2ME applications.
Study on Data Mining of Active Library Users in Networked Economy Era
Authors: Jinzhuo Zhang, Hao Jin, Peng Zhang, Chengwu Zhang
Venue: Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent Systems (2009)

In networked economy era, the development of information technology has connected tightly with the development of network technology. In this paper, a complete decision tree for active library users is constructed by using the network database theory and data mining techniques, which is based on the information gain among attributes calculated by using the library circulation information and user information. The evaluation rules of the active library users are concluded through the decision tree, and the management mode of library users is also proposed. All these things can help to make decision for library to carry out specific and in-depth services.
Active caching: a transmission method to guarantee desired communication reliability in wireless sensor networks
Authors: Dae-Young Kim, Jinsung Cho
Venue: IEEE Communications Letters (2009)

Due to the high packet loss rate during multi-hop transmissions in wireless sensor networks, more reliable end-to-end data transmission is desirable. Because wireless sensor network applications require various levels of communication reliability (CR), the end-to-end data transmission should satisfy the desired CR of the applications. In this letter, we propose a flexible loss recovery mechanism for sensor network applications with various CRs. The proposed scheme caches data packets at intermediate nodes over routing paths computed by CR to retransmit lost packets during multi-hop transmissions. Because the proposed scheme presents a tradeoff between end-to-end delays and memory requirements dependent on CR, it can be used flexibly in various sensor network applications.
Copyright Infringement and Protection in the Internet Age
Authors: John Berti
Venue: IT Professional (2009)

In this age of increasingly complex, Internet-based technologies, it's very difficult to protect original works of authorship. This article examines the problem of copyright infringement and the copyright law's desire to balance the interests of creators with the interests of the public. The author also offers some insight in how to reduce the problem of copyright infringement.
Teachers' attitudes to and beliefs about web-based Collaborative Learning Environments in the context of an international implementation
Authors: Vassilios Kollias, Nektarios Mamalougos, Xenia Vamvakoussi, Minna Lakkala, Stella Vosniadou
Venue: Computers Education (2005)

Fifty-six teachers, from four European countries, were interviewed to ascertain their attitudes to and beliefs about the Collaborative Learning Environments (CLEs) which were designed under the Innovative Technologies for Collaborative Learning Project. Their responses were analysed using categories based on a model from cultural-historical activity theory [Engestrom, Y. (1987). Learning by expanding: An activity-theoretical approach to developmental research. Helsinki: Orienta-Konsultit; Engestrom, Y., Engestrom, R., & Suntio, A. (2002). Can a school community learn to master its own future? An activity-theoretical study of expansive learning among middle school teachers. In G. Wells & G. Claxton (Eds.), Learning for life in the 21st century. Oxford: Blackwell Publishers]. The teachers were positive about CLEs and their possible role in initiating pedagogical innovation and enhancing personal professional development. This positive perception held across cultures and national boundaries. Teachers were aware of the fact that demanding planning was needed for successful implementations of CLEs. However, the specific strategies through which the teachers can guide students' inquiries in CLEs and the assessment of new competencies that may characterize student performance in the CLEs were poorly represented in the teachers' reflections on CLEs. The attitudes and beliefs of the teachers from separate countries had many similarities, but there were also some clear differences, which are discussed in the article.
Low-delay dynamic routing using fountain codes
Authors: Venkataramana Badarla, Vijay Subramanian, Douglas J. Leith
Venue: IEEE Communications Letters (2009)

This paper considers augmenting current maximum throughput routing algorithms to use fountain coding at senders. We demonstrate that this joint routing/coding approach is able to achieve significantly improved delay performance.
Are there so many sons per node in a wireless sensor network data aggregation tree?
Authors: Mário Macedo
Venue: IEEE Communications Letters (2009)

Some authors seem to believe that the average number of sons in a Wireless Sensor Network (WSN) data aggregation tree can be kept constant, even when the distances from the sink increase. But this assumption is impossible to stand in a dense and uniformly deployed network, as the number of nodes in a given level would grow exponentially, while the perimeter just grows linearly. In this letter, it is shown that the average number of sons of a given tree node is in average a quite low number, slightly higher than one, and that it tends to 1, as the distance to sink, or node depth, increases, both for 2-D, and for 3-D WSNs.
Recursive formulas for the moments of queue length in the BMAP/G/1 queue
Authors: Alexander Dudin, Valentina Klimenok, Moon Ho Lee
Venue: IEEE Communications Letters (2009)

We present recursive formulas for the moments of the joint distribution of the queue length and the state of the underlying process in the BMAP/G/1 at the service completion and arbitrary time epochs.
Query recommendations for OLAP discovery driven analysis
Authors: Arnaud Giacometti, Patrick Marcel, Elsa Negre, Arnaud Soulet
Venue: Proceeding of the ACM twelfth international workshop on Data warehousing and OLAP (2009)

Recommending database queries is an emerging and promising field of investigation. This is of particular interest in the domain of OLAP systems where the user is left with the tedious process of navigating large datacubes. In this paper we present a framework for a recommender system for OLAP users, that leverages former users' investigations to enhance discovery driven analysis. The main idea is to recommend to the user the discoveries detected in those former sessions that investigated the same unexpected data as the current session.
A Membership-Oriented Group Key Management for Application Services
Authors: Huy Hoang Ngo, Yiling Wang, Phu Dung Le, Balasubramaniam Srinivasan, Vishv Malhotra
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

Group key management is an important framework to secure group communications. To improve the performance of re-keying for group key management in large scale systems, logical hierarchical key was proposed. However, this approach does not consider the high re-keying cost of single user having multiple memberships. In this paper, we propose a membership oriented group key structure to optimize the re-keying of multiple membership users. Users in the systems are grouped into key-groups based on their memberships. Therefore, the re-keying operations for members of these groups can be combined without sacrificing forward secrecy. An analysis shows that the cost of re-keying operations in large scale multiple membership group key management can be improved with the proposed group key management.
Security analysis of the Song-Mitchell authentication protocol for low-cost RFID tags
Authors: Panagiotis Rizomiliotis, Evangelos Rekleitis, Stefanos Gritzalis
Venue: IEEE Communications Letters (2009)

In this paper, we describe an attack against one of the most efficient authentication protocols for low-cost RFID tags recently proposed by Song and Mitchell. A weak attacker, i.e. an attacker that has no access to the internal data of a tag, is able to impersonate a legitimate reader/server, and to desynchronize a tag. The attack is very efficient and has minimal computational complexity. Finally, we propose a simple solution to fix the flaw.