Miracle-dz/UniFAR-FTUs huggingface dataset:
Computer literacy and inquiry learning: when geeks learn less

Alow level of computer literacy has often been hypothesized as constituting a disadvantage in knowledge acquisition. However, within the field of computer-supported inquiry learning systematic investigations of these purported relations have not been conducted. This classroom study investigates the role of computer literacy (procedural computer-related knowledge, selfconfidenceinusingthecomputer,andfamiliaritywithcomputers)asalearningprerequisitefor knowledgeacquisition,andanalysesthelearners’patternsofmediauseasprocessesthatmight explain this role. Thirty-seven students from two final classes of a secondary school worked in pairs on the project ‘How far does light go? ’in the Web-based Inquiry Science Environment. Findings did indicate significant relations of neither procedural computer-related knowledge nor self-confidence in using the computer to knowledge acquisition. However, students with
Staggering Epidemiological Data Indicates the Need for a Paradigm Shift inErgonomic Standards of Older Adult Footwear

The United States older adult population is expected to double within the next 15 years. A growing percentage present with multiple co-morbidities that require competing footwear accommodations. Yet, attributed to footwear mass manufacturing methods, older adults often must rely on the use foot orthotics to conservatively manage lower limb ailments. However, orthotics addresses only problems at the foot, and may further limit space within a shoe. Thus, footwear manufacturers are encouraged to develop personalized solutions that can address problems at the foot, knee, and a hip. Ergonomic standards that account for individualized anthropometrics, ground reaction forces, and balance should be developed. Accordingly, a paradigm shift in footwear manufacturing methods appears necessary, and is promoted.
Managing Standards in Radical Innovation Projects – the Case of Micro Combined Heat and Power

@ @ a「ウエイ。 」エ eクゥウエゥョァ@ャゥエ・イ。 エオイ・@ヲゥョ、ウ@「ッエィ@ーッウゥエゥカ・@。 ョ、@ョ・ァ。 エゥカ・@・ヲヲ・」エウ@ッヲ@ウエ。 ョ、。 イ、ゥウ。 エゥッョ@ッョ@ゥョョッカ。 エゥッョN@iョ@エィゥウ@ー。 ー・イL@キ・ ゥョカ・ウエゥァ。 エ・@ィッキ@」ッュー。 ョゥ・ウ@」。 ョ@ュゥョゥュゥウ・@エィ・@ョ・ァ。 エゥカ・@ゥュー。 」エウ@ッヲ@ウエ。 ョ、。 イ、ウ@ッョ@エィ・ゥイ@ゥョョッカ。 エゥッョ@ーイッェ・」エウ@。 ョ、 ュ。 クゥュゥウ・@エィ・@ーッウゥエゥカ・@・ヲヲ・」エウN@wィゥャ・@・クエ。 ョエ@ャゥエ・イ。 エオイ・@ゥ、・ョエゥヲゥ・ウ@、ゥヲヲ・イ・ョエ@キ。 ケウ@ゥョ@キィゥ」ィ@ウエ。 ョ、。 イ、ウ@」。 ョ@「・ 、・カ・ャッー・、@。 ョ、@ァゥカ・ウ@ウオ」」・ウウ@ヲ。 」エッイウ@ヲッイ@」ッュー。 ョゥ・ウ@エィ。 エ@。 イ・@ゥョカッャカ・、@ゥョ@エィ・ウ・@ーイッ」・ウウ・ウL@ゥエ@、ッ・ウ@ョッエ@」ッョウゥ、・イ エィゥウ@ゥョ@エィ・@」ッョエ・クエ@ッヲ@オウゥョァ@ウエ。 ョ、。 イ、ウ@エッ@ウオーーッイエ@。 @ウー・」ゥヲゥ」@ゥョョッカ。 エゥッョ@ーイッェ・」エN@w・@。 ョ。 ャケウ・@エィ・@」。 ウ・@ッヲ@。 eオイッー・。 ョ@ュ。 ョオヲ。 」エオイ・イ@ッヲ@ィ・。 エゥョァ@ウケウエ・ュウ@エッ@オョ、・イウエ。 ョ、@ィッキ@。 @」ッュー。 ョケ@」。 ョ@ウオ」」・ウウヲオャャケ@ッカ・イ」ッュ・@「。 イイゥ・イウ エィ。 エ@ウエ。 ョ、。 イ、ウ@ーッウ・@ヲッイ@ゥエウ@ゥョョッカ。 エゥッョ@ーイッ」・ウウ@。 ョ、@エオイョ@エィ・ュ@ゥョエッ@ウオーーッイエゥョァ@ヲ。 」エッイウN@tィゥウ@ー。 ー・イ@ゥウ@「。 ウ・、@ッョ ーイ・ャゥュゥョ。 イケ@イ・ウオャエウN
Sensory evaluation and consumer acceptance of osmosed and oven-dried African star apple and African mango

