Search DaniWeb - n97

Evaluating OpenAI GPT 4.1 for Text Summarization and Classification Tasks 1 Week Ago by usmanmalik57 On April 14, 2025, OpenAI released [GPT-4.1](https://openai.com/index/gpt-4-1/) — a model touted as the new state-of-the-art, outperforming GPT-4o on all major benchmarks. As always, I like to evaluate new LLMs on simple tasks like text classification and summarization to see how they compare with current leading models. In this article, I will… Re: Differential Directory, indexing method 1 Week Ago by xrjf "Just to clarify a previous mistake: the efficiency should be K × N × log₂(N), not K × log₂(N) as I initially wrote." Re: Differential Directory, indexing method 1 Week Ago by xrjf For example, as Donald Knuth points out in The Art of Computer Programming, the theoretical lower bound for comparison-based sorting algorithms is K × log₂(N). I developed a very simple method that matches this performance. However, DiDi goes far beyond: its performance is proportional to K × (maximum key length), regardless of the number of … Re: Differential Directory, indexing method 1 Week Ago by xrjf As an illustration, consider the theoretical lower bound for comparison-based sorting, as stated by Donald Knuth in The Art of Computer Programming: K × log₂(N). I developed a simple method that matches this limit. For example, to sort the list {2, 5, 7, 1, 4, 3, 8, 6}: Sort pairs: (2, 5) → [1] (1, 7) → [2] (3, 4) → [3] (6, 8) → [4] Merge… Re: Question/Answering over SQL Data Using LangGraph Framework 2 Weeks Ago by Pelorus_1 Through its combination of natural language processing and structured query generation, LangGraph makes interfacing with databases and extracting insights over SQL data easier than ever. Text Classification and Summarization with DeepSeek R1 Distill Llama 70B 2 Months Ago by usmanmalik57 In the [last article](https://www.daniweb.com/programming/computer-science/tutorials/542973/benchmarking-deepseek-r1-for-text-classification-and-summarization#post2300447), I explained how you can use the [DeepSeek-R1-Distill-Qwen-32B](https://huggingface.co/deepseek-ai/DeepSeek-R1-Distill-Qwen-32B) model for text classification and summarization … DeepSeek R1 vs Llama 3.1-405b for Text Classification and Summarization 1 Month Ago by usmanmalik57 In a [previous article](https://www.daniweb.com/programming/computer-science/tutorials/543028/text-classification-and-summarization-with-deepseek-r1-distill-llama-70b), I presented a comparison of [DeepSeek-R1-Distill-Llama-70b](https://huggingface.co/deepseek-ai/DeepSeek-R1-Distill-Llama-70B) with the [DeepSeek-R1-Distill-Qwen-32B](https://… Re: Hello Everyone, I'm Ray Brad 1 Month Ago by Dani > Hi Ray, > can you guide what kind of this error is ? i am getting this on my e-commerce store which is on shopify. I got to know this error from microsoft clarity summary. (Most users encountered JavaScript errors on various product pages, such as "t[n] is not a function" and "Cannot read properties of null (reading '… Re: Text Classification and Summarization with DeepSeek R1 Distill Llama 70B 2 Months Ago by rproffitt "Wiz Research Uncovers Exposed DeepSeek Database Leaking Sensitive Information" "Security researchers tested 50 well-known jailbreaks against DeepSeek’s popular new AI chatbot. It didn’t stop a single one." It only seems to get worse the more you look at DeepSeek. And I must note how it is known to not want to talk about … Re: Text Classification and Summarization with DeepSeek R1 Distill Llama 70B 2 Months Ago by policenbicleara Llama-70B struggles with sentiment analysis (69% accuracy) vs. Qwen-32B (87%). Summarization performance is weaker, with lower ROUGE scores. Qwen-32B is the better choice—smaller, faster, and more accurate. Re: Text Classification and Summarization with DeepSeek R1 Distill Llama 70B 1 Month Ago by Pelorus_1 Great breakdown of DeepSeek R1 Distill LLaMA 70B! The explanation of text classification and summarization is clear and insightful. Appreciate the practical examples—makes implementation much easier. Thanks for sharing! Re: How Can I Hookup My Mobile Phones To My PC Monitor ? 1 Month Ago by Deborah_5 How Can I Hookup My Mobile Phones To My PC Monitor ? Re: How Can I Hookup My Mobile Phones To My PC Monitor ? 1 Month Ago by Fitmovers If you want to connect your Samsung Galaxy A9 to your Dell E1916HV monitor, you'll need a USB-C to HDMI adapter (if your phone supports HDMI output). Since your phone has only USB ports, check if it supports Samsung DeX or screen mirroring via an MHL adapter. If your monitor only has VGA input, you might also need an HDMI to VGA converter. N-Tier C# Master Detail 11 Years Ago by ahmed_one N-Tier C# Master Detail member I am using Visual Studio 2010, Sql server Express Edition & C#. I have develop a simple Master Detail application (mostly with the help of experts help from this forum) An Order system, and now I want to go one step further from simple application to N-Tier version. Did some search on net and came up with … Re: "\n\n" 15 Years Ago by Xlphos \n means new line Start: Welcome to main menu End. Re: \n 15 Years Ago by tomtetlaw In C, the '\n' character is a special type of character called a control character, these are characters that do something other then just display themselves, here is all the ones that I know: \n = newline \t = tab \a = This one rocks, it makes the computer make a beeping sound :D The difference between those follows: Say you called the … Re: \n 15 Years Ago by kvprajapati It [b]discards unwanted white space[/b]. A white-space character in the control string causes scanf() to skip over one or more leading white-space characters in the input stream. [code] int main() { char ch,ch1; printf("Enter two chars : "); scanf("%c\n%c",&ch,&ch1); printf("\n%c\n%c",ch,ch1);… \n 15 Years Ago by luoyangke who can tell me what the use of "\n" is? and what the difference between [CODE]scanf("%d",&j); [/CODE]and [CODE]scanf("%d\n",&j)[/CODE];? Re: \n 15 Years Ago by Iam3R if i use this in a program its keep on taking the return key the program not getting terminated, whats the problem? [CODE]scanf("%d\n",&j)[/CODE] N-Queen Problem Solving C Program 14 Years Ago by udinnet I made my own program for N-queen problem (A popular algorithm in Data Structures). Check this code and post your suggestions. If you have any ideas for the improvement of algorithm speed, please post here. Thanks. [CODE] #include <stdio.h> #include <stdlib.h> //N-Queen Chess problem solving Algorithm// //Note:- Uncomment The printf… N queens w/ recursion HELP C++ 16 Years Ago by ChickenFox Hi I'm currently taking an introductory programming course and my final project is to write the infamous N-Queens program (find & display all possible solutions for N queens on an NxN board such that they cannot attack one another) using recursion I feel like I at least have a slight grasp of what I'm supposd to be doing, however when I run … Re: N queens w/ recursion HELP C++ 16 Years Ago by VernonDozier [QUOTE=ChickenFox;617758]yea your right I meant '=='...but even with that my code is still crashing (or infinite looping I guess) I'm still not sure why the function is looping infinitely (and I'm quite clueless as to how to debug at all besides using std::cout to see whats going on...but that doens't work since the program crashes right after i… Re: N-queens problem - solution in nasm 16 Years Ago by fmartins Here is the code: [code=asm] ; queens.asm ; ; The n queens problem, in nasm. ; Solves the n-queens problem by a depth-first tree search. ; Board symmetries are not considered. ; ; Output format: ; Solutions are printed as a sequence of n integers. Each integer ; gives the position of a queen in a column. For example, for n=8, ; the … n queen backtracking help... 12 Years Ago by mimah1 #include <iostream> using namespace std; char chessboard[100][100] ={' '}; int n; int savingposition[100][2]={ }; //checking rows.... bool checking (int row, int column){ for(int i = 0; i< n; i++){ for(int j = 0; j < n; j++) { if((j+i== column+row|| column - row == j-i || … Re: N queens w/ recursion HELP C++ 16 Years Ago by VernonDozier I am somewhat familiar with the problem, though not very familiar with the algorithm to solve it. I ran your code with some debugging output. Your function: [code] void nqueen(int board[], int col, int row) [/code] is called thousands of time with row and col equal to 1 so you are in an infinite recursive call, eventually leading to a stack … Re: N queens w/ recursion HELP C++ 16 Years Ago by ChickenFox yea your right I meant '=='...but even with that my code is still crashing (or infinite looping I guess) I'm still not sure why the function is looping infinitely (and I'm quite clueless as to how to debug at all besides using std::cout to see whats going on...but that doens't work since the program crashes right after i input N) thx alot for… Re: N queens w/ recursion HELP C++ 16 Years Ago by ChickenFox yay...well i came to the realization that the way i had coded it the first (base) condition should've been "if (col == n){ solution found}" now I'm just trying to fix the fact that the program finds only this first solution and juss keeps looping this one solution Re: N Queen 15 Years Ago by bangonkali you can try this one: [CODE]# include<stdio.h> int v,i,j,k,l,s,a[99]; int main() { for(s=8;*a-s;v=a[j*=v]-a[i],k=i<s,j+=(v=j<s&&(!k&&!!printf(2+"\n\n%c"-(!l<<!j)," #Q"[l^v?(l^j)&1:2])&&++l||a[i]<s&&v&&v-i+j&&v+i-j))&&!(l%=s),v||(i==j?a[i+=k]=… Re: n queen backtracking help... 12 Years Ago by mimah1 else if(chessboard[row][column] != 'Q' && column == n ){ row = row-1; column = savingposition[row][1]; chessboard[row][column] = '-'; // go back and put '-' in place of 'Q' if(column < n) column = … Re: n queen backtracking help... 12 Years Ago by mimah1 i am trying to show the solution for the n size chess board. however the program is not backtracking at all. i am confused on where i should be fixing ...this is what i got so far else if(chessboard[row][column] != 'Q' && column == n ){ //if there is no place to put 'Q in the row' and the loop has reached at the end of the column…