Halves of deseeded and deskinned pulps of African star apple (Chrysophyllum albidum) were immersed in sucrose solutions of 44, 52 and 60°B in water bath at 27 and 40°C for 8 hours. About 10 and 15 mm slices of African mango (Irvingia gabonensis) were immersed in sucrose solutions of 52, 60 and 68°B in water bath at 27 and 40°C for 10 hours. Osmotic dehydration was evaluated by the water loss (g water/g initial mass) and solids gain (g solids/g initial mass). Fresh osmosed African star apples were oven-dried at 40, 50, 60, 70 and 80°C and African mango at 60, 70, 80 and 90°C until moisture contents of 30–40% d.b. was attained. Ten-member semi-trained and fifty-member untrained panels were involved in the sensory and consumer acceptance evaluation, respectively. Panelists evaluated the colour, taste, aroma, chewiness and overall acceptability of the osmotically-treated and oven-dried fruits, using hedonic scale preference analysis. Waterloss and solids gain increased with increasing degree of fruit ripeness, immersion time, concentration and temperature of sucrose solution. Waterloss and solids gain increased with decreasing slice thickness of African mango. Sensory evaluation showed no significant differences (P<0.05) in colour, aroma, taste and chewiness of osmosed African star apple dried at 50–70°C, but those dried at 40°C were significantly better. African star apple slices dried at 80°C received consistently poor scoring. Osmosed African mango oven-dried at 60°C was better than those oven-dried at 70–90°C. There were no significant differences in all the sensory attributes of oven-dried African star apple slices preosmosed in the sucrose solutions. However, unosmosed and dried samples received consistent poor scores for all the sensory attributes. There were no significant differences (P<0.05) in the quality attributes of preosmosed oven-dried African mango except the taste. Consumers’ acceptance showed no significant differences in all the sensory attributes of preosmosed African star apple and African mango slices.
Cyber attacks against personal and enterprise computers are rapidly evolving

My research interests broadly span the areas of operating systems and dynamic/static program analysis with a focus on building secure and robust program execution environments. Cyber attacks against personal and enterprise computers are rapidly evolving. Due to the rise of mobile computing, cloud computing, cyber-physical systems, and the “Internet of Things,” the diversity of victim computers targeted by sophisticated attacks has increased significantly. Such movement has created a new series of challenges that require highly practical solutions that most existing systems do not yet provide. In particular, many advanced security mechanisms cannot be used in production environments where even moderate performance impacts are undesirable. Also, many existing attack countermeasures designed to defend desktop/server computers are not applicable to protect small mobile and embedded devices because these devices have limited hardware capabilities and resource constraints. Furthermore, modern systems are complex and built with diverse hardware and software components, and thus they often do not allow generalized solutions but require customization. Although there have been tremendous research efforts to address general problems in software and systems security, it is still an elusive goal to practically defend such systems against constantly evolving attacks while satisfying various security and performance requirements. The primary goal of my research is building secure and robust computer systems that practically address these problems through the synergetic integration of ideas and techniques in both operating systems and program analysis. In particular, my research seeks to obtain a clear understanding of program behaviors and then use the obtained knowledge to build secure and robust run-time systems. A significant part of my past research has focused on developing novel techniques to analyze programs on various platforms [1, 2, 3, 4, 5, 6] and building customized systems to securely execute these programs while satisfying diverse requirements [5, 7, 8]. Specifically, my research comprehensively analyzed performance and security issues in personal/enterprise computers during production [1, 2, 3], identified stealthy attacks on web browsers [4], and developed a new security tool to analyze and modify binary programs on mobile and embedded devices [6]. Further, my research proposed new system architectures to protect cloud computing infrastructures from malicious code thefts [7] and kernel malware attacks [8]. With the deep understanding of program execution on diverse platforms, my research also enlightened to protect cyber-physical systems from malicious attacks while satisfying hard resource and time constraints [5]. For all of these efforts, building practical systems considering both security and performance impacts has been at the center of my research.
On-line caching as cache size varies

Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line strategy using h S k servers for the paging, weighted cache, and k-server problems. We show that when h < k the competitiveness of the marking algorithm, arandomized paging strategy, is no more than 2(ln ~ –lnln ~+~) when & > e, and at most 2 otherwise. We show this is roughly within a factor of two of optimal. Intuitively, we say a paging strategy is loosely Competitive if, for any sequence, at most cache sizes the fault rate of the pa ing strategy is at most an insignificant 7 amount above C(k times the fault rate of the optimal strategy. We show that LRU, FWF, and FIFO are loosely C'(k)-competitive provided C(k)/ in k ~ co and that the marking algorithm is loosely C(k)-competitive provided C(k) –21nlnk~ co. We formulate the off-line version of the k-server problem as a linear program and examine the dual to derive a lower bound on the performance of the optimal algorithm. We use this bound to show that for the weighted cache prc~blem the balance algorithm is-competitive. 1 Introduction In the most general version of the k-server lproblem, one is given a directed graph with edge lengths and k servers. Initially, the servers are positioned on nodes of the graph. A sequence rl, rz,. r~ of requests for service at nodes is given and after each request al server must be moved to the node if a server is not already present. The goal is to minimize the total length travelled by the servers. In the standard version of the problem, the edge weights d(i, j) satisfy d(i, j) = d(j, i), d(i, i) = O, and d(i, j) < d(i, k) + d(k, j). A special case of the k-server problem is the weighted cache problem. In this case the nodes of the graph have non-negative weights, and the cost to service a request to a node with no server is taken to be the weight of the node. A special case of the weighted cache problem is the paging problem. In this case, all of the nodes have weight one. For this problem, we adopt traditional terminology: nodes are referred to as pages, servecl nodes are Size Varies said to be in the cache, and a request to an unserved node is a fault. If all of the …
Comparative Performance Analysis of Flower Pollination Algorithm and Harmony Search based strategies: A Case Study of Applying Interaction Testing in the Real World

The main purpose of software testing is to detect software failures to ensure that that a product functions work as expected. Therefore there is need to test hug possible number of input combinations. T-way testing is a sampling approach to minimize input combinations. Recently, adapting optimization algorithm for T-way testing is very interested. As a consequence, many t-way optimization algorithm based strategies have been designed and implemented. In order to guide software tester to choose the best software testing strategy, there is a need to evaluate and benchmark the performance of each strategy against common case studies. In this paper, we present a comparison between two strategies, Harmony Search (HS) and Flower Pollination Algorithm (FPA) based strategies. Our experiments have performed on a real-world case study. Experiments results demonstrate that the performance is almost the same for both strategies and there is no one strategy can always be the best; however HS-based strategy performs better than FPA-based in many cases.
Lysophosphatidylinositol-GPR55 signaling in the regulation of metabolism and cardiometabolic disorders

G protein coupled receptor 55 (GPR55) was initially identified as the orphan receptor and then suggested to be the atypical "non-CB1/non-CB2" cannabinoid receptor. However, later studies revealed that GPR55 is specific for lysophosphatidylinositol (LPI) synthesized from membrane phosphoinositides by phospholipases A1 or A2. Recent findings suggest that LPI-GPR55 signaling is involved in the pathogenesis of cardiometabolic disorders. GPR55 is expressed in adipose tissue, endothelial cells, inflammatory cells, and cardiomyocytes. Plasma LPI concentration and GPR55 expression in the adipose tissue are modified by nutritional status, leptin level and glucose tolerance. Ligand-activated GPR55 has anabolic effect in human adipose tissue, stimulates insulin secretion, induces hyperpolarization of endothelial cells, inhibits platelet aggregation, and increases Ca 2+ concentration in cultured cardiomyocytes. In this review the recent findings about role of GPR55 signaling in adipose tissue, metabolic homeostasis and cardiovascular system are summarized. Adipobiology 2013; 5: 23-31.
Nurse perceptions of workplace environment: differences across shifts.

AIM To evaluate whether nurse work shift affected workplace perceptions. BACKGROUND Although the importance of work schedule in shaping work attitudes, generally (and specifically for nurses) is well accepted, much work remains in characterising how and why nurses' perceptions might differ across shifts. METHODS Using an exploratory study of observational data, we examined whether shift influenced non-supervisory nurses' job perceptions in the Veterans Health Administration All Employee Survey (n = 14057; years 2008, 2010, 2012). The size of differences in item means (95% C.I.) across shifts was evaluated graphically. Using ordinal logistic regression, we accounted for the ordinal outcome variables and controlled for the demographic and survey year effects. RESULTS Nurses' perceptions of workplace climate differed across shifts. Items with the greatest differences, consistent across years and analytic methods, involved supervisors and fairness. Night and weekend shift nurse ratings were more negative than for weekday shift nurses. CONCLUSIONS Off-shift nurses are less satisfied with work/life balance, their supervisors and especially fairness. Overall satisfaction and turnover intention are not affected to the same extent. IMPLICATIONS FOR NURSING MANAGEMENT These results indicate several specific areas that nurse managers can address through workforce support and communication.
General all-Layers combined with Efficient WLAN MAC Layer Headers Compression

For wireless systems, it is of vital importance to use the scarce radio resources in an efficient way. In a typical system, each layer adds its own header, resulting in prohibitive signaling overhead. Several header compression schemes have been proposed to reduce this overhead. All compression schemes must be kept simple to cope with high load. Unfortunately, existing compression schemes cover, each, no more than two layers taking advantage of header format knowledge. We propose a header compression scheme that can cover all layers, from the 802.11 MAC layer up to the Application layer, without required knowledge of the headers format. We compare our proposal to a general simple compression scheme, and show that our proposal processing time is 60% faster. We show that on average, in a typical scenario, with high SNR, we reduce the header overhead by 70 bytes.
A Service Sharing Approach to Integrating Program Comprehension Tools

Software maintenance is the most time consuming and costly phase of the software development lifecycle. For every dollar spent on creating a new software system, nine dollars is spent on maintaining it throughout its useful life. By the late 1980s maintenance spending accounted for an estimated US$30 billion worldwide. Any activity that even minimally reduces maintenance efforts would yield significant cost savings within the software industry [3]. Tool support for maintainers has focused largely on providing assistance in activities related to program comprehension. The goal of these tools is to provide a rapid means for maintainers to understand large scale software systems. Most program comprehension tools have a specific strength or specialized application area [10] but are weak in other areas. No single tool exists that provides all the functionality and flexibility that most software maintainers need. For this reason, research attention has been focused on getting program comprehension tools to integrate with each other. In this paper we present a novel approach to facilitating integration among tools used by maintainers to assist in program comprehension. We start by showing that program comprehension tools have many similar characteristics. Taking full advantage of this fact, we outline how specially designed adapters and a domain ontology can be used together to allow these tools to integrate transparently with each other.
Intelligent Control of Metal Filling by Welding Robots

filling, Laser array sensor. Abstract: robot model of three-arm and five-degree freedom plus large scope of traversing welding was established, and decoupling of models of "large scope of traversing ", "triangle movement of two arms" and "spherical movement of one arm" was realized. The model of "triangle movement of two arms "is able to use geometrical calculation to solve the kinematics inverse problem , avoid the multiplicity, improve the calculation speed, eliminate the blind spots of the motions of welding gun of welding robot, and simplify the kinematic pair of kinematic mechanism for the arc filling strategy during welding travelling of robot. Binocular stereo vision camera was used to detect the edges of welds, and laser array sensor was used to measure the weld data. The matlab program is designed according to the shape of weld to calculate the amount of metal filling. Relevant date has been used to calculate the accuracy of the percent and analyze the factors that lead to the errors.
Accommodative extractor for QIM-based watermarking schemes

In quantisation index modulation-based watermarking methods, each host coefficient is replaced by an adequate quantiser according to the embedded bit. However, after the attack, the distribution of the hosts does not remain the same, resulting in a failure to map coefficients to their correct bits. To maintain a good quality, many authors focused on improving the extraction, rather than playing on the embedding parameters. They used a reference message to define the parameters of the channel model after the attack. However, the available solutions were not effective, whereas the reference message cannot describe the channel alteration due to a shortage of samples, and the complexity of attacks modelling. To overcome these problems, the authors relied on a diversification technique, which allowed to enlarge and vary the samples. Then, based on quantisation embedding rules, they generated an accommodative detection model for each attack. At the extraction phase, the suitable detection model was identified by means of a reference message. To reinforce the security of their scheme, the watermark was initially shuffled, which prevents any unauthorised detection attempt. Both geometric and signal processing attacks were used in the validation of their method. The reduction of bit-error rate with respect to the conventional detection method reached up to 100%.
Effective Ransomware Detection Using Entropy Estimation of Files for Cloud Services

A variety of data-based services such as cloud services and big data-based services have emerged in recent times. These services store data and derive the value of the data. The reliability and integrity of the data must be ensured. Unfortunately, attackers have taken valuable data as hostage for money in attacks called ransomware. It is difficult to recover original data from files in systems infected by ransomware because they are encrypted and cannot be accessed without keys. There are cloud services to backup data; however, encrypted files are synchronized with the cloud service. Therefore, the original file cannot be restored even from the cloud when the victim systems are infected. Therefore, in this paper, we propose a method to effectively detect ransomware for cloud services. The proposed method detects infected files by estimating the entropy to synchronize files based on uniformity, one of the characteristics of encrypted files. For the experiment, files containing sensitive user information and system files for system operation were selected. In this study, we detected 100% of the infected files in all file formats, with no false positives or false negatives. We demonstrate that our proposed ransomware detection method was very effective compared to other existing methods. Based on the results of this paper, we expect that this detection method will not synchronize with a cloud server by detecting infected files even if the victim systems are infected with ransomware. In addition, we expect to restore the original files by backing up the files stored on the cloud server.
Spatial covariance improves BCI performance for late ERPs components with high temporal variability

Objective. Event Related Potentials (ERPs) reflecting cognitive response to external stimuli, are widely used in brain computer interfaces. ERP waveforms are characterized by a series of components of particular latency and amplitude. The classical ERP decoding methods exploit this waveform characteristic and thus achieve a high performance only if there is sufficient time- and phase-locking across trials. The required condition is not fulfilled if the experimental tasks are challenging or if it is needed to generalize across various experimental conditions. Features based on spatial covariances across channels can potentially overcome the latency jitter and delays since they aggregate the information across time. Approach. We compared the performance stability of waveform and covariance-based features as well as their combination in two simulated scenarios: 1) generalization across experiments on Error-related Potentials and 2) dealing with larger latency jitter across trials. Main results. The features based on spatial covariances provide a stable performance with a minor decline under jitter levels of up to ± 300 ms, whereas the decoding performance with waveform features quickly drops from 0.85 to 0.55 AUC. The generalization across ErrP experiments also resulted in a significantly more stable performance with covariance-based features. Significance. The results confirmed our hypothesis that covariance-based features can be used to: 1) classify more reliably ERPs with higher intrinsic variability in more challenging real-life applications and 2) generalize across related experimental protocols.
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits

We show that there is an equation of degree at most poly(n) for the (Zariski closure of the) set of the non-rigid matrices: That is, we show that for every large enough field 𝔽, there is a non-zero n2-variate polynomial P ε 𝔽[x1, 1, . , xn, n] of degree at most poly(n) such that every matrix M that can be written as a sum of a matrix of rank at most n/100 and a matrix of sparsity at most n2/100 satisfies P(M) = 0. This confirms a conjecture of Gesmundo, Hauenstein, Ikenmeyer, and Landsberg [9] and improves the best upper bound known for this problem down from exp (n2) [9, 12] to poly(n). We also show a similar polynomial degree bound for the (Zariski closure of the) set of all matrices M such that the linear transformation represented by M can be computed by an algebraic circuit with at most n2/200 edges (without any restriction on the depth). As far as we are aware, no such bound was known prior to this work when the depth of the circuits is unbounded. Our methods are elementary and short and rely on a polynomial map of Shpilka and Volkovich [21] to construct low-degree “universal” maps for non-rigid matrices and small linear circuits. Combining this construction with a simple dimension counting argument to show that any such polynomial map has a low-degree annihilating polynomial completes the proof. As a corollary, we show that any derandomization of the polynomial identity testing problem will imply new circuit lower bounds. A similar (but incomparable) theorem was proved by Kabanets and Impagliazzo [11].